Related papers: Exponential meshes and $\mathcal{H}$-matrices
In this paper, we are concerned with the convergence rate of a FEM based numerical scheme approximating extremal functions of the Sobolev inequality. We prove that when the domain is polygonal and convex in $\R^2$, the convergence of a…
The hp-version of the finite element method is applied to singularly perturbed reaction-diffusion type equations on polygonal domains. The solution exhibits boundary layers as well as corner layers. On a class of meshes that are suitable…
In the present paper, we propose a block variant of the extended Hessenberg process for computing approximations of matrix functions and other problems producing large-scale matrices. Applications to the computation of a matrix function…
This article deals with the adaptive and approximative computation of the Lam\'e equations. The equations of linear elasticity are considered as boundary integral equations and solved in the setting of the boundary element method (BEM).…
We present useful connections between the finite difference and the finite element methods for a model boundary value problem. We start from the observation that, in the finite element context, the interpolant of the solution in one…
For linear parabolic initial-boundary value problems with self-adjoint, time-homogeneous elliptic spatial operator in divergence form with Lipschitz-continuous coefficients, and for incompatible, time-analytic forcing term in…
The Finite Element Method (FEM) is widely used to solve discrete Partial Differential Equations (PDEs) in engineering and graphics applications. The popularity of FEM led to the development of a large family of variants, most of which…
This paper contains construction and analysis a finite element approximation for convection dominated diffusion problems with full coefficient matrix on general simplicial partitions in $R^d$, $d=2,3$. This construction is quite close to…
We study the fully explicit numerical approximation of a semilinear elliptic boundary value model problem, which features a monomial reaction and analytic forcing, in a bounded polygon $\Omega\subset\mathbb{R}^2$ with a finite number of…
We consider shape optimization problems subject to elliptic partial differential equations. In the context of the finite element method, the geometry to be optimized is represented by the computational mesh, and the optimization proceeds by…
The recently proposed soft finite element method (SoftFEM) reduces the stiffness (condition numbers), consequently improving the overall approximation accuracy. The method subtracts a least-square term that penalizes the gradient jumps…
We consider the efficient solution of strongly elliptic partial differential equations with random load based on the finite element method. The solution's two-point correlation can efficiently be approximated by means of an…
We analyze the convergence of degenerate approximations to Green's function of elliptic boundary value problems with high-contrast coefficients. It is shown that the convergence is independent of the contrast if the error is measured with…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
We discuss the $p$- and the $hp$-versions of the virtual element method for the approximation of eigenpairs of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr\"odinger…
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…
We prove that for compactly perturbed elliptic problems, where the corresponding bilinear form satisfies a Garding inequality, adaptive mesh-refinement is capable of overcoming the preasymptotic behavior and eventually leads to convergence…
In this paper, we develop and study algorithms for approximately solving the linear algebraic systems: $\mathcal{A}_h^\alpha u_h = f_h$, $ 0< \alpha <1$, for $u_h, f_h \in V_h$ with $V_h$ a finite element approximation space. Such problems…
We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…