An Extension of Chebfun to Two Dimensions
DOI10.1137/130908002zbMATH Open1300.65010DBLPjournals/siamsc/TownsendT13OpenAlexW2025485823WikidataQ56532695 ScholiaQ56532695MaRDI QIDQ5404635FDOQ5404635
Authors: Alex Townsend, Lloyd N. Trefethen 
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
Recommendations
- An Extension of MATLAB to Continuous Functions and Operators
- The chebop system for automatic solution of differential equations
- Chebfun and numerical quadrature
- Chebfun in Three Dimensions
- \texttt{Chebfun}: A new kind of numerical computing
- Computing with functions in the ball
- Automatic Fréchet differentiation for the numerical solution of boundary-value problems
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- On the spectral problem for trivariate functions
- Automatic spectral collocation for integral, integro-differential, and integrally reformulated differential equations
Gaussian eliminationiterative algorithmlow rank approximationglobal optimizationsingular value decompositionChebyshev polynomialsvector calculusroot finding\texttt{Matlab}\texttt{Chebfun}
Numerical mathematical programming methods (65K05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical interpolation (65D05) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Numerical computation of solutions to single equations (65H05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (55)
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
- A note on total degree polynomial optimization by Chebyshev grids
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Cubature, approximation, and isotropy in the hypercube
- Factorized structure of the long-range two-electron integrals tensor and its application in quantum chemistry
- Computing the common zeros of two bivariate functions via Bézout resultants
- Polynomials with bounds and numerical approximation
- Polynomial solution of Cauchy-type singular integro-differential equations with bivariate kernels
- Operator learning using random features: a tool for scientific computing
- Fast global optimization on the torus, the sphere, and the rotation group
- The automatic solution of partial differential equations using a global spectral method
- Approximation in the extended functional tensor train format
- Computing with functions in spherical and polar geometries. II: The disk
- Computing with functions in the ball
- A continuous analogue of the tensor-train decomposition
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake
- A fast Chebyshev method for the Bingham closure with application to active nematic suspensions
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- Numerical instability of resultant methods for multidimensional rootfinding
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- An algorithm for low-rank approximation of bivariate functions using splines
- Turing conditions for pattern forming systems on evolving manifolds
- Chebfun2
- Tensor train-Karhunen-Loève expansion: new theoretical and algorithmic frameworks for representing general non-Gaussian random fields
- Improved error bound for multivariate Chebyshev polynomial interpolation
- Chebyshev model arithmetic for factorable functions
- Piecewise-smooth chebfuns
- Fast algorithms using orthogonal polynomials
- Roots of bivariate polynomial systems via determinantal representations
- Rank-Structured QR for Chebyshev Rootfinding
- Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
- Chebfun and numerical quadrature
- A fast and well-conditioned spectral method for singular integral equations
- A numerical study of divergence-free kernel approximations
- Functional Tucker approximation using Chebyshev interpolation
- On well-conditioned spectral collocation and spectral methods by the integral reformulation
- Approximation of sign-regular kernels
- Solution of ill-posed problems with Chebfun
- Computing Spectral Measures of Self-Adjoint Operators
- Turing-Hopf patterns on growing domains: the torus and the sphere
- Pluripotential numerics
- Extension of Chebfun to periodic functions
- Chebfun in Three Dimensions
- Computing with functions in spherical and polar geometries. I. The sphere
- Influence of curvature, growth, and anisotropy on the evolution of Turing patterns on growing manifolds
- Solving rank-structured Sylvester and Lyapunov equations
- Low rank approximation in the computation of first kind integral equations with TauToolbox
- A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions
- Solving partial differential problems with \textsf{Tau Toolbox}
- Multivariate rational approximation of functions with curves of singularities
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations
Uses Software
This page was built for publication: An Extension of Chebfun to Two Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404635)
