A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
From MaRDI portal
Publication:2408146
DOI10.1007/s11075-016-0239-zzbMath1378.65088OpenAlexW2549613210MaRDI QIDQ2408146
Publication date: 10 October 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0239-z
Laurent polynomialsbilinear formsnumerical experimentextended Krylov subspacestwo-sided methodrational moment matchingshort recurrence methods
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the generalized AOR and CG iteration methods for a class of block two-by-two linear systems ⋮ Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix ⋮ Biorthogonal rational Krylov subspace methods ⋮ Extended nonsymmetric global Lanczos method for matrix function approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices
- Recursion relations for the extended Krylov subspace method
- Rational Krylov sequence methods for eigenvalue computation
- Extended Krylov subspace for parameter dependent systems
- Quadrature rule-based bounds for functions of adjacency matrices
- The extended Krylov subspace method and orthogonal Laurent polynomials
- Model reduction using the Vorobyev moment problem
- Bounds for matrix moments
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- RD-rational approximations of the matrix exponential
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- The university of Florida sparse matrix collection
- Network Properties Revealed through Matrix Functions
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Estimation of uTƒ(A)v for large‐scale unsymmetric matrices
- Acceleration Techniques for Approximating the Matrix Exponential Operator
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- A Spectral Time-Domain Method for Computational Electrodynamics
- Numerical Methods for Electronic Structure Calculations of Materials
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The structure of matrices in rational Gauss quadrature
- Preconditioning Lanczos Approximations to the Matrix Exponential
This page was built for publication: A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching