Computing real low-rank solutions of Sylvester equations by the factored ADI method
From MaRDI portal
Publication:2397185
DOI10.1016/j.camwa.2014.03.004zbMath1364.65093OpenAlexW2075097820WikidataQ115224012 ScholiaQ115224012MaRDI QIDQ2397185
Peter Benner, Patrick Kürschner
Publication date: 30 May 2017
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2014.03.004
Related Items
Low-rank Newton-ADI methods for large nonsymmetric algebraic Riccati equations ⋮ Low-Rank Eigenvector Compression of Posterior Covariance Matrices for Linear Gaussian Inverse Problems ⋮ ADI iteration for Lyapunov equations: A tangential approach and adaptive shift selection ⋮ Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data ⋮ On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations ⋮ Numerical solution of singular Sylvester equations ⋮ Rational Krylov and ADI iteration for infinite size quasi-Toeplitz matrix equations ⋮ A low-rank approach to the solution of weak constraint variational data assimilation problems ⋮ Inexact methods for the low rank solution to large scale Lyapunov equations ⋮ Fast tensor product solvers for optimization problems with fractional differential equations as constraints ⋮ A note on the Davison-Man method for Sylvester matrix equations ⋮ Frequency-Limited Balanced Truncation with Low-Rank Approximations ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\) ⋮ Numerical computation and new output bounds for time-limited balanced truncation of discrete-time systems ⋮ Matrix equation techniques for certain evolutionary partial differential equations ⋮ Cross-Gramian-based dominant subspaces ⋮ Matrix Equations, Sparse Solvers: M-M.E.S.S.-2.0.1—Philosophy, Features, and Application for (Parametric) Model Order Reduction ⋮ Frequency-weighted ℋ2-optimal model order reduction via oblique projection
Uses Software
Cites Work
- Unnamed Item
- A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations
- On the numerical solution of large-scale sparse discrete-time Riccati equations
- A new projection method for solving large Sylvester equations
- On the ADI method for Sylvester equations
- Inertia characteristics of self-adjoint matrix polynomials
- Iterative solution of the Lyapunov matrix equation
- Krylov-subspace methods for the Sylvester equation
- The Sylvester equation and approximate balanced reduction
- Direct methods for matrix Sylvester and Lyapunov equations
- On the ADI method for the Sylvester equation and the optimal-\({\mathcal H}_{2}\) points
- Efficient handling of complex shift parameters in the low-rank Cholesky factor ADI method
- Krylov subspace methods for the generalized Sylvester equation
- Large-scale Stein and Lyapunov equations, Smith method, and applications
- On optimality of approximate low rank solutions of large-scale matrix equations
- Low rank approximate solutions to large Sylvester matrix equations
- Solving stable Sylvester equations via rational iterative schemes
- Solving Complex-Valued Linear Systems via Equivalent Real Formulations
- An improved numerical method for balanced truncation for symmetric second-order systems
- Inexact Kleinman–Newton Method for Riccati Equations
- Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems
- A Hessenberg-Schur method for the problem AX + XB= C
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Low Rank Solution of Lyapunov Equations
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Block Krylov subspace methods for solving large Sylvester equations
