The following pages link to (Q3707259):
Displaying 23 items.
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Orthogonal polynomials and Gaussian quadrature for refinable weight functions (Q704214) (← links)
- Newton interpolation at Leja points (Q915343) (← links)
- On the numerical condition of algebraic curves and surfaces. I: Implicit equations (Q921853) (← links)
- Orthogonal polynomials - Constructive theory and applications (Q1069264) (← links)
- On the numerical condition of polynomials in Bernstein form (Q1098225) (← links)
- Algorithms for polynomials in Bernstein form (Q1105314) (← links)
- Computing with barycentric polynomials (Q1181866) (← links)
- Are the coefficients of a polynomial well-conditioned functions of its roots? (Q1203402) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- On the sensitivity of orthogonal polynomials to perturbations in the moments (Q1819534) (← links)
- Modified moments for indefinite weight functions (Q1822655) (← links)
- Robust plotting of generalized lemniscates (Q1886267) (← links)
- The work of Philip Rabinowitz on numerical integration (Q1895869) (← links)
- Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes (Q2173347) (← links)
- A new robust line search technique based on Chebyshev polynomials (Q2378711) (← links)
- Sampling algebraic sets in local intrinsic coordinates (Q2429015) (← links)
- Orthogonal polynomials for refinable linear functionals (Q3420237) (← links)
- Estimates of Eigenvalues for Iterative Methods (Q3830410) (← links)
- Calculation of Gauss-Kronrod quadrature rules (Q4340861) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)
- Computation of Gauss-type quadrature formulas (Q5929298) (← links)
