On semiiterative methods generated by Faber polynomials
From MaRDI portal
The author studies a fixed point iteration for solving a nonsingular system of linear algebraic equations, especially the properties of different semiiterative methods which are generated by Faber polynomials. If the iteration matrix is diagonalizable, a-priori error estimations are derived which show that the considered methods are nearly optimal in a non-asymptotic sense.
Recommendations
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. (Iterative methods for nonsymmetric systems of equations and approximation methods in the complex domain)
- On the Construction of Semi-Iterative Methods
- The solution of linear algebraic systems by polynomial iterative methods
- scientific article; zbMATH DE number 549215
Cites work
- A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- A study of semiiterative methods for nonsymmetric systems of linear equations
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- An optimum iterative method for solving any linear system with a square matrix
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- Faber Polynomials and the Faber Series
- scientific article; zbMATH DE number 3985819 (Why is no real title available?)
- scientific article; zbMATH DE number 3689770 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3263399 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3407002 (Why is no real title available?)
- On Faber polynomials and Faber expansions
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
- On the Construction of Semi-Iterative Methods
- On the optimization of an extrapolation method
- Richardson's iteration for nonsymmetric matrices
- The analysis of k-step iterative methods for linear systems from summability theory
- The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions
- The Tchebychev iteration for nonsymmetric linear systems
- Three remarks on the use of Čebyšev polynomials for solving equations of the second kind
Cited in
(26)- A study of semiiterative methods for nonsymmetric systems of linear equations
- Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. (Iterative methods for nonsymmetric systems of equations and approximation methods in the complex domain)
- An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- Relaxation methods for non-Hermitian linear systems
- Experiments with Krylov subspace methods on a massively parallel computer
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Iterative methods for the Drazin inverse of a matrix with a complex spectrum.
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
- A note on the tau-method approximations for the Bessel functions \(Y_ 0(z)\) and \(Y_ 1(z)\)
- Faber approximation of the Mori-Zwanzig equation
- Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
- Symbolic and numerical computation on Bessel functions of complex argument and large magnitude
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
- scientific article; zbMATH DE number 3985819 (Why is no real title available?)
- scientific article; zbMATH DE number 4076461 (Why is no real title available?)
- The Faber Polynomials for Annular Sectors
- Error Analysis of Krylov Methods In a Nutshell
- scientific article; zbMATH DE number 1943115 (Why is no real title available?)
- 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
- Properties and examples of Faber-Walsh polynomials
- Solving linear initial value problems by Faber polynomials
- Faber polynomials corresponding to rational exterior mapping functions
- An interpolatory approximation of the matrix exponential based on Faber polynomials
- Efficient higher-order local time integration for Friedrichs' systems
This page was built for publication: On semiiterative methods generated by Faber polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124270)
