𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Square-root algorithms for parallel processing in optimal estimation

✍ Scribed by M. Morf; J.R. Dobbins; B. Friedlander; T. Kailath

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
707 KB
Volume
15
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

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

Parallel algorithms for downdating the l
Parallel algorithms for downdating the least squares estimator of the regression model
✍ Petko I. Yanev; Erricos J. Kontoghiorghes πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 993 KB

Computationally efficient parallel algorithms for downdating the least squares estimator of the ordinary linear regression are proposed. The algorithms, which are based on the QR decomposition, are block versions of sequential Givens strategies and efficiently exploit the triangular structure of the