On semiiterative methods generated by Faber polynomials (Q1124270)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4111897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On semiiterative methods generated by Faber polynomials |
scientific article; zbMATH DE number 4111897 |
Statements
On semiiterative methods generated by Faber polynomials (English)
0 references
1989
0 references
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.
0 references
fixed point iteration
0 references
semiiterative methods
0 references
Faber polynomials
0 references
a-priori error estimations
0 references
0 references
0 references
0 references
0 references
0.8507590889930725
0 references
0.8314951658248901
0 references
0.7975850701332092
0 references
0.7923715114593506
0 references
