Sites and Affiliations
Research and Applications
Major Accomplishments
Frequently Asked Questions
Knowledge and Technology Transfer
Education and Outreach
Media Resources
Technical Reports and Publications
Parallel Computing Research - Our Quarterly Newsletter
Contact Information
CRPC Home Page

UniGuide Featured Site

Regularization of Discrete Ill-posed Problems

Marielba Rojas

Presented at the 1997 CRPC Annual Meeting Poster Session

Large-scale discrete ill-posed problems arise naturally from inverse problems in a variety of fields like medical imaging, geophysics and satellite imaging.

The fact that the coefficient matrices arising in these problems are very ill-conditioned and that the data usually contain a high level of noise, precludes the use of standard methods for linear systems of equations or for least squares problems.

Regularization methods attempt to overcome this difficulty by replacing the original ill-conditioned problem with a better conditioned related problem. The solution of the latter is called a regularized solution for the original problem.

We pose the regularization problem as a quadratically constrained least squares problem, or trust region subproblem. We then apply a recent method for the large scale trust region subproblem that recasts the problem as a parameterized eigenvalue problem. The method relies on the Implicitly Restarted Lanczos Method for solving a sequence of eigenproblems.

We will present the method and some preliminary numerical results, and discuss the difficulties that arise in the ill-conditioned case.