Rational Approximation and Coefficient Recovery

dc.contributor.advisorWilber, Heather
dc.contributor.authorDou, ShiLin
dc.date.accessioned2025-08-01T22:14:23Z
dc.date.issued2025-08-01
dc.date.submitted2025
dc.descriptionThesis (Master's)--University of Washington, 2025
dc.description.abstractWe present a new framework for recovering Chebyshev coefficients of non-periodic functions using rational approximation. Building on the AAA algorithm, we construct a type (m−1, m) rational approximant whose poles and residues can be efficiently computed. Using the change of variable x = cos θ, the approximant is transformed into a rational trigonometric function in θ, whose Fourier coefficients can be expressed as short exponential sums via Fourier inversion. Mapping back, these exponentials provide a reconstruction of the original function’s Chebyshev expansion.We demonstrate that our method (i) achieves high-accuracy Chebyshev coefficient recovery from both equally spaced and clustered data, (ii) outperforms classical polynomial-based approaches for functions exhibiting slow coefficient decay or singular behavior, and (iii) supports fundamental arithmetic operations and differentiation directly in the coefficient domain.
dc.embargo.lift2030-07-06T22:14:23Z
dc.embargo.termsRestrict to UW for 5 years -- then make Open Access
dc.format.mimetypeapplication/pdf
dc.identifier.otherDou_washington_0250O_28127.pdf
dc.identifier.urihttps://hdl.handle.net/1773/53366
dc.language.isoen_US
dc.rightsnone
dc.subjectApplied mathematics
dc.subject.otherApplied mathematics
dc.titleRational Approximation and Coefficient Recovery
dc.typeThesis

Files