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-3zbMATH Open1016.65023OpenAlexW2007967040MaRDI QIDQ1861982FDOQ1861982
Authors: P. Novati 
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
Recommendations
interpolationerror analysisnumerical experimentspolynomial methodfunctions of large unsymmetric matricesFejér points
Cites Work
- Spectral Methods in Time for Parabolic Problems
- Spectral Methods in Time for Hyperbolic Equations
- On Faber polynomials and Faber expansions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical ranges and stability estimates
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Title not available (Why is that?)
- 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
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- Title not available (Why is that?)
- Efficient computation of the exponential operator for large, sparse, symmetric matrices
- Two polynomial methods of calculating functions of symmetric matrices
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Numerical Computation of the Schwarz–Christoffel Transformation
- The Tchebychev iteration for nonsymmetric linear systems
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Fields of values and iterative methods
- On hybrid iterative methods for nonsymmetric systems of linear equations
- On semiiterative methods generated by Faber polynomials
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- An interpolatory approximation of the matrix exponential based on Faber polynomials
Cited In (12)
- Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
- Backward error analysis of polynomial approximations for computing the action of the matrix exponential
- Convergence of the collocation method and the mechanical quadrature method for systems of singular integro-differential equations in Lebesgue spaces
- Numerical solution of weakly singular integrodifferential equations on closed smooth contour in Lebesgue spaces
- Interpolating discrete advection--diffusion propagators at Leja sequences
- Limited‐memory polynomial methods for large‐scale matrix functions
- The LEM exponential integrator for advection-diffusion-reaction equations
- Estimation of uTƒ(A)v for large‐scale unsymmetric matrices
- A low cost Arnoldi method for large linear initial value problems
- Optimal semi-iterative methods for complex SOR with results from potential theory
- Title not available (Why is that?)
- A posteriori error estimates of Krylov subspace approximations to matrix functions
Uses Software
This page was built for publication: A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861982)
