Low rank approximate solutions to large Sylvester matrix equations
From MaRDI portal
Publication:2496373
DOI10.1016/j.amc.2005.11.014zbMath1095.65041MaRDI QIDQ2496373
Publication date: 12 July 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.014
numerical experiments; low-rank approximations; Arnoldi-based method; large and sparse Sylvester matrix equations
Related Items
The Unified Frame of Alternating Direction Method of Multipliers for Three Classes of Matrix Equations Arising in Control Theory, On the NPHSS-KPIK iteration method for low-rank complex Sylvester equations arising from time-periodic fractional diffusion equations, On preconditioned normal and skew-Hermitian splitting iteration method for continuous Sylvester equations AX + XB = C*, Homotopy for Rational Riccati Equations Arising in Stochastic Optimal Control, Preconditioned Positive-Definite and Skew-Hermitian Splitting Iteration Methods for Continuous Sylvester Equations AX + XB = C, A preconditioned block Arnoldi method for large Sylvester matrix equations, The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices, Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control, KRYLOV SUBSPACE METHODS OF HESSENBERG BASED FOR ALGEBRAIC RICCATI EQUATION, A data-driven Krylov model order reduction for large-scale dynamical systems, Low-rank Newton-ADI methods for large nonsymmetric algebraic Riccati equations, On positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equation \(AX+XB=C\), On the solution of the fuzzy Sylvester matrix equation, Large-scale discrete-time algebraic Riccati equations -- doubling algorithm and error analysis, A note on the Davison-Man method for Sylvester matrix equations, Convex constrained optimization for large-scale generalized Sylvester equations, An implicit preconditioning strategy for large-scale generalized Sylvester equations, Extended Arnoldi methods for large low-rank Sylvester matrix equations, Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side, ADI preconditioned Krylov methods for large Lyapunov matrix equations, On the ADI method for Sylvester equations, Balanced truncation-rational Krylov methods for model reduction in large scale dynamical systems, Global FOM and GMRES algorithms for a class of complex matrix equations, The block Hessenberg process for matrix equations, Numerical solutions to large-scale differential Lyapunov matrix equations, New integer-order approximations of discrete-time non-commensurate fractional-order systems using the cross Gramian, On some Krylov subspace based methods for large-scale nonsymmetric algebraic Riccati problems, Restarted global FOM and GMRES algorithms for the Stein-like matrix equation \(X + \mathcal{M}(X) = C\), A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\), On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems, A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations, Global extended Krylov subspace methods for large-scale differential Sylvester matrix equations, A model reduction method in large scale dynamical systems using an extended-rational block Arnoldi method, An extended-rational Arnoldi method for large matrix exponential evaluations, An alternative extended block Arnoldi method for solving low-rank Sylvester equations, On global Hessenberg based methods for solving Sylvester matrix equations, On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations, A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications, Large-scale Stein and Lyapunov equations, Smith method, and applications, Computing real low-rank solutions of Sylvester equations by the factored ADI method, A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\), Low-rank approximation to the solution of a nonsymmetric algebraic Riccati equation from transport theory, On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations, On the generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations, Computational Methods for Linear Matrix Equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inertia characteristics of self-adjoint matrix polynomials
- Controllability, observability and the solution of AX-XB=C
- Krylov-subspace methods for the Sylvester equation
- The Sylvester equation and approximate balanced reduction
- Global FOM and GMRES algorithms for matrix equations
- On the numerical solution of \(AX-XB=C\)
- The optimal projection equations for fixed-order dynamic compensation
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- 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
- A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- On the structure of balanced and other principal representations of SISO systems
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Block Krylov subspace methods for solving large Sylvester equations
