Automatic Smoothness Detection of the Resolvent Krylov Subspace Method for the Approximation of $C_0$-Semigroups

DOI10.1137/15M104880XzbMath1367.65070arXiv1701.08046MaRDI QIDQ5270355

Volker Grimm, T. Göckler

Publication date: 23 June 2017

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.08046

zbMATH Keywords

semigroupnumerical experimentrational approximationoperator functions\(\varphi\)-functionsrational Krylov subspace methodresolvent Krylov subspace method

Mathematics Subject Classification ID

Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (2)

Arnoldi Algorithms with Structured Orthogonalization ⋮ A conjugate-gradient-type rational Krylov subspace method for ill-posed problems

Uses Software

• RODAS
• expmARPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On convergence of Krylov subspace approximations of time-invariant self-adjoint dynamical systems
• Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
• Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling
• Rational Krylov sequence methods for eigenvalue computation
• Rational approximation to trigonometric operators
• Resolvent Krylov subspace approximation to operator functions
• RD-rational approximations of the matrix exponential
• A rational Lanczos algorithm for model reduction
• Residual, Restarting, and Richardson Iteration for the Matrix Exponential
• Convergence Analysis of an Extended Krylov Subspace Method for the Approximation of Operator Functions in Exponential Integrators
• Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
• Exponential integrators
• Approximation of Semigroups and Related Operator Functions by Resolvent Series
• Error Estimates and Evaluation of Matrix Functions via the Faber Transform
• On the Convergence of Krylov Subspace Methods for Matrix Mittag–Leffler Functions
• Efficient time integration for discontinuous Galerkin approximations of linear wave equations
• Using the Restricted-denominator Rational Arnoldi Method for Exponential Integrators
• High-Order Exponential Operator Splitting Methods for Time-Dependent Schrödinger Equations
• Splitting methods
• On Optimal Convergence Rate of the Rational Krylov Subspace Reduction for Electromagnetic Problems in Unbounded Domains
• Acceleration Techniques for Approximating the Matrix Exponential Operator
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• On Rational Approximations of Semigroups
• One-Parameter Semigroups for Linear Evolution Equations
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• Templates for the Solution of Algebraic Eigenvalue Problems
• Uniform Approximation of $\varphi$-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
• Shift-and-Invert Krylov Methods for Time-Fractional Wave Equations
• Preconditioning Lanczos Approximations to the Matrix Exponential
• Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential

This page was built for publication: Automatic Smoothness Detection of the Resolvent Krylov Subspace Method for the Approximation of $C_0$-Semigroups