A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
type: Item
instance of: scholarly article
title: A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
zbMATH Open document ID: 1016.65023
DOI: 10.1016/S0168-9274(02)00139-3
author: P. Novati
published in: Applied Numerical Mathematics
publication date: 2003-03-10T00:00:00Z
review text: A polynomial method based on interpolation at the Fejér points is introduced to compute the product of functions of large unsymmetric matrices by vectors. Detailed error analysis is given, some practical examples and numerical experiments are shown.
reviewed by: F. Szidarovszky
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 1879030
zbMATH Keywords: polynomial method
zbMATH Keywords: interpolation
zbMATH Keywords: Fejér points
zbMATH Keywords: functions of large unsymmetric matrices
zbMATH Keywords: error analysis
zbMATH Keywords: numerical experiments
describes a project that uses: SC Toolbox
describes a project that uses: Schwarz-Christoffel
MaRDI profile type: Publication
cites work: Efficient computation of the exponential operator for large, sparse, symmetric matrices
cites work: Algorithm 756: a MATLAB toolbox for Schwarz-Christoffel mapping
cites work: Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
cites work: Two polynomial methods of calculating functions of symmetric matrices
cites work: Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
cites work: On semiiterative methods generated by Faber polynomials
cites work: Fields of values and iterative methods
cites work: A study of semiiterative methods for nonsymmetric systems of linear equations
cites work: A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
cites work: Efficient Solution of Parabolic Equations by Krylov Approximation Methods
cites work: Q4223568
cites work: On Krylov Subspace Approximations to the Matrix Exponential Operator
cites work: Q5543004
cites work: Calculation of functions of unsymmetric matrices using Arnoldi's method
cites work: On Faber polynomials and Faber expansions
cites work: The Tchebychev iteration for nonsymmetric linear systems
cites work: On hybrid iterative methods for nonsymmetric systems of linear equations
cites work: An interpolatory approximation of the matrix exponential based on Faber polynomials
cites work: THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
cites work: Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
cites work: Q5549176
cites work: Numerical ranges and stability estimates
cites work: A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
cites work: Spectral Methods in Time for Hyperbolic Equations
cites work: Spectral Methods in Time for Parabolic Problems
cites work: Numerical Computation of the Schwarz–Christoffel Transformation
cites work: Q5523841
full work available at URL: s0168-9274(02)00139-3
OpenAlex ID: W2007967040
description: scientific article; zbMATH DE number 1879030