On a Generalisation of Obreshkoff-Ehrlich Method for Simultaneous Extraction of All Roots of Polynomials Over an Arbitrary Chebyshev System
A. Iliev, Khr. Semerdzhiev
Abstract
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the classical methods of Obreshkoff and Ehrlich for simultaneous seeking of all roots of algebraic equations. Numerical examples are provided.
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