An Extension of Chebfun to Two Dimensions
DOI10.1137/130908002zbMath1300.65010WikidataQ56532695 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 optimization; iterative algorithm; Chebyshev polynomials; singular value decomposition; Gaussian elimination; low rank approximation; vector calculus; root finding; \texttt{Matlab}; \texttt{Chebfun}
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65K05: Numerical mathematical programming methods
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
65D05: Numerical interpolation
65H05: Numerical computation of solutions to single equations
41A10: Approximation by polynomials
65D15: Algorithms for approximation of functions
Related Items
Uses Software