We prove the first sufficient convergence criterion for Laguerre’s root-finding algorithm, which by empirical evidence is highly efficient. The criterion is applicable to simple roots of polynomials with degree greater than 3. The “Sums of Powers Algorithm” (SPA), which is a reliable iterative root-finding method, can be used to fulfill the condition for each root. Therefore, Laguerre’s method together with the SPA is now an efficient and reliable algorithm (LaSPA). In computational mathematics these results solve a central task which was first attacked by L. Euler 266 years ago.
Problems of Information Transmission – Springer Journals
Published: Jan 5, 2016
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud