An Extension of Chebfun to Two Dimensions

From MaRDI portal
Revision as of 01:48, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5404635

DOI10.1137/130908002zbMath1300.65010OpenAlexW2025485823WikidataQ56532695 ScholiaQ56532695MaRDI QIDQ5404635

Alex Townsend, Lloyd N. Threfethen

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




Related Items (44)

Improved error bound for multivariate Chebyshev polynomial interpolationFast algorithms using orthogonal polynomialsThe SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wakeA fast Chebyshev method for the Bingham closure with application to active nematic suspensionsAn algorithm for low-rank approximation of bivariate functions using splinesInfluence of curvature, growth, and anisotropy on the evolution of Turing patterns on growing manifoldsSolving Rank-Structured Sylvester and Lyapunov EquationsAn iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problemsFast algorithms for the multi-dimensional Jacobi polynomial transformChebyshev model arithmetic for factorable functionsPolynomials with bounds and numerical approximationCubature, Approximation, and Isotropy in the HypercubeTensor train-Karhunen-Loève expansion: new theoretical and algorithmic frameworks for representing general non-Gaussian random fieldsFactorized structure of the long-range two-electron integrals tensor and its application in quantum chemistryFast Global Optimization on the Torus, the Sphere, and the Rotation GroupVector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial ApproachChebfun in Three DimensionsTruncated normal forms for solving polynomial systems: generalized and efficient algorithmsSolution of ill-posed problems with ChebfunParallel cross interpolation for high-precision calculation of high-dimensional integralsComputing with Functions in the BallTuring conditions for pattern forming systems on evolving manifoldsPluripotential numericsLow-Rank Approximation in the Frobenius Norm by Column and Row Subset SelectionA numerical study of divergence-free kernel approximationsA continuous analogue of the tensor-train decompositionA fast and well-conditioned spectral method for singular integral equationsA note on total degree polynomial optimization by Chebyshev gridsComputing with Functions in Spherical and Polar Geometries I. The SphereNumerical Instability of Resultant Methods for Multidimensional RootfindingRoots of Bivariate Polynomial Systems via Determinantal RepresentationsThe automatic solution of partial differential equations using a global spectral methodComputing the common zeros of two bivariate functions via Bézout resultantsChebfun2On Well-Conditioned Spectral Collocation and Spectral Methods by the Integral ReformulationFast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured MatricesApproximation of sign-regular kernelsAn Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial ApproximationsFunctional Tucker Approximation Using Chebyshev InterpolationTuring-Hopf patterns on growing domains: the torus and the sphereRank-Structured QR for Chebyshev RootfindingComputing Spectral Measures of Self-Adjoint OperatorsJacobi-Davidson methods for polynomial two-parameter eigenvalue problemsComputing with Functions in Spherical and Polar Geometries II. The Disk


Uses Software



This page was built for publication: An Extension of Chebfun to Two Dimensions