Fast solving of weighted pairing least-squares systems

DOI10.1016/j.cam.2009.01.016zbMath1180.65046OpenAlexW2044188361MaRDI QIDQ2389536

Pierre Courrieu

Publication date: 17 July 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2009.01.016

zbMATH Keywords

performancealgorithmCholesky factorizationgeneralized inverseMoore-Penrose inverseminimum norm solution\(\{1,2,3\}\)-inversedata alignment problemsweighted pairing least-squares

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20)

Related Items

Quick approximation of bivariate functions ⋮ Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition ⋮ ComputingA_T,S(²) inverses of Hermitian matrices viaLDL^*decomposition for a square matrixA ⋮ On the convergence of rank-one multi-target linear regression

Uses Software

• Matlab
• robustbase

Cites Work

• A weighted least squares method for scattered data fitting
• The generalized Cholesky factorization method for saddle point problems
• Perturbation analysis for the generalized Cholesky factorization.
• Generalized inverses. Theory and applications.
• On the Moore-Penrose generalized inverse matrix
• Numerical methods for generalized least squares problems
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Robust Statistics

This page was built for publication: Fast solving of weighted pairing least-squares systems