Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem

DOI10.1007/BF01931661zbMath0702.65041OpenAlexW2072064420MaRDI QIDQ915372

Lars Eldén

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931661

zbMATH Keywords

algorithmsnumerical exampleconfidence intervalsleast squares problemill-posed problemslinear constraintslinear functionalsbidiagonalizationquadratic constraint

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (3)

Projected Tikhonov regularization of large-scale discrete ill-posed problems ⋮ Minimization of functionals on the solution of a large-scale discrete ill-posed problem ⋮ Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems

Uses Software

• BRENT

Cites Work

• Least squares with a quadratic constraint
• Approximations for ill-posed problems
• Constrained Least Squares Interval Estimation
• Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• An algorithm for linear least squares problems with equality and nonnegativity constraints
• Algorithms for the regularization of ill-conditioned least squares problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem