On the numerical solution of some semilinear elliptic problems.
Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken P1 function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the L2 norm, under the sufficient condition that the...
Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken P1 function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the L2 norm, under the sufficient condition that the...
In a crystalline algorithm, a tangential velocity is used implicitly. In this short note, it is specified for the case of evolving plane curves, and is characterized by using the intrinsic heat equation.
We prove the optimal convergence of a discontinuous-Galerkin-based immersed boundary method introduced earlier [Lew and Buscaglia, Int. J. Numer. Methods Eng.76 (2008) 427–454]. By switching to a discontinuous Galerkin discretization near the boundary, this method overcomes the suboptimal convergence rate that may arise in immersed boundary methods when strongly imposing essential boundary conditions. We consider a model Poisson's problem with homogeneous boundary conditions over two-dimensional...
We prove the optimal convergence of a discontinuous-Galerkin-based immersed boundary method introduced earlier [Lew and Buscaglia, Int. J. Numer. Methods Eng.76 (2008) 427–454]. By switching to a discontinuous Galerkin discretization near the boundary, this method overcomes the suboptimal convergence rate that may arise in immersed boundary methods when strongly imposing essential boundary conditions. We consider a model Poisson's problem with homogeneous boundary conditions over two-dimensional...
We present an improved, near-optimal hp error estimate for a non-conforming finite element method, called the mortar method (M0). We also present a new hp mortaring technique, called the mortar method (MP), and derive h, p and hp error estimates for it, in the presence of quasiuniform and non-quasiuniform meshes. Our theoretical results, augmented by the computational evidence we present, show that like (M0), (MP) is also a viable mortaring technique for the hp method.
Finite element semidiscrete approximations on nonlinear dynamic shallow shell models in considered. It is shown that the algorithm leads to global, optimal rates of convergence. The result presented in the paper improves upon the existing literature where the rates of convergence were derived for small initial data only [19].
In this paper we study the -version of the Partition of Unity Method for the Helmholtz equation. The method is obtained by employing the standard bilinear finite element basis on a mesh of quadrilaterals discretizing the domain as the Partition of Unity used to paste together local bases of special wave-functions employed at the mesh vertices. The main topic of the paper is the comparison of the performance of the method for two choices of local basis functions, namely a) plane-waves, and b) wave-bands....
We are concerned with a finite element approximation for time-harmonic wave propagation governed by the Helmholtz equation. The usually oscillatory behavior of solutions, along with numerical dispersion, render standard finite element methods grossly inefficient already in medium-frequency regimes. As an alternative, methods that incorporate information about the solution in the form of plane waves have been proposed. We focus on a class of Trefftz-type discontinuous Galerkin methods that ...
In this paper we propose a method for improving the convergence rate of the mixed finite element approximations for the Stokes eigenvalue problem. It is based on a postprocessing strategy that consists of solving an additional Stokes source problem on an augmented mixed finite element space which can be constructed either by refining the mesh or by using the same mesh but increasing the order of the mixed finite element space.