A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (Q413531): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2011.07.020 / rank
Normal rank
 
Property / review text
 
The authors analyze a method for computing eigenvalues of a large sparse generalized eigenvalue problem \(Ax=\lambda Bx\), closest to the imaginary axis. Their method is based on inverse subspace iteration on the Lyapunov problem. They also show the link between inverse subspace iteration and implicitly restarted Arnoldi process through the extra projection step which corresponds to the decrease of the Krylov subspace dimension by executing \(QR\)-steps.
Property / review text: The authors analyze a method for computing eigenvalues of a large sparse generalized eigenvalue problem \(Ax=\lambda Bx\), closest to the imaginary axis. Their method is based on inverse subspace iteration on the Lyapunov problem. They also show the link between inverse subspace iteration and implicitly restarted Arnoldi process through the extra projection step which corresponds to the decrease of the Krylov subspace dimension by executing \(QR\)-steps. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Constantin Popa / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6031160 / rank
 
Normal rank
Property / zbMATH Keywords
 
Lyapunov eigenvalue problem
Property / zbMATH Keywords: Lyapunov eigenvalue problem / rank
 
Normal rank
Property / zbMATH Keywords
 
Kronecker eigenvalue problem
Property / zbMATH Keywords: Kronecker eigenvalue problem / rank
 
Normal rank
Property / zbMATH Keywords
 
eigenvalues closest to the imaginary axis
Property / zbMATH Keywords: eigenvalues closest to the imaginary axis / rank
 
Normal rank
Property / zbMATH Keywords
 
implicitly restarted Arnoldi method
Property / zbMATH Keywords: implicitly restarted Arnoldi method / rank
 
Normal rank
Property / zbMATH Keywords
 
large sparse generalized eigenvalue problem
Property / zbMATH Keywords: large sparse generalized eigenvalue problem / rank
 
Normal rank
Property / zbMATH Keywords
 
inverse subspace iteration
Property / zbMATH Keywords: inverse subspace iteration / rank
 
Normal rank
Property / zbMATH Keywords
 
Krylov subspace
Property / zbMATH Keywords: Krylov subspace / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 432 / 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: ARPACK / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.07.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021088067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems / 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: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Restarted Krylov Subspaces to Invariant Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicitly restarted Arnoldi with purification for the shift-invert transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicitly Restarted Arnoldi Methods and Subspace Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an Eigenvector with Inverse Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Bifurcations of Dynamical Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov Subspace Methods for Solving Large Lyapunov Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov-subspace methods for the Sylvester equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of the Lyapunov equation by approximate power iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of large sparse Lyapunov equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate implicit subspace iteration with alternating directions for LTI system model reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Equation $XA + BX = C$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5701653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Krylov subspace for parameter dependent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decay rate of Hankel singular values and related issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for large eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which Eigenvalues Are Found by the Lanczos Method? / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Implement the Spectral Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bifurcation with Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buoyancy Effects in Fluids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2011.07.020 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:49, 9 December 2024

scientific article
Language Label Description Also known as
English
A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
scientific article

    Statements

    A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (English)
    0 references
    0 references
    0 references
    7 May 2012
    0 references
    The authors analyze a method for computing eigenvalues of a large sparse generalized eigenvalue problem \(Ax=\lambda Bx\), closest to the imaginary axis. Their method is based on inverse subspace iteration on the Lyapunov problem. They also show the link between inverse subspace iteration and implicitly restarted Arnoldi process through the extra projection step which corresponds to the decrease of the Krylov subspace dimension by executing \(QR\)-steps.
    0 references
    Lyapunov eigenvalue problem
    0 references
    Kronecker eigenvalue problem
    0 references
    eigenvalues closest to the imaginary axis
    0 references
    implicitly restarted Arnoldi method
    0 references
    large sparse generalized eigenvalue problem
    0 references
    inverse subspace iteration
    0 references
    Krylov subspace
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers