Global FOM and GMRES algorithms for a class of complex matrix equations
From MaRDI portal
Publication:1743932
DOI10.1016/j.cam.2017.11.041zbMath1392.65061OpenAlexW2772982109MaRDI QIDQ1743932
Publication date: 16 April 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.11.041
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations
- On the solution of the linear matrix equation \(X = Af(X) B + C\)
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Iterative algorithms for solving a class of complex conjugate and transpose matrix equations
- Toward solution of matrix equation \(X=Af(X)B+C\)
- Finite iterative solutions to a class of complex matrix equations with conjugate and transpose of the unknowns
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
- On solutions of the matrix equations \(XF - AX = C\) and \(XF - A\bar {X} =C\)
- A new projection method for solving large Sylvester equations
- Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
- Restarted weighted full orthogonalization method for shifted linear systems
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- The MGPBiCG method for solving the generalized coupled Sylvester-conjugate matrix equations
- The Schur complement and its applications
- Eigenanalysis of some preconditioned Helmholtz problems
- Global FOM and GMRES algorithms for matrix equations
- Restarted GMRES preconditioned by deflation
- Preconditioning of complex linear systems from the Helmholtz equation
- Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
- The solution to matrix equation \(AX+X^TC=B\)
- The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations
- Matrix form of the CGS method for solving general coupled matrix equations
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- Krylov subspace methods for the generalized Sylvester equation
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- On the global Krylov subspace methods for solving general coupled matrix equations
- Low rank approximate solutions to large Sylvester matrix equations
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Iterative least-squares solutions of coupled sylvester matrix equations
- On the solution of a Sylvester equation appearing in descriptor systems control theory
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Computational Methods for Linear Matrix Equations
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- On Iterative Solutions of General Coupled Matrix Equations
- Structured Condition Numbers for Invariant Subspaces
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- The Matrix Equation $A\bar X - XB = C$ and Its Special Cases
- A Hessenberg-Schur method for the problem AX + XB= C
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- On the solution of the continuous-time Lyapunov matrix equation in two canonical forms
- Flexible Inner-Outer Krylov Subspace Methods
- Gradient based iterative algorithms for solving a class of matrix equations
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Recursive interpolation algorithm: A formalism for solving systems of linear equations. I: Direct methods
