An Efficient Block Rational Krylov Solver for Sylvester Equations with Adaptive Pole Selection
From MaRDI portal
Publication:6195012
DOI10.1137/23m1548463arXiv2301.08103OpenAlexW4392517295MaRDI QIDQ6195012
Angelo A. Casulli, Leonardo Robol
Publication date: 12 March 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.08103
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix-equation-based strategies for convection-diffusion equations
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- Hermitian quadratic matrix polynomials: solvents and inverse problems
- The automatic solution of partial differential equations using a global spectral method
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- Ritz and pseudo-Ritz values using matrix polynomials
- Convergence properties of block GMRES and matrix polynomials
- A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems
- A literature survey of low-rank tensor approximation techniques
- On Adaptive Choice of Shifts in Rational Krylov Subspace Reduction of Evolutionary Problems
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- An Error Analysis for Rational Galerkin Projection Applied to the Sylvester Equation
- Computational Methods for Linear Matrix Equations
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- On the Singular Values of Matrices with Displacement Structure
- Computation of generalized matrix functions with rational Krylov methods
- The Short-Term Rational Lanczos Method and Applications
- The Block Rational Arnoldi Method
- Numerical Methods for Structured Markov Chains
- Explicit Solutions of Linear Matrix Equations
- Approximation of Large-Scale Dynamical Systems
