Self-scaling fast rotations for stiff and equality-constrained linear least squares problems

DOI10.1016/0024-3795(94)00092-1zbMATH Open0842.65025OpenAlexW1970859043MaRDI QIDQ1908193FDOQ1908193

Andrew A. Anda, Haesun Park

Publication date: 20 March 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00092-1

Recommendations

• Fast Plane Rotations with Dynamic Scaling
• scientific article; zbMATH DE number 17429
• Modifying the QR-Decomposition to Constrained and Weighted Linear Least Squares
• scientific article
• Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays

zbMATH Keywords

algorithms\(QR\) decompositionHouseholder methodGivens-rotation-based algorithmself-scaling fast plane rotationsstiff least squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
• Title not available (Why is that?)
• Title not available (Why is that?)
• Basic Linear Algebra Subprograms for Fortran Usage
• A weighted pseudoinverse, generalized singular values, and constrained least squares problems
• Title not available (Why is that?)
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• Least Squares Computations by Givens Transformations Without Square Roots
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Stable Numerical Algorithms for Equilibrium Systems
• Modifying the QR-Decomposition to Constrained and Weighted Linear Least Squares
• Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
• A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
• Iterative Methods for Equality-Constrained Least Squares Problems
• Perturbation Theory for the Least Squares Problem with Linear Equality Constraints
• Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays
• The economical storage of plane rotations
• On the Asymptotic Behavior of Scaled Singular Value and QR Decompositions
• Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems
• Title not available (Why is that?)
• Fast Plane Rotations with Dynamic Scaling
• A General Updating Algorithm for Constrained Linear Least Squares Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast givens rotations for orthogonal similarity transformations

Cited In (3)

• Polynomial computations for blind image deconvolution
• A self-scaling G-transformation for weighted least squares problems
• Efficient implementation of a structured total least squares based speech compression method

Uses Software

• Algorithm 539

This page was built for publication: Self-scaling fast rotations for stiff and equality-constrained linear least squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908193)