Abstract
We present an algorithm for numerical computations involving trivariate functions in a three-dimensional rectangular parallelepiped in the context of Chebfun. Our scheme is based on low-rank representation through multivariate adaptive cross approximation. The component one-dimensional functions are represented by finite Chebyshev expansions, or trigonometric expansions in the periodic case. Numerical experiments show the power and convenience of Chebfun3 for problems such as function manipulation, differentiation, optimization, and integration, as well as for exploration of fundamental issues of multivariate approximation and low-rank compression.
Sign-in/Register to access full text options 
Free) 
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 call
