Abstract
We consider the problem of approximating functions by sums of few exponentials functions, either on an interval or on the positive half-axis. We study both continuous and discrete cases, i.e. when the function is replaced by a number of equidistant samples. Recently, an algorithm has been constructed by Beylkin and Monzón for the discrete case. We provide a theoretical framework for understanding how this algorithm relates to the continuous case.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
