Numerical treatment of random polynomials
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.
- scientific article; zbMATH DE number 3913392 (Why is no real title available?)
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 3996785 (Why is no real title available?)
- Numerical solution of random nonlinear equations
- Random differential inequalities
This page was built for publication: Numerical treatment of random polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365627)