Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Numerically satisfactory solutions of Kummer recurrence relations
Segura J., Temme N. Numerische Mathematik111 (1):109-119,2008.Type:Article
Date Reviewed: Mar 19 2009

Literature on Kummer and related three-term recurrence relations is sparse. Segura and Temme outline the contours of the field, fill in some unoccupied spaces, and extend the field by introducing two theorems regarding satisfactory solutions to families of Kummer relations.

The authors begin with a succinct discussion of Kummer recurrence relations and their interconnections with Hermite and Laguerre polynomials, and Bessel and Coulomb functions. They continue by noting that Perron’s theorem and Whittaker functions are central to their main result--the finding of minimal and dominant solutions in the complex plane. The introduction shows that these functions and theorems form a lattice, which the authors augment. Then, the authors present their main contribution: two theorems regarding satisfactory solutions to Kummer relations. One theorem treats cases where the second input parameter to a family of Kummer functions is equal to zero, and the other theorem applies when it is not. An appendix provides expansions of Kummer relations, when the second parameter approaches infinity.

This crisply written paper advances the area under discussion with focused precision. The paper would be more useful to nonspecialists if it suggested how the relations discussed could be used to solve problems.

Reviewer:  Marlin Thomas Review #: CR136604 (0911-1065)
Bookmark and Share
  Featured Reviewer  
 
Recurrences And Difference Equations (G.2.1 ... )
 
 
Computations On Discrete Structures (F.2.2 ... )
 
 
Modeling Methodologies (I.6.5 ... )
 
 
Numerical Algorithms (G.1.0 ... )
 
 
General (G.1.0 )
 
 
Model Development (I.6.5 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Recurrences And Difference Equations": Date
Discrete dynamical systems: theory and applications
Sandefur J., Clarendon Press, New York, NY, 1990. Type: Book (9780198533849)
Jul 1 1991
An efficient formula for linear recurrences
Fiduccia C. SIAM Journal on Computing 14(1): 106-112, 1985. Type: Article
Oct 1 1985
Unique extrapolation of polynomial recurrences
Lagarias J., Reeds J. SIAM Journal on Computing 17(2): 342-362, 1988. Type: Article
Aug 1 1989
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