Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems

DOI10.2307/2004965zbMATH Open0185.40701OpenAlexW4234943641MaRDI QIDQ5577964FDOQ5577964

Authors: C. L. Lawson, Richard J. Hanson 

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2004965

zbMATH Keywords

numerical analysis

Cites Work

• Title not available (Why is that?)
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• On the Continuity of the Generalized Inverse
• On Error Bounds for Generalized Inverses
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Title not available (Why is that?)
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations
• Title not available (Why is that?)
• Note on the iterative refinement of least squares solution
• A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions
• Householder's tridiagonalization of a symmetric matrix
• Experiments on Error Growth Associated with Some Linear Least-Squares Procedures
• Smallest Least Squares Solutions of Linear Equations
• On Least Squares Solutions of Linear Equations
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Mapping from rectangular to harmonic representation
• Householder reflections versus Givens rotations in sparse orthogonal decomposition
• An efficient rank detection procedure for modifying the ULV decomposition
• The treatment of bias in the square-root information filter/smoother
• Algebraic relationships between classical regression and total least- squares estimation
• Bidiagonalization and diagonalization
• On the constrained linear least-squares problem: A personal view
• A fast method for cylindrical object location determination
• The construction of free-free flexibility matrices for multilevel structural analysis
• A gradient projection-multiplier method for nonlinear programming
• Some remarks on matrix norms, condition numbers, and error estimates for linear equations
• A finite element solution of a reduced Fokker-Planck equation
• A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems
• Efficient algorithms for block downdating of least squares solutions
• \(\epsilon\)-subgradient projection algorithm
• Smoothing, splines and smoothing splines; their application in geomagnetism
• A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations
• A theory for optimal regularization in the finite dimensional case
• Geometric programming problems with negative degrees of difficulty
• A note on the computation of maximum likelihood estimates in linear regression models with autocorrelated errors
• Multiobjective regression modification for collinearity
• On the error estimate for the projection of a point onto a linear manifold
• A Dirichlet random coefficient regression model for quality indicators
• Perturbation analysis for the projection of a point to an affine set
• Some new properties of the equality constrained and weighted least squares problem
• Solving the nonlinear power flow problem through general solutions of under-determined linearised systems
• The structure of some matrices arising in tomography
• The adventures of a simple algorithm
• Condition of boundary integral equations arising from flow computations
• On the measures of multicollinearity in least squares regression
• Solution of sparse linear least squares problems using Givens rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Stability analysis of the method of seminormal equations for linear least squares problems
• Algorithms and experiments for structural mechanics on high-performance architectures
• Solving large and sparse linear least-squares problems by conjugate gradient algorithms
• Subspace tracking in low-rank real-time systems
• A direct method for the solution of sparse linear least squares problems
• Stability of the solutions of linear least squares problems
• Discrete generalized algebraic Riccati equations and polynomial matrix factorization
• Solving large linear least squares problems with linear equality constraints
• Algebraic properties of the rank-deficient equality-constrained and weighted least squares problems
• A comparative analysis of various least-squares identification algorithms
• A survey of published programs for best approximation
• Interpolation on a triangulated 3D surface
• A data fitting approach to series convergence acceleration
• Difference formulas for the surface Laplacian on a triangulated surface
• A pipelined Givens method for computing the QR factorization of a sparse matrix
• On rank-deficient pseudoinverses
• A coordinate system for a viscous transonic cascade analysis
• An improved penalty function method for solving constrained parameter optimization problems
• The general linear model of the generalized singular value decomposition
• The general problem of ill conditioning and its role in statistical analysis
• A regularizing L-curve Lanczos method for underdetermined linear systems
• Total least squares fitting of Bézier and B-spline curves to ordered data
• Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
• On the solution of the linear least squares problems and pseudo-inverses
• Periodic collision orbits in the elliptic restricted three-body problem
• Periodic orbits in the Planar General Three-Body Problem
• Additive preconditioning and aggregation in matrix computations
• Comparing parameter choice methods for regularization of ill-posed problems
• A new variable reduction technique for convex integer quadratic programs
• Conditions for geometric continuity between polynomial and rational surface patches
• An algorithmic approach to loop shaping with applications to self-tuning control systems
• Constructions of \(G^{1}\) continuous joins of rational Bézier patches
• A lattice matrix method for hyperspectral image unmixing
• Perturbation theory for orthogonal projection methods with applications to least squares and total least squares
• A meshless method for some inverse problems associated with the Helmholtz equation
• The sagitta method for solving linear programs
• Nonequivalence deflation for the solution of matrix latent value problems
• A new autocovariance least-squares method for estimating noise covariances
• The kidney model as an inverse problem
• Numerical treatment of the parameter identification problem for delay- differential systems arising in immune response modelling
• A generalization of Hukuhara difference and division for interval and fuzzy arithmetic
• Computational methods of linear algebra
• Perturbation theory for pseudo-inverses
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• Improvement of source and wind field input of atmospheric dispersion model by assimilation of concentration measurements: method and applications in idealized settings
• Management of uncertainty in statistical reasoning: the case of regression analysis
• Error analysis of algorithms for computing the projection of a point onto a linear manifold
• An algorithm for constructing convexity and monotonicity-preserving splines in tension
• Large-scale Tikhonov regularization via reduction by orthogonal projection
• Least squares modifications with inverse factorizations: Parallel implications
• The triangle method for finding the corner of the L-curve
• Rules and software for detecting rank degeneracy
• Some results about vector extrapolation methods and related fixed-point iterations
• Generalized QR factorization and its applications
• Constructing the physical parameters of a damped vibrating system from eigendata
• Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
• Interpolation and approximation of 3-D and 4-D scattered data
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge
• The calculation of eigenvalues for the stationary perturbation of Poiseuille flow
• A new stable bidiagonal reduction algorithm
• Optimization over geodesics for exact principal geodesic analysis
• The Cholesky factorization in interior point methods
• How many parameters can a model have and still be testable?
• Perturbation of the least squares problem
• Estimation of cell kinetic parameters from flow microfluorometry
• A new variant of L-curve for Tikhonov regularization
• A computational inverse method for identification of non-Gaussian random fields using the Bayesian approach in very high dimension

This page was built for publication: Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems

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