A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays

DOI10.1137/0912042zbMath0731.65028OpenAlexW2062021750WikidataQ130471533 ScholiaQ130471533MaRDI QIDQ3357425

Jürgen Götze, Uwe Schwiegelshohn

Publication date: 1991

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0912042

zbMATH Keywords

systolic arraysnumerical stabilitylinear least squares problemGivens rotationsQR-decompositionVLSL- implementation

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cellular automata (computational aspects) (68Q80) Orthogonalization in numerical linear algebra (65F25)

Related Items (3)

Square-root RTS smoothing algorithms ⋮ A distributed and iterative method for square root filtering in space- time estimation ⋮ Special Issue: A systolic block-Jacobi SVD solver for processor meshes

This page was built for publication: A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays