Error analysis of algorithms for computing the projection of a point onto a linear manifold

DOI10.1016/0024-3795(86)90141-2zbMath0629.65042OpenAlexW2091713076MaRDI QIDQ1094093

A. Laratta, Mario Arioli

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90141-2

zbMATH Keywords

projectionGram-Schmidt processaccumulation of rounding errorsGivens orthogonal factorizationHouseholder factorizationleast distance problemprojection of a point onto a linear manifold

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

Solution of augmented linear systems using orthogonal factorizations ⋮ Finding the orthogonal projection of a point onto an affine subspace ⋮ Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces ⋮ On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic ⋮ On the error estimate for the projection of a point onto a linear manifold ⋮ Perturbation analysis for the projection of a point to an affine set

Uses Software

• LINPACK

Cites Work

• Unnamed Item
• Error analysis of an algorithm for solving an undetermined linear system
• Numeric computation of the projection of a point onto a polyhedron
• Direct methods for the solution of linear systems
• A direct method for the general solution of a system of linear equations
• Error analysis of QR decompositions by Givens transformations
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems

This page was built for publication: Error analysis of algorithms for computing the projection of a point onto a linear manifold