Block Krylov subspace methods for functions of matrices. II: Modified block FOM
From MaRDI portal
Publication:5113367
Recommendations
- Block Krylov subspace methods for functions of matrices
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- On short recurrence Krylov type methods for linear systems with many right-hand sides
- The block grade of a block Krylov space
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
Cites work
- scientific article; zbMATH DE number 3565290 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3236302 (Why is no real title available?)
- A block GMRES method with deflated restarting for solving linear systems with multiple shifts and multiple right-hand sides.
- A flexible Krylov solver for shifted systems with application to oscillatory hydraulic tomography
- A new family of global methods for linear systems with multiple right-hand sides
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- Algebraic properties of the block GMRES and block Arnoldi methods
- Algorithms for Solvents of Matrix Polynomials
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Block Krylov subspace methods for functions of matrices
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- Computing the action of the matrix exponential, with an application to exponential integrators
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Convergence properties of block GMRES and matrix polynomials
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Exponential integrators
- Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems
- Functions of Matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Global FOM and GMRES algorithms for matrix equations
- Krylov subspace methods. Principles and analysis.
- Low-rank updates of matrix functions
- Matrices, moments and quadrature with applications
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Matrix Polynomials
- Multipreconditioned GMRES for shifted systems
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- On short recurrence Krylov type methods for linear systems with many right-hand sides
- On some properties of the extended block and global Arnoldi methods with applications to model reduction
- On the global Krylov subspace methods for solving general coupled matrix equations
- Restarted GMRES for Shifted Linear Systems
- Ritz and pseudo-Ritz values using matrix polynomials
- Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential
- Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
- The Algebraic Theory of Matrix Polynomials
- The Radau-Lanczos method for matrix functions
- The University of Florida sparse matrix collection
- The block conjugate gradient algorithm and related methods
- Two polynomial methods of calculating functions of symmetric matrices
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
Cited in
(16)- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
- A priori error bounds on invariant subspace approximations by block Krylov subspaces
- Low-rank-modified Galerkin methods for the Lyapunov equation
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- New matrix function approximations and quadrature rules based on the Arnoldi process
- A posteriori superlinear convergence bounds for block conjugate gradient
- Limited‐memory polynomial methods for large‐scale matrix functions
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- Block Krylov subspace methods for functions of matrices
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- Faster randomized partial trace estimation
- A posteriori error bounds for the block-Lanczos method for matrix function approximation
- Krylov subspace recycling with randomized sketching for matrix functions
- GMRES algorithms over 35 years
- Block Gram-Schmidt algorithms and their stability properties
- The block grade of a block Krylov space
This page was built for publication: Block Krylov subspace methods for functions of matrices. II: Modified block FOM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113367)
