The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
DOI10.1016/S0898-1221(97)00074-6zbMath0889.65034OpenAlexW2147129570MaRDI QIDQ1368482
Chern-Shuh Wang, Wen-Wei Lin, William R. Ferng
Publication date: 2 June 1998
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00074-6
convergencenumerical exampleeigenvaluessymplectic basislarge and sparse Hamiltonian matrixlarge sparse algebraic Riccati equationsshift invert Lanczos algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Cites Work
- Unnamed Item
- On Hamiltonian and symplectic Hessenberg forms
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- On some algebraic problems in connection with general eigenvalue algorithms
- Eigenvalues of perturbed Hermitian matrices
- A Schur method for solving algebraic Riccati equations
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- A Convergence Analysis for Nonsymmetric Lanczos Algorithms
- A Chart of Numerical Methods for Structured Eigenvalue Problems
- Computation of Stable Invariant Subspaces of Hamiltonian Matrices
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
This page was built for publication: The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations