An Extension of Chebfun to Two Dimensions
From MaRDI portal
Publication:5404635
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)
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
Cited in
(55)- A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions
- Solving partial differential problems with \textsf{Tau Toolbox}
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations
- Low rank approximation in the computation of first kind integral equations with TauToolbox
- Multivariate rational approximation of functions with curves of singularities
- Computing with functions in spherical and polar geometries. II: The disk
- Computing Spectral Measures of Self-Adjoint Operators
- Piecewise-smooth chebfuns
- A numerical study of divergence-free kernel approximations
- Fast algorithms using orthogonal polynomials
- Extension of Chebfun to periodic functions
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- Fast global optimization on the torus, the sphere, and the rotation group
- Roots of bivariate polynomial systems via determinantal representations
- Turing-Hopf patterns on growing domains: the torus and the sphere
- Cubature, approximation, and isotropy in the hypercube
- Polynomial solution of Cauchy-type singular integro-differential equations with bivariate kernels
- Computing the common zeros of two bivariate functions via Bézout resultants
- Pluripotential numerics
- Operator learning using random features: a tool for scientific computing
- Chebfun in Three Dimensions
- Rank-Structured QR for Chebyshev Rootfinding
- Computing with functions in spherical and polar geometries. I. The sphere
- Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
- A fast Chebyshev method for the Bingham closure with application to active nematic suspensions
- On well-conditioned spectral collocation and spectral methods by the integral reformulation
- A continuous analogue of the tensor-train decomposition
- Computing with functions in the ball
- The automatic solution of partial differential equations using a global spectral method
- Functional Tucker approximation using Chebyshev interpolation
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
- Tensor train-Karhunen-Loève expansion: new theoretical and algorithmic frameworks for representing general non-Gaussian random fields
- A note on total degree polynomial optimization by Chebyshev grids
- Numerical instability of resultant methods for multidimensional rootfinding
- Influence of curvature, growth, and anisotropy on the evolution of Turing patterns on growing manifolds
- Approximation in the extended functional tensor train format
- Chebfun2
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Improved error bound for multivariate Chebyshev polynomial interpolation
- Chebyshev model arithmetic for factorable functions
- An algorithm for low-rank approximation of bivariate functions using splines
- Approximation of sign-regular kernels
- Factorized structure of the long-range two-electron integrals tensor and its application in quantum chemistry
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- A fast and well-conditioned spectral method for singular integral equations
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems
- Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
- Solving rank-structured Sylvester and Lyapunov equations
- Polynomials with bounds and numerical approximation
- Chebfun and numerical quadrature
- Turing conditions for pattern forming systems on evolving manifolds
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake
- Solution of ill-posed problems with Chebfun
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)
