A new investigation of the extended Krylov subspace method for matrix function evaluations
From MaRDI portal
Publication:3090788
DOI10.1002/nla.652zbMath1240.65154OpenAlexW1996297482MaRDI QIDQ3090788
Valeria Simoncini, Leonid Knizhnerman
Publication date: 2 September 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.652
error estimatesnumerical experimentsKrylov subspacematrix functionasymptotic convergenceFaber polynomiallarge matrix
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (51)
Efficient approximation of functions of some large matrices by partial fraction expansions ⋮ A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions ⋮ A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators ⋮ 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 ⋮ Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources ⋮ An extended-rational Arnoldi method for large matrix exponential evaluations ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching ⋮ Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix ⋮ The Short-Term Rational Lanczos Method and Applications ⋮ Numerical solutions of the time‐dependent Schrödinger equation with position‐dependent effective mass ⋮ A literature survey of matrix methods for data science ⋮ A rational Arnoldi process with applications ⋮ A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems ⋮ Orthogonal rational functions on the unit circle with prescribed poles not on the unit circle ⋮ Unnamed Item ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices ⋮ Recurrence relations for orthogonal rational functions ⋮ Recursion relations for the extended Krylov subspace method ⋮ A nested Krylov subspace method to compute the sign function of large complex matrices ⋮ Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector ⋮ Convergence analysis of the extended Krylov subspace method for the Lyapunov equation ⋮ Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions ⋮ APPROXIMATION OF THE LINEAR COMBINATION OF <i>φ</i>-FUNCTIONS USING THE BLOCK SHIFT-AND-INVERT KRYLOV SUBSPACE METHOD ⋮ The extended global Lanczos method for matrix function approximation ⋮ Analysis of Krylov subspace approximation to large-scale differential Riccati equations ⋮ Rational Krylov methods for functions of matrices with applications to fractional partial differential equations ⋮ On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices ⋮ Multigrid Methods for Discrete Fractional Sobolev Spaces ⋮ Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices ⋮ A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices ⋮ Convergence rates for inverse-free rational approximation of matrix functions ⋮ Approximation of functions of large matrices with Kronecker structure ⋮ Rational Lanczos approximations to the matrix square root and related functions ⋮ Krylov iterative methods for the geometric mean of two matrices times a vector ⋮ Block Krylov subspace methods for approximating the linear combination of \(\varphi\)-functions arising in exponential integrators ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ Resolvent Krylov subspace approximation to operator functions ⋮ Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces ⋮ Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices ⋮ Extended Krylov subspace for parameter dependent systems ⋮ Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation ⋮ Krylov subspace methods for functions of fractional differential operators ⋮ Frequency-Limited Balanced Truncation with Low-Rank Approximations ⋮ Approximating the leading singular triplets of a large matrix function ⋮ Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling ⋮ The extended Krylov subspace method and orthogonal Laurent polynomials ⋮ Low-Rank Updates of Matrix Functions II: Rational Krylov Methods ⋮ Extended nonsymmetric global Lanczos method for matrix function approximation ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical range, GMRES and Faber polynomials.
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- Numerical range and functional calculus in Hilbert space
- On monotonicity of the Lanczos approximation to the matrix exponential
- Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices
- A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
- The polynomial numerical hulls of Jordan blocks and related matrices.
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- RD-rational approximations of the matrix exponential
- Exponential Runge-Kutta methods for parabolic problems.
- Exponential integrators for quantum-classical molecular dynamics
- Magnus-factorized method for numerical solving the time-dependent Schrödinger equation
- Talbot quadratures and rational approximations
- QCD and numerical analysis III. Proceedings of the third international workshop on numerical analysis and lattice QCD, Edinburgh, UK, June 30 -- July 4, 2003.
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Acceleration Techniques for Approximating the Matrix Exponential Operator
- Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
- Error Estimates for Polynomial Krylov Approximations to Matrix Functions
- Spectral Methods in Time for Parabolic Problems
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Asymptotics of Akhiezer polynomials and uniform convergence of Padé approximants for hyperelliptic functions
- Algorithm 756: a MATLAB toolbox for Schwarz-Christoffel mapping
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- Exponential Integrators for Large Systems of Differential Equations
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Two polynomial methods of calculating functions of symmetric matrices
- An interpolatory approximation of the matrix exponential based on Faber polynomials
This page was built for publication: A new investigation of the extended Krylov subspace method for matrix function evaluations
