Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: conforming approximations
This paper derives a posteriori error estimates for conforming numerical approximations of
the Laplace eigenvalue problem with a homogeneous Dirichlet boundary condition. In …
the Laplace eigenvalue problem with a homogeneous Dirichlet boundary condition. In …
Computation of eigenvalues by numerical upscaling
We present numerical upscaling techniques for a class of linear second-order self-adjoint
elliptic partial differential operators (or their high-resolution finite element discretization). As …
elliptic partial differential operators (or their high-resolution finite element discretization). As …
Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic pde problems
Abstract The Adaptive Finite Element Method (AFEM) for approximating solutions of PDE
boundary value and eigenvalue problems is a numerical scheme that automatically and …
boundary value and eigenvalue problems is a numerical scheme that automatically and …
Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: a unified framework
This paper develops a general framework for a posteriori error estimates in numerical
approximations of the Laplace eigenvalue problem, applicable to all standard numerical …
approximations of the Laplace eigenvalue problem, applicable to all standard numerical …
An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity
This paper presents a combined adaptive finite element method with an iterative algebraic
eigenvalue solver for a symmetric eigenvalue problem of asymptotic quasi-optimal …
eigenvalue solver for a symmetric eigenvalue problem of asymptotic quasi-optimal …
Convergence and quasi-optimal complexity of adaptive finite element computations for multiple eigenvalues
X Dai, L He, A Zhou - IMA Journal of Numerical Analysis, 2015 - academic.oup.com
In this paper, we study an adaptive finite element for multiple eigenvalues of second order
elliptic partial differential equations. We obtain both the asymptotic contraction property and …
elliptic partial differential equations. We obtain both the asymptotic contraction property and …
A posteriori error estimation for the non-self-consistent Kohn–Sham equations
We address the problem of rigorously bounding the errors in the numerical solution of the
Kohn–Sham equations due to (i) the finiteness of the basis set,(ii) the convergence …
Kohn–Sham equations due to (i) the finiteness of the basis set,(ii) the convergence …
An adaptive algorithm based on the shifted inverse iteration for the Steklov eigenvalue problem
H Bi, H Li, Y Yang - Applied Numerical Mathematics, 2016 - Elsevier
This paper proposes and analyzes an a posteriori error estimator for the finite element multi-
scale discretization approximation of the Steklov eigenvalue problem. Based on the a …
scale discretization approximation of the Steklov eigenvalue problem. Based on the a …
An adaptive homotopy approach for non-selfadjoint eigenvalue problems
This paper presents adaptive algorithms for eigenvalue problems associated with non-
selfadjoint partial differential operators. The basis for the developed algorithms is a …
selfadjoint partial differential operators. The basis for the developed algorithms is a …
Superconvergent two-grid methods for elliptic eigenvalue problems
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and
numerically tested. The methods combine advantages of the two-grid algorithm (Xu and …
numerically tested. The methods combine advantages of the two-grid algorithm (Xu and …