Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations

DOI10.1007/s11075-018-0597-9zbMath1420.65040arXiv1706.01176OpenAlexW2892174564WikidataQ129250709 ScholiaQ129250709MaRDI QIDQ2322827

Azita Tajaddini, Najmeh Azizi Zadeh, Gang Wu

Publication date: 5 September 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.01176

zbMATH Keywords

Krylov subspaceglobal GMRESdeflated restartingweighting strategylarge Sylvester matrix equation

Mathematics Subject Classification ID

Related Items (5)

A novel predefined-time noise-tolerant zeroing neural network for solving time-varying generalized linear matrix equations ⋮ Deflated and restarted Krylov subspace methods for Sylvester tensor equations ⋮ GMRES algorithms over 35 years ⋮ A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\) ⋮ Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES

Uses Software

• eigs
• SparseMatrix
• IRAM
• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
• Minimal residual methods for large scale Lyapunov equations
• A minimal residual norm method for large-scale Sylvester matrix equations
• Some observations on weighted GMRES
• Restarted block-GMRES with deflation of eigenvalues
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
• Two algorithms for finding the Hermitian reflexive and skew-Hermitian solutions of Sylvester matrix equations
• Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations
• A new computational GMRES method
• Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
• Extended Krylov subspace for parameter dependent systems
• On the ADI method for Sylvester equations
• Weighted FOM and GMRES for solving nonsymmetric linear systems
• A convergence analysis of GMRES and FOM methods for Sylvester equations
• Global FOM and GMRES algorithms for matrix equations
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
• Projection methods for large Lyapunov matrix equations
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
• Computational Methods for Linear Matrix Equations
• A Power–Arnoldi algorithm for computing PageRank
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• GMRES with Deflated Restarting
• Application of ADI Iterative Methods to the Restoration of Noisy Images
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Weighted Inner Products for GMRES and GMRES-DR
• The Matrix Eigenvalue Problem
• An In‐Core Finite Difference Method for Separable Boundary Value Problems on a Rectangle
• Block Krylov subspace methods for solving large Sylvester equations

This page was built for publication: Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations