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

Unrestricted algorithms for reciprocals and square roots

โœ Scribed by C. W. Clenshaw; F. W. J. Olver

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
694 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Square-root algorithms for parallel proc
Square-root algorithms for parallel processing in optimal estimation
โœ M. Morf; J.R. Dobbins; B. Friedlander; T. Kailath ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 707 KB

Explicit square-root algorithms allow measurements for the standard state estimation problem to be processed in parallel with little communication between processors. A particular consequence is the development of compact square-root doubling formulae.

Fast parallel algorithms for Graeffe's r
Fast parallel algorithms for Graeffe's root squaring technique
โœ P.K. Jana; B.P. Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

This paper presents two parallel algorithms for the solution of a polynomial equation of degree n, where n can be very large. The algorithms are based on Graeffe's root squaring technique implemented on two different systolic architectures, built around mesh of trees and multitrees, respectively. Ea