Chebfun2
From MaRDI portal
Software:24634
No author found.
Related Items (43)
Improved error bound for multivariate Chebyshev polynomial interpolation ⋮ Fast algorithms using orthogonal polynomials ⋮ 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 algorithm for low-rank approximation of bivariate functions using splines ⋮ Influence of curvature, growth, and anisotropy on the evolution of Turing patterns on growing manifolds ⋮ Solving Rank-Structured Sylvester and Lyapunov Equations ⋮ Numerical Solution of Bivariate and Polyanalytic Polynomial Systems ⋮ Solving Transcendental Equations ⋮ 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 ⋮ Chebyshev model arithmetic for factorable functions ⋮ Polynomials with bounds and numerical approximation ⋮ Cubature, Approximation, and Isotropy in the Hypercube ⋮ Tensor train-Karhunen-Loève expansion: new theoretical and algorithmic frameworks for representing general non-Gaussian random fields ⋮ Fast Global Optimization on the Torus, the Sphere, and the Rotation Group ⋮ Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach ⋮ Chebfun in Three Dimensions ⋮ Truncated normal forms for solving polynomial systems: generalized and efficient algorithms ⋮ Solution of ill-posed problems with Chebfun ⋮ Computing with Functions in the Ball ⋮ Turing conditions for pattern forming systems on evolving manifolds ⋮ Pluripotential numerics ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ A numerical study of divergence-free kernel approximations ⋮ A continuous analogue of the tensor-train decomposition ⋮ A fast and well-conditioned spectral method for singular integral equations ⋮ A note on total degree polynomial optimization by Chebyshev grids ⋮ Computing with Functions in Spherical and Polar Geometries I. The Sphere ⋮ Numerical Instability of Resultant Methods for Multidimensional Rootfinding ⋮ Roots of Bivariate Polynomial Systems via Determinantal Representations ⋮ The automatic solution of partial differential equations using a global spectral method ⋮ Computing the common zeros of two bivariate functions via Bézout resultants ⋮ On Well-Conditioned Spectral Collocation and Spectral Methods by the Integral Reformulation ⋮ Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices ⋮ Approximation of sign-regular kernels ⋮ An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations ⋮ Functional Tucker Approximation Using Chebyshev Interpolation ⋮ Turing-Hopf patterns on growing domains: the torus and the sphere ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Computing Spectral Measures of Self-Adjoint Operators ⋮ Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems ⋮ Computing with Functions in Spherical and Polar Geometries II. The Disk
This page was built for software: Chebfun2
