Continuous Adaptive Cross Approximation for Ill-posed Problems with Chebfun

DOI10.1007/S11075-022-01390-ZMaRDI QIDQ6346258arXivFDO

Authors Ali S. Al-Qahtani, Thomas Mach, Lukas Reichel

Publication date 31 July 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11075-022-01390-Z

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Fredholm integral equations (45B05) Linear operators and ill-posed problems, regularization (47A52) Numerical analysis (65-XX) Ill-posedness and regularization problems in numerical linear algebra (65F22)

arXiv classification

cs.NAmath.NA

Abstract: 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. This approach allows a user to work with functions instead of matrices. The solution process therefore is much closer to the analysis of ill-posed problems than standard linear algebra-based solution methods.

This page was built for publication: Continuous Adaptive Cross Approximation for Ill-posed Problems with Chebfun

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6346258)