The numerical stability of a Laguerre-like method for the simultaneous inclusion of polynomial zeros | Zendy

Miodrag S. Petković | Zendy; Dušan Milošević | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The numerical stability of a Laguerre-like method for the simultaneous inclusion of polynomial zeros

Author(s) -

Miodrag S. Petković,

Dušan Milošević

Publication year - 2006

Publication title -

publikacija elektrotehnickog fakulteta - serija matematika

Language(s) - English

Resource type - Journals

eISSN - 2406-0852

pISSN - 0353-8893

DOI - 10.2298/petf0617093p

Subject(s) - laguerre polynomials , mathematics , laguerre's method , rounding , convergence (economics) , stability (learning theory) , polynomial , rate of convergence , numerical stability , numerical analysis , mathematical analysis , orthogonal polynomials , computer science , classical orthogonal polynomials , computer network , channel (broadcasting) , machine learning , economics , economic growth , operating system

The numerical stability of the fourth order iterative method of La- guerre's type for the simultaneous inclusion of polynomial zeros is analyzed in the presence of rounding errors. We state conditions under which the con- vergence order of the considered method is preserved. If these conditions are relaxed, the convergence rate reduces to three.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research