Numerical treatment of random polynomials (Q2365627)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Numerical treatment of random polynomials |
scientific article; zbMATH DE number 222470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical treatment of random polynomials |
scientific article; zbMATH DE number 222470 |
Statements
Numerical treatment of random polynomials (English)
0 references
29 June 1993
0 references
The authors investigate the numerical solution of random algebraic equations by employing Newton's divided difference formula. Especially, they discuss the convergence and order of convergence of iterates of solutions of random equations. For this purpose, a comparison theorem is developed, which relates the solution process of an auxiliary difference equation with a stochastic sequence satisfying a random difference inequality. As a special case of this theorem, the convergence of secant, Newton's and Muller's numerical schemes are analyzed. For illustration, a simple example is given.
0 references
random polynomials
0 references
Newton's numerical scheme
0 references
Muller's numerical scheme
0 references
secant method
0 references
random algebraic equations
0 references
Newton's divided difference formula
0 references
convergence
0 references
random difference inequality
0 references
0.8557261228561401
0 references
0.7993404269218445
0 references
0.7572920918464661
0 references
0.7506629228591919
0 references
0.7506629228591919
0 references