liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Minimization of linear functionals defined on solutions of large-scale discrete Ill-posed problems
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Scientific Computing.ORCID iD: 0000-0003-2281-856X
2005 (English)In: BIT Numerical Mathematics, ISSN 0006-3835, Vol. 45, no 2, 329-340 p.Article in journal (Refereed) Published
Abstract [en]

The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat conduction problem.

Place, publisher, year, edition, pages
2005. Vol. 45, no 2, 329-340 p.
National Category
URN: urn:nbn:se:liu:diva-22838DOI: 10.1007/s10543-005-7122-yLocal ID: 2176OAI: diva2:243151
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2013-08-30

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Elden, Lars
By organisation
The Institute of TechnologyScientific Computing
In the same journal
BIT Numerical Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 329 hits
ReferencesLink to record
Permanent link

Direct link