A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
From MaRDI portal
Publication:1861982
DOI10.1016/S0168-9274(02)00139-3zbMath1016.65023OpenAlexW2007967040MaRDI QIDQ1861982
Publication date: 10 March 2003
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(02)00139-3
interpolationnumerical experimentserror analysispolynomial methodFejér pointsfunctions of large unsymmetric matrices
Related Items
A low cost Arnoldi method for large linear initial value problems ⋮ Interpolating discrete advection--diffusion propagators at Leja sequences ⋮ Backward error analysis of polynomial approximations for computing the action of the matrix exponential ⋮ Accurate evaluation of divided differences for polynomial interpolation of exponential propagators ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Convergence of the collocation method and the mechanical quadrature method for systems of singular integro-differential equations in Lebesgue spaces ⋮ The LEM exponential integrator for advection-diffusion-reaction equations ⋮ Numerical solution of weakly singular integrodifferential equations on closed smooth contour in Lebesgue spaces ⋮ Optimal semi-iterative methods for complex SOR with results from potential theory ⋮ A posteriori error estimates of Krylov subspace approximations to matrix functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- A study of semiiterative methods for nonsymmetric systems of linear equations
- On semiiterative methods generated by Faber polynomials
- Fields of values and iterative methods
- The Tchebychev iteration for nonsymmetric linear systems
- Numerical ranges and stability estimates
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- On hybrid iterative methods for nonsymmetric systems of linear equations
- On Faber polynomials and Faber expansions
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- Spectral Methods in Time for Parabolic Problems
- Numerical Computation of the Schwarz–Christoffel Transformation
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Algorithm 756: a MATLAB toolbox for Schwarz-Christoffel mapping
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Spectral Methods in Time for Hyperbolic Equations
- 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 polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
