Additive preconditioning, eigenspaces, and the inverse iteration

DOI10.1016/j.laa.2008.07.006zbMath1159.65043OpenAlexW2059067170MaRDI QIDQ958010

Xiaodong Yan, Pan, Victor Y.

Publication date: 2 December 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.07.006

zbMATH Keywords

global convergencenumerical examplesquadratic convergenceconditioningill-conditioningArnoldi iterationadditive preconditioninginverse power iterationJacobi-Davidson algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Additive preconditioning for matrix computations, New studies of randomized augmentation and additive preprocessing, Solving large-scale finite element nonlinear eigenvalue problems by resolvent sampling based Rayleigh-Ritz method, Matrix computations and polynomial root-finding with preprocessing, Additive preconditioning and aggregation in matrix computations, Solving linear systems of equations with randomization, augmentation and aggregation, Eigen-solving via reduction to DPR1 matrices, Randomized preprocessing of homogeneous linear systems of equations, New progress in real and complex polynomial root-finding, A new error-free floating-point summation algorithm

Uses Software

• JDQR
• mctoolbox
• JDQZ
• Eigensolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A probabilistic remark on algebraic program testing
• Polynomial zerofinding iterative matrix algorithms
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Improved initialization of the accelerated and robust QR-like polynomial root-finding
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Preconditioning techniques for large linear systems: A survey
• A composite polynomial zerofinding matrix algorithm
• Schur aggregation for linear systems and determinants
• The amended DSeSC power method for polynomial root-finding
• Additive preconditioning and aggregation in matrix computations
• Global convergence of tridiagonal QR algorithm with origin shifts
• Note on matrices with a very ill-conditioned eigenproblem
• Additive Preconditioning for Matrix Computations
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
• Solving a Polynomial Equation: Some History and Recent Progress
• Templates for the Solution of Algebraic Eigenvalue Problems
• Matrix Preconditioning Techniques and Applications
• Accuracy and Stability of Numerical Algorithms
• Iterative Krylov Methods for Large Linear Systems
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
• Two Purposes for Matrix Factorization: A Historical Appraisal
• Some Modified Matrix Eigenvalue Problems