Extended Arnoldi methods for large low-rank Sylvester matrix equations

DOI10.1016/j.apnum.2010.07.005zbMath1210.65093OpenAlexW2041118838MaRDI QIDQ607132

Mohammed Heyouni

Publication date: 19 November 2010

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2010.07.005

zbMATH Keywords

numerical examplesiterative methodsprojection methodsextended Krylov subspacesextended Arnoldi processlarge low-rank Sylvester matrix equationslow rank solution

Mathematics Subject Classification ID

Related Items (30)

On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations ⋮ Concepts and techniques of optimization on the sphere ⋮ The extended block Arnoldi method for solving generalized differential Sylvester equations ⋮ Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach ⋮ Low-rank updates and divide-and-conquer methods for quadratic matrix equations ⋮ Extended Krylov subspace methods for solving Sylvester and Stein tensor equations ⋮ New results of the IO iteration algorithm for solving Sylvester matrix equation ⋮ A novel predefined-time noise-tolerant zeroing neural network for solving time-varying generalized linear matrix equations ⋮ 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 ⋮ On global Hessenberg based methods for solving Sylvester matrix equations ⋮ Projections onto convex sets on the sphere ⋮ On Hessenberg type methods for low-rank Lyapunov matrix equations ⋮ The extended global Lanczos method for matrix function approximation ⋮ Krylov subspace methods for projected Lyapunov equations ⋮ Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations ⋮ The block Hessenberg process for matrix equations ⋮ Unnamed Item ⋮ A note on the Davison-Man method for Sylvester matrix equations ⋮ On some properties of the extended block and global Arnoldi methods with applications to model reduction ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ On some Krylov subspace based methods for large-scale nonsymmetric algebraic Riccati problems ⋮ Extended Krylov subspace for parameter dependent systems ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\) ⋮ Numerical methods for differential linear matrix equations via Krylov subspace methods ⋮ Global extended Krylov subspace methods for large-scale differential Sylvester matrix equations ⋮ Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ Extended nonsymmetric global Lanczos method for matrix function approximation

Uses Software

• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extended block Arnoldi algorithm for large-scale solutions of the continuous-time algebraic Riccati equation
• Matrix Krylov subspace methods for large scale model reduction problems
• Krylov-subspace methods for the Sylvester equation
• Solving stable generalized Lyapunov equations with the matrix sign function
• Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
• Projection methods for large Lyapunov matrix equations
• Low rank approximate solutions to large Sylvester matrix equations
• Convergence properties of some block Krylov subspace methods for multiple linear systems
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• A Hessenberg-Schur method for the problem AX + XB= C
• The numerical solution of the matrix equationXA+AY=F
• Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• 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

This page was built for publication: Extended Arnoldi methods for large low-rank Sylvester matrix equations