期刊
NUMERICAL ALGORITHMS
卷 92, 期 4, 页码 2341-2364出版社
SPRINGER
DOI: 10.1007/s11075-022-01390-z
关键词
Ill-posed problem; Inverse problem; Chebfun; Truncated SVE; Tikhonov regularization
This paper explores the feasibility of using the Chebfun package and a regularize-first approach to solve ill-posed problems numerically, which allows for a closer analysis-based solution rather than the traditional linear algebra-based method.
The analysis of linear ill-posed problems often is carried out in function spaces using tools from functional analysis. However, the numerical solution of these problems typically is computed by first discretizing the problem and then applying tools from finite-dimensional linear algebra. The present paper explores the feasibility of applying the Chebfun package to solve ill-posed problems with a regularize-first approach numerically. This allows a user to work with functions instead of vectors and with integral operators instead of matrices. The solution process therefore is much closer to the analysis of ill-posed problems than standard linear algebra-based solution methods. Furthermore, the difficult process of explicitly choosing a suitable discretization is not required.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据