Pages that link to "Item:Q1084833"
From MaRDI portal
The following pages link to On polynomial approximation in the uniform norm by the discrete least squares method (Q1084833):
Displaying 12 items.
- On the constrained mock-Chebyshev least-squares (Q484851) (← links)
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle (Q708286) (← links)
- Discretization for uniform polynomial approximation (Q788927) (← links)
- Newton interpolation at Leja points (Q915343) (← links)
- Uniform approximation by discrete least squares polynomials (Q927692) (← links)
- Gram polynomials and the Kummer function (Q1270292) (← links)
- A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials (Q1920185) (← links)
- Constrained mock-Chebyshev least squares quadrature (Q2171151) (← links)
- An arbitrary-order discontinuous Galerkin method with one unknown per element (Q2316218) (← links)
- (Q3406177) (← links)
- Mean-Square Approximation by Polynomials on the Unit Disk (Q3490254) (← links)
- Good point sets and corresponding weights for bivariate discrete least squares approximation (Q5355321) (← links)
