On semiiterative methods generated by Faber polynomials

DOI10.1007/BF01409782zbMath0678.65020MaRDI QIDQ1124270

Michael Eiermann

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133389

zbMATH Keywords

semiiterative methodsFaber polynomialsfixed point iterationa-priori error estimations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations ⋮ Analysis of algebraic systems arising from fourth‐order compact discretizations of convection‐diffusion equations ⋮ Conformal Mapping via a Density Correspondence for the Double-Layer Potential ⋮ A note on the tau-method approximations for the Bessel functions \(Y_ 0(z)\) and \(Y_ 1(z)\) ⋮ Iterative methods for the Drazin inverse of a matrix with a complex spectrum. ⋮ Properties and examples of Faber-Walsh polynomials ⋮ Faber approximation of the Mori-Zwanzig equation ⋮ Error Analysis of Krylov Methods In a Nutshell ⋮ An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK ⋮ Faber polynomials corresponding to rational exterior mapping functions ⋮ THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES ⋮ An interpolatory approximation of the matrix exponential based on Faber polynomials ⋮ The Faber Polynomials for Annular Sectors ⋮ Relaxation methods for non-Hermitian linear systems ⋮ Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials ⋮ Symbolic and numerical computation on Bessel functions of complex argument and large magnitude ⋮ A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices ⋮ Experiments with Krylov subspace methods on a massively parallel computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the optimization of an extrapolation method
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Richardson's iteration for nonsymmetric matrices
• A study of semiiterative methods for nonsymmetric systems of linear equations
• On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
• An optimum iterative method for solving any linear system with a square matrix
• The analysis of k-step iterative methods for linear systems from summability theory
• The Tchebychev iteration for nonsymmetric linear systems
• On Faber polynomials and Faber expansions
• The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions
• A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
• On the Construction of Semi-Iterative Methods
• Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
• Three remarks on the use of Čebyšev polynomials for solving equations of the second kind
• A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
• Faber Polynomials and the Faber Series