Some Generalizations of the Chebyshev Method for Simultaneous Determination of All Roots of Polynomial Equations
A. I. Iliev, Kh. I. Semerdzhiev
Abstract
Iterative methods for the simultaneous determination of all roots of an equation are dis-cussed. The multiplicities of the roots are assumed to be known in advance. The methods are proved to have a cubical rate of convergence. Numerical examples are given.
Create a lesson
Related papers
Fast and Stable Arbitrary Precision Approximate Matrix Multiplication
Ioana Dumitriu, Olga Holtz, Abraham Hsu et al.
Analysis of an inexact Schwarz domain decomposition method in 3D
Nibedita Ghosh
Energy conserving compatible space--time FEM for deterministic and stochastic rotating shallow water
Maneesh Kumar Singh, Colin J. Cotter
Preconditioning proximal Galerkin: mesh and degree robust solvers for variational inequalities
Ioannis P. A. Papadopoulos, Pablo D. Brubeck
On a maximum principle in discretization with spherical harmonics
Arnold Reusken
Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems
Christina Brandt, Patrick Horn