An Extension of Chebfun to Two Dimensions
DOI10.1137/130908002zbMath1300.65010OpenAlexW2025485823WikidataQ56532695 ScholiaQ56532695MaRDI QIDQ5404635
Alex Townsend, Lloyd N. Threfethen
Publication date: 28 March 2014
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130908002
global optimizationiterative algorithmChebyshev polynomialssingular value decompositionGaussian eliminationlow rank approximationvector calculusroot finding\texttt{Matlab}\texttt{Chebfun}
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Numerical interpolation (65D05) Numerical computation of solutions to single equations (65H05) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)
Related Items
Uses Software
This page was built for publication: An Extension of Chebfun to Two Dimensions