Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3989703 (Why is no real title available?)
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Comparison of K-spectral set bounds on norms of functions of a matrix or operator
- Efficient estimation of eigenvalue counts in an interval.
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Incomplete partial fractions for parallel evaluation of rational matrix functions
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Matrices with prescribed Ritz values
- Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Randomized Gram-Schmidt process with application to GMRES
- Recent computational developments in Krylov subspace methods for linear systems
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Schwarz-Christoffel Mapping
- Spectral Sets: Numerical Range and Beyond
- The numerical range is a \((1+\sqrt{2})\)-spectral set
This page was built for publication: Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891569)
