A multishift algorithm for the numerical solution of algebraic Riccati equations
From MaRDI portal
Recommendations
Cited in
(12)- The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- A new method for computing the stable invariant subspace of a real Hamiltonian matrix
- Numerical methods in control
- The transmission of shifts and shift blurring in the QR algorithm
- On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
- Passivity preserving model reduction via interpolation of spectral zeros
- Numerical solution of large-scale Lyapunov equations, Riccati equations, and linear-quadratic optimal control problems.
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- A Multilevel Technique for the Approximate Solution of Operator Lyapunov and Algebraic Riccati Equations
- Using \(LDL^\mathrm{T}\) factorizations in Newton's method for solving general large-scale algebraic Riccati equations
- A numerical method for computing the Hamiltonian Schur form
This page was built for publication: A multishift algorithm for the numerical solution of algebraic Riccati equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344400)