Abstract
This paper introduces a fully discrete soft thresholding trigonometric polynomial approximation on [−π,π], named Lasso trigonometric interpolation. This approximation is an ℓ1-regularized discrete least squares approximation under the same conditions of classical trigonometric interpolation on an equidistant grid. Lasso trigonometric interpolation is a sparse scheme which is efficient in dealing with noisy data. We theoretically analyze Lasso trigonometric interpolation quality for continuous periodic function. The L2 error bound of Lasso trigonometric interpolation is less than that of classical trigonometric interpolation, which improved the robustness of trigonometric interpolation. The performance of Lasso trigonometric interpolation for several testing functions (sin wave, triangular wave, sawtooth wave, square wave), is illustrated with numerical examples, with or without the presence of data errors.
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.
