Approximating a norm by a polynomial
Let \((V,\|\cdot\|)\) be a finite-dimensional real normal space. The answer to the question: Given a point \(x\in V\), how fast can one compute or approximate \(\| x\|\)? is given by the following main theorem of this paper: Theorem 1.1. Let \(V\) be a \(d\)-dimensional real vector space and let \(\|\cdot\|: V\to \mathbb{R}\) be a norm in \(V\). For any odd integer \(n\) there exists a homogeneous polynomial \(p: V\to\mathbb{R}\) of degree \(2n\) such that \(p(x)> 0\) (in fact, \(p\) is the sum of squares of homogeneous polynomials of degree \(n\)), and \[ p^{{1\over 2n}}(x)\leq\| x\|\leq\begin{pmatrix} n+d-1\\ n\end{pmatrix}^{{1\over 2n}} p^{{1\over 2n}}(x) \] for all \(x\in V\). The author proves Theorem 1.1 in Section 3. In Section 2, some corollaries to Theorem 1.1 are discussed and in Section 1 the author shows how to extend Theorem 1.1 to Minkowski functionals of arbitrary convex bodies. For the entire collection see [Zbl 1009.00019].
- scientific article; zbMATH DE number 3306938
- scientific article; zbMATH DE number 3875919
- Approximation by polynomials
- Polynomial norms
- Approximation in the mean by polynomials
- Approximation in the mean by polynomials
- scientific article; zbMATH DE number 1306933
- scientific article; zbMATH DE number 4067511
- Norm attaining polynomials
- On a polynomial approximation problem
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- On norm attaining polynomials.
- Norm or numerical radius attaining polynomials on \(C(K\))
- Non-laminate microstructures in monoclinic-I martensite
- The norm of a skew polynomial
- Semidefinite Approximation of Closed Convex Set
- Polynomial norms
This page was built for publication: Approximating a norm by a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4424437)
