The extended Krylov subspace method and orthogonal Laurent polynomials
From MaRDI portal
Publication:1025864
DOI10.1016/J.LAA.2009.03.006zbMATH Open1166.65019OpenAlexW1968044527MaRDI QIDQ1025864FDOQ1025864
Publication date: 23 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.006
numerical examplesalgorithmKrylov subspace methodmatrix functionLaurent polynomialsrational Krylov methodlarge sparse matrixextended Lanczos processstructured symmetric matrix
Computational methods for sparse matrices (65F50) Matrices over function rings in one or more variables (15A54)
Cites Work
- Title not available (Why is that?)
- Functions of Matrices
- Parallel iterative methods for sparse linear systems
- Orthogonal Laurent polynomials and strong moment theory: A survey
- Superfast Solution of Real Positive Definite Toeplitz Systems
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Rational Krylov sequence methods for eigenvalue computation
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Orthogonal Laurent polynomials and the strong Hamburger moment problem
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- A generalization of the steepest descent method for matrix functions
- Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals
- Iterative Krylov Methods for Large Linear Systems
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- Two polynomial methods of calculating functions of symmetric matrices
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- Numerical approximation of the product of the square root of a matrix with a vector
- Orthogonal rational functions and tridiagonal matrices
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Iterative exponential filtering for large discrete ill-posed problems
- Lanczos-based exponential filtering for discrete ill-posed problems
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
Cited In (26)
- Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces
- A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Extended and rational Hessenberg methods for the evaluation of matrix functions
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
- On the computation of Gauss quadrature rules for measures with a monomial denominator
- Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices
- The structure of matrices in rational Gauss quadrature
- Computationally enhanced projection methods for symmetric Sylvester and Lyapunov matrix equations
- Recursion relations for the extended Krylov subspace method
- Functions of rational Krylov space matrices and their decay properties
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- Extended Krylov subspace for parameter dependent systems
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- Massively parallel implementation and approaches to simulate quantum dynamics using Krylov subspace techniques
- Recurrence relations for orthogonal rational functions
- An extended Krylov subspace model-order reduction technique to simulate wave propagation in unbounded domains
- Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices
- The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules
- Convergence rates for inverse-free rational approximation of matrix functions
- Retracing the residual curve of a Lyapunov equation solver
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Title not available (Why is that?)
- The extended global Lanczos method for matrix function approximation
Uses Software
This page was built for publication: The extended Krylov subspace method and orthogonal Laurent polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025864)
