Abstract

We describe the numerical approximation of the inverse Laplace function based on the Laplace transform's eigenfunction expansion of the inverse function, in a real case. The error analysis allows us to introduce a regularization technique involving computable upper bounds of amplification factors of local errors introduced by the computational process. A regularized solution is defined as one which is obtained within the maximum attainable accuracy. Moreover the regularization parameter, that in this case coincides with the truncation parameter of the eigenfunction expansion, is dynamically computed by the algorithm itself in such a way that it provides the minimum of the global error bound.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.