Iterative solution methods for ill-posed problems

Daniela Calvetti; Lothar Reichel; Q. Zhang

doi:10.1117/12.211410

7 June 1995 Iterative solution methods for ill-posed problems

Daniela Calvetti, Lothar Reichel, Q. Zhang

Proceedings Volume 2563, Advanced Signal Processing Algorithms; (1995) https://doi.org/10.1117/12.211410
Event: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995, San Diego, CA, United States

Abstract

We describe new iterative methods for the solution of large ill-conditioned that arise from the discretization of ill-posed problems. In these methods a filter function, which determines the regularization of the problem, is chosen and expanded in terms of orthogonal polynomials. Each iteration yields one new term in this expansion. A variety of iterative methods, which differ in the choice of filter function and orthogonal polynomials, can be derived in this manner.

Citation Download Citation

Daniela Calvetti, Lothar Reichel, and Q. Zhang "Iterative solution methods for ill-posed problems", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); https://doi.org/10.1117/12.211410

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available