Preconditioning eigenvalues and some comparison of solvers (Q1591177): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JDQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EISPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JDQZ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: eigs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IRAM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Davidson Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Forcing Terms in an Inexact Newton Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davidson's method and preconditioning for generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic projection methods for large non-symmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative eigenvalue algorithms based on convergent splittings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of conjugate gradients used in inverse iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the convergence behavior of conjugate-gradients and Ritz values / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix eigensystem routines - EISPACK guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Truncated RQ Iteration for Large Scale Eigenvalue Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust preconditioning of large, sparse, symmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria for Combining Inverse and Rayleigh Quotient Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems / rank
 
Normal rank

Latest revision as of 10:57, 3 June 2024

scientific article
Language Label Description Also known as
English
Preconditioning eigenvalues and some comparison of solvers
scientific article

    Statements

    Preconditioning eigenvalues and some comparison of solvers (English)
    0 references
    0 references
    10 February 2002
    0 references
    This is nice summary of preconditioning techniques for eigenvalue problems \(Ax=\lambda x\), including Davidson, Jacobs-Davidson, Rayleigh quotient iteration and preconditioned Lanczos methods. It is shown that these preconditioning methods are related by the same preconditioned operator \(M^{-1}(A-\theta I)\). Here \(\theta\) is an approximate eigenvalue and \(M\) is an approximation of \(A-\theta I\). Hence, the convergence rates of preconditioning methods are often similar. However, proper implementation can make a difference. This is, in addition to the comparisons of these methods, illustrated by numerical examples.
    0 references
    0 references
    eigenvalue problems
    0 references
    preconditioning
    0 references
    Davidson methods
    0 references
    Rayleigh quotient iteration
    0 references
    convergence
    0 references
    comparisons
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers