Related papers: Reliable eigenspace error estimation using source …
We consider the a posteriori error analysis of approximations of parabolic problems based on arbitrarily high-order conforming Galerkin spatial discretizations and arbitrarily high-order discontinuous Galerkin temporal discretizations.…
Proofs of convergence of adaptive finite element methods for the approximation of eigenvalues and eigenfunctions of linear elliptic problems have been given in a several recent papers. A key step in establishing such results for multiple…
We study the generalized finite element methods (GFEMs) for the second-order elliptic eigenvalue problem with an interface in 1D. The linear stable generalized finite element methods (SGFEM) were recently developed for the elliptic source…
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…
The issue of single-grid discretization error estimator, operating in the postprocessor mode, is addressed in the paper. An ensemble of numerical solutions, obtained using solvers of different accuracy, is shown to provide an upper estimate…
A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…
We introduce two a posteriori error estimators for N\'ed\'elec finite element discretizations of the curl-curl problem. These estimators pertain to a new Prager-Synge identity and an associated equilibration procedure. They are reliable and…
Kernel-based methods in Numerical Analysis have the advantage of yielding optimal recovery processes in the "native" Hilbert space $\calh$ in which they are reproducing. Continuous kernels on compact domains have an expansion into…
An interior-point algorithm framework is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problems. The main setting of interest is when the objective and constraint functions may be nonlinear…
We propose a cheaper version of \textit{a posteriori} error estimator from arXiv:1707.00057 for the linear second-order wave equation discretized by the Newmark scheme in time and by the finite element method in space. The new estimator…
Regular convergence, together with various other types of convergence, has been studied since the 1970s for the discrete approximations of linear operators. In this paper, we consider the eigenvalue approximation of compact operators whose…
Reliable and efficient computation of the pseudospectral abscissa in the large-scale setting is still not settled. Unlike the small-scale setting where there are globally convergent criss-cross algorithms, all algorithms in the large-scale…
In this article, we introduce a general theoretical framework to analyze non-consistent approximations of the discrete eigenmodes of a self-adjoint operator. We focus in particular on the discrete eigenvalues laying in spectral gaps. We…
We consider Poisson's equation with a finite number of weighted Dirac masses as a source term, together with its discretization by means of conforming finite elements. For the error in fractional Sobolev spaces, we propose residual-type a…
In this work, we propose an easy-to-implement fixed-point algorithm for reconstructing a space-time dependent source in a subdiffusion model from lateral boundary measurements. The numerical scheme combines a Galerkin finite element method…
We introduce and explain key relations between a posteriori error estimates and subspace correction methods viewed as preconditioners for problems in infinite dimensional Hilbert spaces. We set the stage using the Finite Element Exterior…
Large-scale eigenvalue problems pose a significant challenge to classical computers. While there are efficient quantum algorithms for unitary or Hermitian matrices, eigenvalue problems for non-normal matrices remain open in quantum…
We consider so-called Herrmann and Hydrostatic mixed formulations of classical linear elasticity and analyse the error associated with locally stabilised $P_1-P_0$ finite element approximation. First, we prove a stability estimate for the…
Image segmentation is an inherently ill-posed problem and thus requires regularization in order to limit the search space to reasonable solutions. A majority of segmentation methods integrates these regularization terms in one way or the…
The primal-dual gap is a natural upper bound for the energy error and, for uniformly convex minimization problems, also for the error in the energy norm. This feature can be used to construct reliable primal-dual gap error estimators for…