Least pth Power Polynomials on a Real Finite Point Set
From MaRDI portal
Cited in
(13)- On the convergence of Polya's algorithm
- Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0<p<1\)
- Approximation in normed linear spaces
- Bilateral approximation and Cebysev systems
- Best approximation with respect to nearby norms
- On the conditioning of polynomial and rational forms
- The zeros of infrapolynomials with some prescribed coefficients
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- The evaluation of polynomials
- Polynomials of Best Approximation on a Real Finite Point Set. I
- Mean Approximation on an Interval for an Exponent Less Than One
- Best Approximations and Interpolating Functions
- On best p-norm approximation of discrete data by polynomials
This page was built for publication: Least pth Power Polynomials on a Real Finite Point Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5847345)