Solution of linear ill-posed operator equations by modified truncated singular value expansion

In much of the literature on the solution of linear ill-posed operator equations in a Hilbert space, the operator equation first is discretized, then the discretized operator is regularized, and finally, the computed solution of the regularized discrete problem is projected into a Hilbert space. In order for this solution approach to give an accurate approximate solution, the regularization method has to correspond to a meaningful analogue in Hilbert space. Moreover, the regularization method chosen may only be applicable to certain linear ill-posed operator equations. However, these issues typically are not discussed in the literature on solution methods based on discretization. One approach to circumvent this difficulty is to avoid discretization. This paper describes how regularization by a modified truncated singular value decomposition introduced in Noschese and Reichel (2014) for finite-dimensional problems can be extended to operator equations. In finite dimensions, this regularization method yields approximate solutions of higher quality than standard truncated singular value decomposition. Our analysis in a Hilbert space setting is of practical interest, because the solution method presented avoids the introduction of discretization errors during the solution process, since we compute regularized solutions without discretization by using the program package Chebfun. While this paper focuses on a particular regularization method, the analysis presented and Chebfun also can be applied to other regularization techniques.

Authors

Institutions

Publication Details

Journal
Journal of Computational and Applied Mathematics
Published
2025-03-07
DOI
https://doi.org/10.1016/j.cam.2025.116621
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solution of linear ill-posed operator equations by modified truncated singular value expansion

Silvia Noschese, L. Dykes, Lothar Reichel, Mykhailo Kuian et al.
Journal of Computational and Applied Mathematics
Numerical methods in inverse problems
article

Solution of linear ill-posed operator equations by modified truncated singular value expansion

Silvia Noschese, L. Dykes, Lothar Reichel, Mykhailo Kuian, Thomas Mach
article en

Abstract

In much of the literature on the solution of linear ill-posed operator equations in a Hilbert space, the operator equation first is discretized, then the discretized operator is regularized, and finally, the computed solution of the regularized discrete problem is projected into a Hilbert space. In order for this solution approach to give an accurate approximate solution, the regularization method has to correspond to a meaningful analogue in Hilbert space. Moreover, the regularization method chosen may only be applicable to certain linear ill-posed operator equations. However, these issues typically are not discussed in the literature on solution methods based on discretization. One approach to circumvent this difficulty is to avoid discretization. This paper describes how regularization by a modified truncated singular value decomposition introduced in Noschese and Reichel (2014) for finite-dimensional problems can be extended to operator equations. In finite dimensions, this regularization method yields approximate solutions of higher quality than standard truncated singular value decomposition. Our analysis in a Hilbert space setting is of practical interest, because the solution method presented avoids the introduction of discretization errors during the solution process, since we compute regularized solutions without discretization by using the program package Chebfun. While this paper focuses on a particular regularization method, the analysis presented and Chebfun also can be applied to other regularization techniques.

Journal of Computational and Applied MathematicsVol. 467
Kent State University (US), University of Potsdam (DE), Case Western Reserve University (US), Sapienza University of Rome (IT)
Deutsche Forschungsgemeinschaft, Sapienza Università di Roma, California Department of Fish and Wildlife, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 92%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.