Numerical Functional Analysis and Optimization · 1979 · 69 citations · 4 references
ComputingComputer ScienceAlgorithmsFinite Element MethodsOptimizationApproximation MethodsConvergence AnalysisError EstimationInverse ProblemsNumerical AlgorithmsOperator TheoryComputational Inverse ProblemsError BoundsError Bounds EstimationIll-posed Inverse ProblemsInverse Problem TheoryOperatorsRegularization TechniquesRegularized Inversion
Abstract Approximations to the Moore-Penrose generalized inverse are obtained via iteration in the application of regularization. Uniform error bounds are obtained for linear operators with closed range. For operators with arbitrary range pointwise error estimates are derived assuming certain smoothness conditions on the data. The stability of the iteration is considered and error bounds are obtained for“noisy”data. ∗The work of this author was partially supported by NSF Grant MCS 76 24433 †This work performed while on leave at the University of Cincinnati ∗The work of this author was partially supported by NSF Grant MCS 76 24433 †This work performed while on leave at the University of Cincinnati Notes ∗The work of this author was partially supported by NSF Grant MCS 76 24433 †This work performed while on leave at the University of Cincinnati
4
Solutions of Ill-Posed Problems.
John B. Bell, V. Y. Arsenin · Mathematics of Computation · 1978 · 8.2K citations
New error bounds for the penalty method and extrapolation
J. T. King · Numerische Mathematik · 1974 · 30 citations