Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
From MaRDI portal
Publication:5544723
DOI10.1145/363347.363364zbMath0162.20701MaRDI QIDQ5544723
Gene H. Golub, Richard H. Bartels
Publication date: 1968
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363347.363364
Related Items
The optimal exchange algorithm and comparisons with the generalized remes algorithm†‡, A Steepest Ascent Method for the Chebyshev Problem, Computational methods of linear algebra, A survey of published programs for best approximation, A proximal point algorithm for minimax problems, A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems, Approximation in normed linear spaces, A modified Dold-Lashof construction that does classify \(H\)-principal fibrations, Bounds for the error of linear systems of equations using the theory of moments, Form Assessment in Coordinate Metrology, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression, A cheap approximate solution to everett-type rational approximation problems, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems