618 research outputs found
On the constrained mock-Chebyshev least-squares
The algebraic polynomial interpolation on uniformly distributed nodes is
affected by the Runge phenomenon, also when the function to be interpolated is
analytic. Among all techniques that have been proposed to defeat this
phenomenon, there is the mock-Chebyshev interpolation which is an interpolation
made on a subset of the given nodes whose elements mimic as well as possible
the Chebyshev-Lobatto points. In this work we use the simultaneous
approximation theory to combine the previous technique with a polynomial
regression in order to increase the accuracy of the approximation of a given
analytic function. We give indications on how to select the degree of the
simultaneous regression in order to obtain polynomial approximant good in the
uniform norm and provide a sufficient condition to improve, in that norm, the
accuracy of the mock-Chebyshev interpolation with a simultaneous regression.
Numerical results are provided.Comment: 17 pages, 9 figure
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A ``hybrid method'', dedicated to asymptotic coefficient extraction in
combinatorial generating functions, is presented, which combines Darboux's
method and singularity analysis theory. This hybrid method applies to functions
that remain of moderate growth near the unit circle and satisfy suitable
smoothness assumptions--this, even in the case when the unit circle is a
natural boundary. A prime application is to coefficients of several types of
infinite product generating functions, for which full asymptotic expansions
(involving periodic fluctuations at higher orders) can be derived. Examples
relative to permutations, trees, and polynomials over finite fields are treated
in this way.Comment: 31 page
- …