We present an algorithm of finding the Hamiltonian cycle in a general undirected graph by minimization of an appropriately chosen functional. This functional depends on the characteristic polynomial of the graph Laplacian matrix and attains its minimum at the characteristic polynomial of the Laplacian matrix of the Hamiltonian cycle.

We analyze semidiscrete and second-order in time fully discrete finite element methods for the Kuramoto-Sivashinsky equation.

We present the numerical analysis on the Poisson problem of two mixed Petrov-Galerkin finite volume schemes for equations in divergence form $\mathrm{div}\varphi (u,\nabla u)=f$. The first scheme, which has been introduced in [CITE], is a generalization in two dimensions of Keller's box-scheme. The second scheme is the dual of the first one, and is a cell-centered scheme for u and the flux φ. For the first scheme, the two trial finite element spaces are the nonconforming space of Crouzeix-Raviart for the primal unknown u...

In this paper, we study some finite volume schemes for the nonlinear hyperbolic equation $u_t(x,t)+\text{div}F(x,t,u(x,t))=0$ with the initial condition $u_0\in L^{\infty }\left({ℝ}^N\right)$. Passing to the limit in these schemes, we prove the existence of an entropy solution $u\in L^{i}nfty({ℝ}^N\times {ℝ}_{+})$. Proving also uniqueness, we obtain the convergence of the finite volume approximation to the entropy solution in $L_{loc}^p({ℝ}^N\times {ℝ}_{+})$, 1 ≤ p ≤ +∞. Furthermore, if $u_0\in L^{\infty }\cap {\text{BV}}_{loc}\left({ℝ}^N\right)$, we show that $u\in {\text{BV}}_{loc}({ℝ}^N\times {ℝ}_{+})$, which leads to an “$h^{\frac{1}{4}}$” error estimate between the approximate and the entropy solutions (where h defines the size of the...

We present a fully adaptive multiresolution scheme for spatially one-dimensional quasilinear strongly degenerate parabolic equations with zero-flux and periodic boundary conditions. The numerical scheme is based on a finite volume discretization using the Engquist-Osher numerical flux and explicit time stepping. An adaptive multiresolution scheme based on cell averages is then used to speed up the CPU time and the memory requirements of the underlying finite volume scheme, whose first-order...

A posteriori error estimates for a nonlinear parabolic problem are introduced. A fully discrete scheme is studied. The space discretization is based on a concept of hierarchical finite element basis functions. The time discretization is done using singly implicit Runge-Kutta method (SIRK). The convergence of the effectivity index is proven.

We consider an initial and Dirichlet boundary value problem for a fourth-order linear stochastic parabolic equation, in one space dimension, forced by an additive space-time white noise. Discretizing the space-time white noise a modelling error is introduced and a regularized fourth-order linear stochastic parabolic problem is obtained. Fully-discrete approximations to the solution of the regularized problem are constructed by using, for discretization in space, a Galerkin finite element method...