Asymptotic expression of the linear discrete best _p-approximation
The authors prove an asymptotic expression of the linear discrete best \(\ell_p\) approximation of the element \(h\in\mathbb{R}^n-K\) \((h_p)\) from a proper affine subspace \(K\) of \(\mathbb{R}^n\) describing a linear relation between \(h_p\) and \(h^*_\infty\) where \(h^*_\infty\) denotes the strict uniform approximation of \(h\) from \(K\). More concretly the authors prove that there are a vector \(\alpha\in \mathbb{R}^n-\{0\}\) and a real number \(a\), \(0\leq a\leq 1\) such that \[ h_p=h^*_\infty+ \frac{a^p}{p-1}\alpha+\gamma_p \] for all \(p>1\), where \(\gamma_p\in\mathbb{R}^n\) with \(\|\gamma_p\|=0(\frac{a^p}{p})\).
- Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces
- On best p-approximation from affine subspaces: Asymptotic expansion
- scientific article; zbMATH DE number 125063
- Rate of convergence of the linear discrete Pólya 1-algorithm
- Rate of convergence of the linear discrete Pólya algorithm
- Approximations in L^p and Chebyshev Approximations
- Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces
- scientific article; zbMATH DE number 4205072 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- Rate of convergence of the discrete Pólya algorithm
- Rate of convergence of the linear discrete Pólya algorithm
- Tchebycheff approximation in a compact metric space
- The linear discrete Pólya algorithm
- The Pólya algorithm in sequence spaces
This page was built for publication: Asymptotic expression of the linear discrete best \(\ell_{p}\)-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497229)
