The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots

DOI10.1134/S0032946015040055zbMATH Open1351.65027MaRDI QIDQ327308FDOQ327308

Authors: Herbert Möller 

Publication date: 19 October 2016

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2015317
• An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently
• The Laguerre method for finding the zeros of polynomials

zbMATH Keywords

convergenceLaguerre's root-finding algorithmsums of powers algorithm

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Numerical recipes. The art of scientific computing.
• An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
• Title not available (Why is that?)

Cited In (1)

• An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli

Uses Software

• SPAViews

This page was built for publication: The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327308)