Laura Dykes , Mykhailo Kuian , Thomas Mach , Silvia Noschese , Lothar Reichel
{"title":"Solution of linear ill-posed operator equations by modified truncated singular value expansion","authors":"Laura Dykes , Mykhailo Kuian , Thomas Mach , Silvia Noschese , Lothar Reichel","doi":"10.1016/j.cam.2025.116621","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"467 ","pages":"Article 116621"},"PeriodicalIF":2.1000,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725001360","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍:
The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest.
The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.