10 research outputs found
The second Zolotarev case in the Erdös-Szegö solution to a Markov-type extremal problem of Schur
Schur's [20] Markov-type extremal problem is to determine (i) , where and is an algebraic polynomial of degree . Erdos and Szego [4] found that for this maximum is attained if and is a (unspecified) member of the one-parameter family of hard-core Zolotarev polynomials. An extremal such polynomial as well as the constant we have explicitly specified for in [17], and in this paper we strive to obtain an analogous amendment to the Erdos-Szego solution for . The cases still remain arcane.
Our approach is based on the quite recently discovered explicit algebraic power form representation [6], [7] of the quintic hard-core Zolotarev polynomial, , to which we add here explicit descriptions of its critical points, the explicit form of Pell's (aka: Abel's) equation, as well as an alternative proof for the range of the parameter, . The optimal which yields we identify as the negative zero with smallest modulus of a minimal . We then turn to an extension of (i), to higher derivatives as proposed by Shadrin [22], and we provide an analogous solution for . Finally, we describe, again for , two new algebraic approaches towards a solution to Zolotarev's so-called first problem [2], [24] which was originally solved by means of elliptic functions
Explicit algebraic solution of Zolotarev's First Problem for low-degree polynomials
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 and for a given , the monic polynomial solution to the following best approximation problem: Find
where the , vary in . It suffices to consider the cases .
In 1868 Zolotarev provided a transcendental solution for all in terms of elliptic functions. An explicit algebraic solution in power form to ZFP, as is suggested by the problem statement, is available only for
We have now obtained an explicit algebraic solution to ZFP for in terms of roots of dedicated polynomials.
In this paper, we provide our findings for in two alternative fashions, accompanied by concrete examples. The cases we treat, due to their bulkiness, in a separate web repository.
Added in proof: But see our recent one-parameter power form solution for in [38]
On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation
ACM Computing Classification System (1998): G.1.1, G.1.2.We consider optimal Lagrange interpolation with polynomials
of degree at most two on the unit interval [−1, 1]. In a largely unknown
paper, Schurer (1974, Stud. Sci. Math. Hung. 9, 77-79) has analytically
described the infinitely many zero-symmetric and zero-asymmetric extremal
node systems −1 ≤ x1 < x2 < x3 ≤ 1 which all lead to the minimal Lebesgue
constant 1.25 that had already been determined by Bernstein (1931, Izv.
Akad. Nauk SSSR 7, 1025-1050). As Schurer’s proof is not given in full
detail, we formally verify it by providing two new and sound proofs of his
theorem with the aid of symbolic computation using quantifier elimination.
Additionally, we provide an alternative, but equivalent, parameterized
description of the extremal node systems for quadratic Lagrange interpolation
which seems to be novel. It is our purpose to bring the computer-assisted
solution of the first nontrivial case of optimal Lagrange interpolation to wider
attention and to stimulate research of the higher-degree cases. This is why
our style of writing is expository
Explicit algebraic solution of Zolotarev's First Problem for low-degree polynomials
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 and for a given , the monic polynomial solution to the following best approximation problem: Find
where the , vary in . It suffices to consider the cases .
In 1868 Zolotarev provided a transcendental solution for all in terms of elliptic functions. An explicit algebraic solution in power form to ZFP, as is suggested by the problem statement, is available only for
We have now obtained an explicit algebraic solution to ZFP for in terms of roots of dedicated polynomials.
In this paper, we provide our findings for in two alternative fashions, accompanied by concrete examples. The cases we treat, due to their bulkiness, in a separate web repository.
Added in proof: But see our recent one-parameter power form solution for in [38]
The numerical stability of evaluation schemes for polynomials based on the lagrange interpolation form
Confirmation of the topology of the Wendelstein 7-X magnetic field to better than 1:100,000
Fusion energy research has in the past 40 years focused primarily on the tokamak concept, but recent advances in plasma theory and computational power have led to renewed interest in stellarators. The largest and most sophisticated stellarator in the world, Wendelstein 7-X (W7-X), has just started operation, with the aim to show that the earlier weaknesses of this concept have been addressed successfully, and that the intrinsic advantages of the concept persist, also at plasma parameters approaching those of a future fusion power plant. Here we show the first physics results, obtained before plasma operation: that the carefully tailored topology of nested magnetic surfaces needed for good confinement is realized, and that the measured deviations are smaller than one part in 100,000. This is a significant step forward in stellarator research, since it shows that the complicated and delicate magnetic topology can be created and verified with the required accuracy