Results 1 to 10 of about 308,417 (136)

Polynomials of Least Deviation from Zero in Sobolev p-Norm [PDF]

open access: yesBulletin of the Malaysian Mathematical Sciences Society, 2022
AbstractThe first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev p-norm ($$1<p<\infty $$ 1 < p < ∞ ) for the ...
Abel Díaz-González   +2 more
exaly   +5 more sources

POLYNOMIALS LEAST DEVIATING FROM ZERO IN \(L^p(-1;1)\), \(0 \le p \le \infty \), WITH A CONSTRAINT ON THE LOCATION OF THEIR ROOTS [PDF]

open access: yesUral Mathematical Journal, 2023
We study Chebyshev's problem on polynomials that deviate least from zero with respect to \(L^p\)-means on the interval \([-1;1]\) with a constraint on the location of roots of polynomials.
Alena E. Rokina
doaj   +3 more sources

Trigonometric polynomials of least deviation from zero in measure and related problems

open access: yesJournal of Approximation Theory, 2010
Let \(\mathcal{F}_{n}\) be the set of trigonometric polynomials \[ f_{n}(t)=\frac{a_{0}}{2}+\sum_{k=1}^{n}(a_{k}\cos kt +b_{k}\sin k t) \] of order \(n\geq 0\) with real coefficients. On the set \(\mathcal{F}_{n}\) consider the functional \[ \mu(f_{n})=\text{mes}\{t\in \mathbb{T}\,:\,|f_{n}(t)|\geq 1\}, \] where \(\text{mes}\) stands for the Lebesgue ...
V V Arestov
exaly   +3 more sources

Least deviation of logarithmic derivatives of algebraic polynomials from zero

open access: yesJournal of Approximation Theory, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petr Chunaev
exaly   +3 more sources

On multivariate polynomials of least deviation from zero on the unit ball

open access: yesMathematische Zeitschrift, 1977
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reimer Manfred
exaly   +4 more sources

On multivariate polynomials of least deviation from zero on the unit cube

open access: yesJournal of Approximation Theory, 1978
AbstractIn the family of all r-variable real polynomials with total degree not exceeding μ and with maximum norm on the unit-cube not exceeding 1, any of the leading coefficients is maximum for a special product of one-variable Chebyshev polynomials of the first kind.
exaly   +3 more sources

Explicit algebraic solution of Zolotarev's First Problem for low-degree polynomials

open access: yesJournal of Numerical Analysis and Approximation Theory, 2019
E.I. Zolotarev's classical so-called First Problem (ZFP), which was posed to him by P.L. Chebyshev, is to determine, for a given \(n\in{\mathbb N}\backslash\{1\}\) and for a given \(s\in{\mathbb R}\backslash\{0\}\), the monic polynomial solution \(Z ...
Heinz Joachim Rack, Robert Vajda
doaj   +7 more sources

Short-Arc Horizon-Based Optical Navigation by Total Least-Squares Estimation

open access: yesAerospace, 2023
Horizon-based optical navigation (OPNAV) is an attractive solution for deep space exploration missions, with strong autonomy and high accuracy. In some scenarios, especially those with large variations in spacecraft distance from celestial bodies, the ...
Huajian Deng   +3 more
doaj   +1 more source

Interaction between decision-making and motor learning when selecting reach targets in the presence of bias and noise.

open access: yesPLoS Computational Biology, 2023
Motor errors can have both bias and noise components. Bias can be compensated for by adaptation and, in tasks in which the magnitude of noise varies across the environment, noise can be reduced by identifying and then acting in less noisy regions of the ...
Tianyao Zhu   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy