An interpolatory approximation of the matrix exponential based on Faber polynomials
From MaRDI portal
A new method is introduced for approximating matrix exponentials based on interpolation in zeros of Faber polynomials. The method is very useful in solving linear initial value problems. Numerical examples illustrate the efficiency of the methodology.
Recommendations
- Solving linear initial value problems by Faber polynomials
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- Efficient approximation of the exponential operator for discrete 2D advection–diffusion problems
- RD-rational approximations of the matrix exponential
- Polynomial approximation of functions of matrices and applications
Cites work
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Krylov projection method for systems of ODEs
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Faber Polynomials and the Faber Series
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
- High Degree Polynomial Interpolation in Newton Form
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 556491 (Why is no real title available?)
- scientific article; zbMATH DE number 3263399 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
- Numerical Computation of the Schwarz–Christoffel Transformation
- Numerical ranges and stability estimates
- On Faber polynomials and Faber expansions
- On hybrid iterative methods for nonsymmetric systems of linear equations
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On semiiterative methods generated by Faber polynomials
- The Reduced Basis Method for Initial Value Problems
- The Tchebychev iteration for nonsymmetric linear systems
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
Cited in
(24)- Backward error analysis of polynomial approximations for computing the action of the matrix exponential
- New efficient substepping methods for exponential timestepping
- Preconditioning linear systems via matrix function evaluation
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
- Interpolating discrete advection--diffusion propagators at Leja sequences
- Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
- On Bernoulli matrix polynomials and matrix exponential approximation
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- A posteriori error estimates of Krylov subspace approximations to matrix functions
- A massively parallel exponential integrator for advection-diffusion models
- The LEM exponential integrator for advection-diffusion-reaction equations
- Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- A new piecewise rational interpolation based on matrix Padé-type approximation
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Conformal mapping via a density correspondence for the double-layer potential
- Approximation of the linear combination of -functions using the block shift-and-invert Krylov subspace method
- Properties and examples of Faber-Walsh polynomials
- Solving linear initial value problems by Faber polynomials
- Efficient approximation of the exponential operator for discrete 2D advection–diffusion problems
- Limited‐memory polynomial methods for large‐scale matrix functions
- A discrete model of a transmission line and the Faber polynomials
This page was built for publication: An interpolatory approximation of the matrix exponential based on Faber polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939879)
