Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Asymptotics of the best constant in a certain Markov-type inequality
Dörfler P. Journal of Approximation Theory114 (1):84-97,2002.Type:Article
Date Reviewed: Mar 6 2003

This is an interesting and well-written paper on a highly theoretical subject: deriving an estimate for &ggr;n(&agr;), which is defined as follows: &ggr;n(&agr;) = sup{‖ p′ ‖/‖p ‖ for p in Pn}, where Pn is the set of all complex polynomials with degree not exceeding n, and ‖ . ‖ is the weighted L2-norm with Laguerre weight t&agr;e-t, for &agr; > -1.

Section 1 highlights the importance of the problem, and reviews existing results. The complementarity of past efforts is emphasized, and methods of work employed are commented on.

Section 2 presents the single contribution of this paper, a theorem stating that &ggr;n(&agr;)/n → (j(&agr;-1)/2)-1, as n → ∞, where jv is the first positive zero of the Bessel function of the first kind of order v.

Section 3 states and proves seven lemmas essential for “building” a proof for the theorem. These lemmas deal with various concepts, for example Pollaczek polynomials and Bessel functions, and thus may find application in other problems.

The paper concludes with an elegant proof of the new theorem, employing the given lemmas, as well as standard results from complex analysis.

In conclusion, this is a very well-structured paper, where the given proof is nicely divided into substantial lemmas. The author also includes many interesting remarks on the methodologies and methods/techniques employed (or not employed). This is an excellent example of how to write a good paper; I recommend it as reading material for all graduate students in the field of approximation theory.

Reviewer:  Nickolas S. Sapidis Review #: CR127015 (0306-0555)
Bookmark and Share
  Featured Reviewer  
 
Computations On Polynomials (F.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Computations On Polynomials": Date
Complexity of sentences over number rings
Tung S. SIAM Journal on Computing 20(1): 126-143, 1991. Type: Article
Sep 1 1991
On zero-testing and interpolation of -sparse multivariate polynomials over finite fields
Clausen M. (ed), Dress A., Grabmeier J., Karpinski M. (ed) Theoretical Computer Science 84(2): 151-164, 1991. Type: Article
Oct 1 1992
Lectures on the complexity of bilinear problems
de Groote H., Springer-Verlag New York, Inc., New York, NY, 1987. Type: Book (9789780387172057)
Mar 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy