Minimax entropy solutions of ill-posed problems

DOI10.1090/S0033-569X-09-01120-7zbMath1210.47101OpenAlexW2070098148MaRDI QIDQ3625440

Fred Greensite

Publication date: 5 May 2009

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

Full work available at URL: http://www.ams.org/distribution/qam/2009-67-01/S0033-569X-09-01120-7/home.html

zbMATH Keywords

inverse problemsill-posed problemsSylvester equationLjapunov equation

Mathematics Subject Classification ID

Inverse problems involving ordinary differential equations (34A55) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Inverse problems for integral equations (45Q05) Applications of operator theory in numerical analysis (47N40)

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete Picard condition for discrete ill-posed problems
• Limitations of the \(L\)-curve method in ill-posed problems
• Sylvester Tikhonov-regularization methods in image restoration
• Lyapunov matrix equations in system stability and control.
• Well-posed stochastic extensions of ill-posed linear problems
• Pitfalls in the Numerical Solution of Linear Ill-Posed Problems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Generalizing the Singular Value Decomposition
• Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
• Probability Theory
• Inverse Problem Theory and Methods for Model Parameter Estimation
• Non-convergence of the L-curve regularization parameter selection method