Krylov-subspace methods for the Sylvester equation

DOI10.1016/0024-3795(92)90031-5zbMath0777.65028OpenAlexW2033029203MaRDI QIDQ1194527

S. Singh

Publication date: 27 September 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90031-5

zbMATH Keywords

Krylov subspace methodparallel computersSylvester matrix equationArnoldi processGalerlin methodminimal residual algorithms

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Parallel numerical computation (65Y05)

Related Items

A generalized ADI iterative method, Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning, Perturbation theory and backward error for \(AX - XB = C\), Krylov subspace methods for the generalized Sylvester equation, A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications, A model reduction method in large scale dynamical systems using an extended-rational block Arnoldi method, Efficient low-rank solution of generalized Lyapunov equations, On positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equation \(AX+XB=C\), Shift-Splitting Iteration Method and Its Variants for Solving Continuous Sylvester Equations, A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations, A Computational Method for Symmetric Stein Matrix Equations, Computational Methods for Linear Matrix Equations, Model order reduction for linear and nonlinear systems: a system-theoretic perspective, Preconditioned Galerkin and minimal residual methods for solving Sylvester equations, A projection method and Kronecker product preconditioner for solving Sylvester tensor equations, Computing real low-rank solutions of Sylvester equations by the factored ADI method, Numerical solution of the Lyapunov equation by approximate power iteration, On the solution of large Sylvester‐observer equations, On modified HSS iteration methods for continuous Sylvester equations, Iterative methods for \(X-AXB=C\), A new version of successive approximations method for solving Sylvester matrix equations, Control design for large-scale Lur'e systems with arbitrary information structure constraints, Extended Arnoldi methods for large low-rank Sylvester matrix equations, Arnoldi-Riccati method for large eigenvalue problems, A new projection method for solving large Sylvester equations, On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations, On the squared Smith method for large-scale Stein equations, On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equations, Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning, A novel predefined-time noise-tolerant zeroing neural network for solving time-varying generalized linear matrix equations, Clustered model reduction of positive directed networks, A Hessenberg method for the numerical solutions to types of block Sylvester matrix equations, Unnamed Item, Solving time-fractional reaction-diffusion systems through a tensor-based parallel algorithm, A posteriori error bounds for discrete balanced truncation, A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line, The constant solution method for solving large-scale differential Sylvester matrix equations with time invariant coefficients, An improved gradient neural network for solving periodic Sylvester matrix equations, An alternative extended block Arnoldi method for solving low-rank Sylvester equations, Small-sample statistical condition estimation of large-scale generalized eigenvalue problems, A NEW VERSION OF THE SMITH METHOD FOR SOLVING SYLVESTER EQUATION AND DISCRETE-TIME SYLVESTER EQUATION, Preconditioned Positive-Definite and Skew-Hermitian Splitting Iteration Methods for Continuous Sylvester Equations AX + XB = C, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, Krylov subspace methods for projected Lyapunov equations, Systems of coupled generalized Sylvester matrix equations, A gradient based iterative solutions for Sylvester tensor equations, A generalization of the Hermitian and skew-Hermitian splitting iteration method for solving Sylvester equations, Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations, A preconditioned block Arnoldi method for large Sylvester matrix equations, Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations, An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations, Numerical solutions to large-scale differential Lyapunov matrix equations, A note on the Davison-Man method for Sylvester matrix equations, An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems, ADI preconditioned Krylov methods for large Lyapunov matrix equations, On model reduction of K-power bilinear systems, Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations, Convex constrained optimization for large-scale generalized Sylvester equations, A preconditioned iteration method for solving Sylvester equations, Stabilisation of large-scale nonlinear systems by modifying the interconnection network, An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices, New SOR-like methods for solving the Sylvester equation, An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices, A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants, An implicit preconditioning strategy for large-scale generalized Sylvester equations, A note on the iterative solutions of general coupled matrix equation, Extended Krylov subspace for parameter dependent systems, Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems, Low rank solution of data‐sparse Sylvester equations, Approximate implicit subspace iteration with alternating directions for LTI system model reduction, Algorithms for model reduction of large dynamical systems, Projection methods for large Lyapunov matrix equations, Low rank approximate solutions to large Sylvester matrix equations, Global quasi-minimal residual method for the Sylvester equations, Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations, Solving stable Sylvester equations via rational iterative schemes, On short recurrence Krylov type methods for linear systems with many right-hand sides, A computational framework of gradient flows for general linear matrix equations, Krylov space methods on state-space control models, Projection methods for large-scale T-Sylvester equations, Extension of the Barzilai–Borwein Method for Quadratic Forms in Finite Euclidean Spaces, Partitioned Krylov subspace iteration in implicit Runge-Kutta methods, On the ADI method for Sylvester equations, Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case, Solution of underdetermined Sylvester equations in sensor array signal processing, On the numerical solution of \(AX-XB=C\), Dynamic graphs and continuous Boolean networks. II: Large-scale organic structures, Approximate inverse preconditioner by computing approximate solution of Sylvester equation, The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action, Classification and approximation of solutions to Sylvester matrix equation, Solvability conditions for mixed sylvester equations in rings, Computing tall skinny solutions of \(AX-XB=C\), On preconditioned normal and skew-Hermitian splitting iteration method for continuous Sylvester equations AX + XB = C*, The Sylvester equation and approximate balanced reduction

Uses Software

• Algorithm 432

Cites Work

• Iterative solution of the Lyapunov matrix equation
• Controllability, observability and the solution of AX-XB=C
• SOR for \(AX-XB=C\)
• Adaptive Lanczos methods for recursive condition estimation
• Nonsingular solutions of TA-BT=C
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• Krylov Subspace Methods on Supercomputers
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Alternating Direction Implicit Methods
• A Hessenberg-Schur method for the problem AX + XB= C
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Alternating Direction Implicit Iteration for Systems with Complex Spectra
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• A Newton basis GMRES implementation
• A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item