Cited in
(42)- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Multivariate polynomial interpolation on Lissajous-Chebyshev nodes
- CHEBINT, a MATLAB/Octave toolbox for fast multivariate integration and interpolation based on Chebyshev approximations over hypercubes
- Accurate polynomial interpolation by using the Bernstein basis
- Kernel-based approximation methods using MATLAB
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Cubature formulae for nearly singular and highly oscillating integrals
- Polynomial approximation on Lissajous curves in the \(d\)-cube
- Bivariate Lagrange interpolation at the node points of non-degenerate Lissajous curves
- Padua points and ``fake nodes for polynomial approximation: old, new and open problems
- Sum-of-squares optimization without semidefinite programming
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Nontensorial Clenshaw-Curtis cubature
- Padua2DM
- Hyper2d
- DECUHR
- Algorithm 792
- CHEBINT
- FIST
- TSFIT
- adsimp
- SOSOPT
- Burkardt
- WAM
- GpoSolver
- POLYNOMIAL
- TNTool
- GaussQR
- HyperCube
- LEBFEK
- LC3Ditp
- LD3Ditp
- LS2Ditp
- FakeNodes
- Sparse-BSOS
- XuPad2D
- A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
- Bivariate Lagrange interpolation at the Padua points: Computational aspects
- On the computation of sets of points with low Lebesgue constant on the unit disk
- Bivariate Lagrange interpolation at the node points of Lissajous curves -- the degenerate case
- Computing Fekete and Lebesgue points: Simplex, square, disk
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
This page was built for software: Padua2D
