Preconditioning eigensolvers -- an Oxymoron?
From MaRDI portal
Publication:1279553
zbMath1053.65513MaRDI QIDQ1279553
Publication date: 8 February 1999
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124086
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items
Convergence theory for preconditioned eigenvalue solvers in a nutshell, A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases, Cluster robustness of preconditioned gradient subspace iteration eigensolvers, Preconditioned iterative methods for a class of nonlinear eigenvalue problems, A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator, Convergence Analysis of Restarted Krylov Subspace Eigensolvers, Spectral Element Methods for Eigenvalue Problems Based on Domain Decomposition, The approximation of the Maxwell eigenvalue problem using a least-squares method, Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices, A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems, The use of bulk states to accelerate the band edge state calculation of a semiconductor quantum dot, ELSI -- an open infrastructure for electronic structure solvers, Enhanced error estimates for augmented subspace method, Block subspace projection preconditioned conjugate gradient method in modal structural analysis, Overlapping Schwarz preconditioned eigensolvers for spectral element discretizations, Convergence behaviour of inverse differential quadrature method for analysis of beam and plate structures, A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems, A Two-Level Overlapping Hybrid Domain Decomposition Method for Eigenvalue Problems, Inverse differential quadrature solutions for free vibration of arbitrary shaped laminated plate structures, Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials, On the convergence of a two-level preconditioned Jacobi–Davidson method for eigenvalue problems, A Parallel Augmented Subspace Method for Eigenvalue Problems, State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems, The preconditioned inverse iteration for hierarchical matrices, Sharp Ritz value estimates for restarted Krylov subspace iterations, Direct extension of the density-matrix renormalization group method toward two-dimensional large quantum lattices and related high-performance computing, A geometric theory for preconditioned inverse iteration applied to a subspace, An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems, Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues, Inexact inverse iteration for symmetric matrices, Deflation by restriction for the inverse-free preconditioned Krylov subspace method, On preconditioned eigensolvers and invert-Lanczos processes, Preconditioned gradient iterations for the eigenproblem of definite matrix pairs, Multigrid deflation for lattice QCD, Fast Eigenpairs Computation with Operator Adapted Wavelets and Hierarchical Subspace Correction, Eigenvalue computation in the 20th century, 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, Preconditioning techniques for large linear systems: A survey, A Block Arnoldi Method for the SPN Equations
