SIAM Review · 1998 · 646 citations · 30 references
ComputingComputer ScienceMathematicsAlgorithmsMachine LearningOptimizationApproximation AlgorithmsLinear AlgebraMatrix ComputationNumerical AlgorithmsNumerical AnalysisNumerical Linear AlgebraCross-validationLinear System SolversRegularizationRegularization Techniques
It is shown that the basic regularization procedures for finding meaningful approximate solutions of ill-conditioned or singular linear systems can be phrased and analyzed in terms of classical linear algebra that can be taught in any numerical analysis course. Apart from rewriting many known results in a more elementary form, we also derive a new two-parameter family of merit functions for the determination of the regularization parameter. The traditional merit functions from generalized cross validation (GCV) and generalized maximum likelihood (GML) are recovered as special cases.
30
Smoothing noisy data with spline functions
Peter G. Craven, Grace Wahba · Numerische Mathematik · 1978 · 3.4K citations
Numerical methods for least squares problems
Choice Reviews Online · 1996 · 3.1K citations