Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems
From MaRDI portal
Publication:2052458
Abstract: We present a perturbed subspace iteration algorithm to approximate the lowermost eigenvalue cluster of an elliptic eigenvalue problem. As a prototype, we consider the Laplace eigenvalue problem posed in a polygonal domain. The algorithm is motivated by the analysis of inexact (perturbed) inverse iteration algorithms in numerical linear algebra. We couple the perturbed inverse iteration approach with mesh refinement strategy based on residual estimators. We demonstrate our approach on model problems in two and three dimensions.
Recommendations
- An adaptive inverse iteration finite element algorithm for eigenvalue problems
- A convergent adaptive method for elliptic eigenvalue problems
- An iterative adaptive finite element method for elliptic eigenvalue problems
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- Invertible smoothing preconditioners for linear discrete ill-posed problems
- scientific article; zbMATH DE number 6453385
- Inexact inverse iteration for generalized eigenvalue problems
- scientific article; zbMATH DE number 5808749
- Acceleration of inexact inverse iteration for eigenvalue problems
- A shifted-inverse adaptive multigrid method for the elastic eigenvalue problem
Cites work
- A Posteriori Error Estimates for the Finite Element Approximation of Eigenvalue Problems
- \(hp\)-adaptive composite discontinuous Galerkin methods for elliptic eigenvalue problems on complicated domains
- A Convergent Adaptive Algorithm for Poisson’s Equation
- A convergent adaptive method for elliptic eigenvalue problems
- A Flexible, Parallel, Adaptive Geometric Multigrid Method for FEM
- A framework for robust eigenvalue and eigenvector error estimation and Ritz value convergence enhancement
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- A Multilevel Algebraic Error Estimator and the Corresponding Iterative Solver with p-Robust Behavior
- A posteriori error estimates including algebraic error and stopping criteria for iterative solvers
- A posteriori error estimators for convection-diffusion eigenvalue problems
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- A story on adaptive finite element computations for elliptic eigenvalue problems
- A two-grid discretization scheme for eigenvalue problems
- Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
- Adaptive eigenvalue computation: Complexity estimates
- Adaptive error control for multigrid finite element methods
- Adaptive finite element methods with convergence rates
- Adaptive finite element solution of eigenvalue problems: Balancing of discretization and iteration error
- Adaptive inexact Newton methods with a posteriori stopping criteria for nonlinear diffusion PDEs
- Adaptive multilevel methods with local smoothing for \(H^1\)- and \(H^{\text{curl}}\)-conforming high order finite element methods
- An adaptive \(hp\)-refinement strategy with inexact solvers and computable guaranteed bound on the error reduction factor
- An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity
- An adaptive finite element method with asymptotic saturation for eigenvalue problems
- An adaptive homotopy approach for non-selfadjoint eigenvalue problems
- An optimal control approach to a posteriori error estimation in finite element methods
- An oscillation-free adaptive FEM for symmetric eigenvalue problems
- Benchmark results for testing adaptive finite element eigenvalue procedures
- Computation of eigenvalues by numerical upscaling
- Computed eigenmodes of planar regions
- Convergence and optimal complexity of adaptive finite element eigenvalue computations
- Convergence and quasi-optimality of adaptive FEM for Steklov eigenvalue problems
- CONVERGENCE OF ADAPTIVE FINITE ELEMENT METHODS FOR EIGENVALUE PROBLEMS
- Estimating and localizing the algebraic and total numerical errors using flux reconstructions
- Flux reconstructions in the Lehmann-Goerisch method for lower bounds on eigenvalues
- Geometrical structure of Laplacian eigenfunctions
- Goal-oriented a posteriori error estimation for conforming and nonconforming approximations with inexact solvers
- Goal-oriented error control of the iterative solution of finite element equations
- Guaranteed lower bounds for eigenvalues
- scientific article; zbMATH DE number 996050 (Why is no real title available?)
- scientific article; zbMATH DE number 1008371 (Why is no real title available?)
- scientific article; zbMATH DE number 2206696 (Why is no real title available?)
- Interplay between discretization and algebraic computation in adaptive numerical solution of elliptic PDE problems
- Matrix iterative analysis
- Methods of conjugate gradients for solving linear systems
- Nonlinear eigenvalue and frequency response problems in industrial practice
- On a residual-based \textit{a posteriori} error estimator for the total error
- On estimators for eigenvalue/eigenvector approximations
- Optimality of a standard adaptive finite element method
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Robust error estimates for approximations of non-self-adjoint eigenvalue problems
- Some remarks on the history and future of averaging techniques in a posteriori finite element error analysis
- Stopping criteria for adaptive finite element solvers
- Subspace gap residuals for Rayleigh-Ritz approximations
- The \textsc{deal.II} finite element library: design, features, and insights
- The deal.II library, version 9.2
- The finite element methods for elliptic problems.
- Three methods for two-sided bounds of eigenvalues. A comparison
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Understanding and implementing the finite element method.
Cited in
(9)- Smoothing techniques and computation of invariant subspaces of elliptic operators
- Adaptive inexact smoothing Newton method for a nonconforming discretization of a variational inequality
- Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Residual Smoothing for Accelerating the ADI Iteration Method for Elliptic Difference Equations
- Spectral discretization errors in filtered subspace iteration
- Robust Eigenvalue Computation for Smoothing Operators
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- A novel augmented subspace adaptive finite element method for the eigenvalue problem with discontinuous coefficients
This page was built for publication: Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052458)
