Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
From MaRDI portal
Publication:1908193
DOI10.1016/0024-3795(94)00092-1zbMath0842.65025OpenAlexW1970859043MaRDI QIDQ1908193
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
algorithmsHouseholder method\(QR\) decompositionGivens-rotation-based algorithmself-scaling fast plane rotationsstiff least squares problems
Related Items (3)
Efficient implementation of a structured total least squares based speech compression method ⋮ Polynomial computations for blind image deconvolution ⋮ A self-scaling G-transformation for weighted least squares problems
Uses Software
Cites Work
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Fast givens rotations for orthogonal similarity transformations
- The economical storage of plane rotations
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- On the Asymptotic Behavior of Scaled Singular Value and QR Decompositions
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays
- Iterative Methods for Equality-Constrained Least Squares Problems
- A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
- Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems
- Perturbation Theory for the Least Squares Problem with Linear Equality Constraints
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- Modifying the QR-Decomposition to Constrained and Weighted Linear Least Squares
- Basic Linear Algebra Subprograms for Fortran Usage
- Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
- Fast Plane Rotations with Dynamic Scaling
- Stable Numerical Algorithms for Equilibrium Systems
- Least Squares Computations by Givens Transformations Without Square Roots
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
