The block Hessenberg process for matrix equations
From MaRDI portal
Publication:1744302
zbMath1392.65041MaRDI QIDQ1744302
Mohammed Heyouni, Mohamed Addam, Hassane Sadok
Publication date: 23 April 2018
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol46/abstract.php?vol=46&pages=460-473
Related Items
Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ An alternative extended block Arnoldi method for solving low-rank Sylvester equations ⋮ On Hessenberg type methods for low-rank Lyapunov matrix equations ⋮ On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations ⋮ The simpler block CMRH method for linear systems ⋮ Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new look at CMRH and its relation to GMRES
- CMRH method as iterative solver for boundary element acoustic systems
- Extended Arnoldi methods for large low-rank Sylvester matrix equations
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
- Algebraic properties of the block GMRES and block Arnoldi methods
- The block conjugate gradient algorithm and related methods
- Preconditioned CG methods for sparse matrices on massively parallel machines
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Global FOM and GMRES algorithms for matrix equations
- A parallel implementation of the CMRH method for dense linear systems
- Dynamic block GMRES: An iterative method for block linear systems
- A new implementation of the CMRH method for solving dense linear systems
- Low rank approximate solutions to large Sylvester matrix equations
- Convergence properties of block GMRES and matrix polynomials
- Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- Block Krylov subspace methods for solving large Sylvester equations
- Algorithms for the CMRH method for dense linear systems
This page was built for publication: The block Hessenberg process for matrix equations