𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On two sequences of algorithms for approximating square roots

✍ Scribed by A.K. Yeyios

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
847 KB
Volume
40
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximation algorithm for least med
An approximation algorithm for least median of squares regression
✍ Clark F. Olson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 486 KB

Least median of squares (LMS) regression is a robust method to fit equations to observed data (typically in a linear model). This paper describes an approximation algorithm for LMS regression. The algorithm generates a regression solution with median residual no more than twice the optimal median re

An Iterated Eigenvalue Algorithm for App
An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials
✍ Steven Fortune πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 655 KB

We discuss an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. With some assumptions, we show that the algorithm approximates the roots within about log ρ/ Ο‡(P ) iter