Chebfun2

swMATH12708MaRDI QIDQ24634FDOQ24634

Author name not available (Why is that?)

Described by source

• An Extension of Chebfun to Two Dimensions

Cited In (43)

• Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
• Numerical solution of bivariate and polyanalytic polynomial systems
• 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
• Cubature, approximation, and isotropy in the hypercube
• Computing the common zeros of two bivariate functions via Bézout resultants
• Polynomials with bounds and numerical approximation
• Fast global optimization on the torus, the sphere, and the rotation group
• The automatic solution of partial differential equations using a global spectral method
• 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
• Solving transcendental equations. The Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
• 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
• 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
• 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
• 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
• 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

This page was built for software: Chebfun2