๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An iterative algorithm for analysis of variance

โœ Scribed by J.J. Daudin

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
659 KB
Volume
10
Category
Article
ISSN
0020-7101

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An iterative algorithm for the separatio
An iterative algorithm for the separation of action potential sequences
โœ Isak Gath; David Nizan ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science โš– 355 KB

Various iterative algorithms for separation of superimposed event sequences were designed, and their efficiency examined through simulation studies. It has been found that a double parallel-serial algorithm improved markedly the efficiency of the filtration process. For the same probability of detec

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