A subspace preconditioning algorithm for eigenvector/eigenvalue computation
From MaRDI portal
Publication:675699
DOI10.1007/BF02127702zbMATH Open0879.65024OpenAlexW2106311058WikidataQ59695885 ScholiaQ59695885MaRDI QIDQ675699FDOQ675699
Authors: James H. Bramble, Joseph E. Pasciak, Andrew Knyazev 
Publication date: 11 December 1997
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02127702
Recommendations
convergenceeigenvectorspreconditioningnumerical exampleparallel computationRayleigh-Ritz methodsubspace iterationfinite-dimensional real Hilbert spacesmallest eigenvaluessymmetric positive definite linear operator
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- Numerical methods for large eigenvalue problems
- Parallel Multilevel Preconditioners
- The Construction of Preconditioners for Elliptic Problems by Substructuring. II
- New Convergence Estimates for Multigrid Algorithms
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Title not available (Why is that?)
- A generalized conjugate gradient, least square method
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- On an iterative method for finding lovver eigenvalues
- New Estimates for Multilevel Algorithms Including the V-Cycle
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- Title not available (Why is that?)
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- The Construction of Preconditioners for Elliptic Problems by Substructuring, III
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- Minimization of the computational labor in determining the first eigenvalues of differential operators
- On the convergence of the modified method of steepest descent in the calculation of eigenvalues
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- New estimates for Ritz vectors
- Iteration methods in eigenvalue problems
- Group iterative method for finding low-order eigenvalues
- Iterative eigenvalue algorithms based on convergent splittings
- Simultaneous iteration for the matrix eigenvalue problem
- Title not available (Why is that?)
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
- Hybrid V-Cycle Algebraic Multilevel Preconditioners
- Title not available (Why is that?)
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- The site of termination of afferent fibres in the caudate nucleus
- Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
- Davidson's method and preconditioning for generalized eigenvalue problems
Cited In (33)
- New schemes with fractal error compensation for PDE eigenvalue computations
- Rayleigh-Ritz majorization error bounds of mixed type
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
- A spectral analysis of subspace enhanced preconditioners
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Adaptive eigenvalue computation: Complexity estimates
- An efficient method for band structure calculations in 2D photonic crystals
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
- A parallel augmented subspace method for eigenvalue problems
- Eigenvalue perturbation and generalized Krylov subspace method
- An efficient method for band structure calculations in 3D photonic crystals
- Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials
- New estimates for Ritz vectors
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- A geometric theory for preconditioned inverse iteration applied to a subspace
- On proximity of Rayleigh quotients for different vectors and Ritz values generated by different trial subspaces
- A Two-Level Preconditioned Helmholtz Subspace Iterative Method for Maxwell Eigenvalue Problems
- Enhanced error estimates for augmented subspace method
- The method of subspace corrections
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
- Computer algorithms for calculating efficient initial vectors for subspace iteration method
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Localization and Delocalization of Ground States of Bose--Einstein Condensates Under Disorder
- Cluster robust estimates for block gradient-type eigensolvers
This page was built for publication: A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675699)
