On a class of higher order methods for simultaneous rootfinding of generalized polynomials (Q1326426): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Carsten Carstensen / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Vasile Berinde / rank | |||
Normal rank | |||
Revision as of 04:29, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a class of higher order methods for simultaneous rootfinding of generalized polynomials |
scientific article |
Statements
On a class of higher order methods for simultaneous rootfinding of generalized polynomials (English)
0 references
11 December 1994
0 references
The paper is devoted to the study of a class of iterative methods for simultaneous computation of all zeros of generalized polynomials. It is proved that these methods are of convergence order \(N\), and also certain relations to other methods are discussed. Finally, a priori and a posteriori error estimates and some illustrating numerical examples are given.
0 references
iterative methods
0 references
zeros of generalized polynomials
0 references
convergence
0 references
error estimates
0 references
numerical examples
0 references
