Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Recurrences And Difference Equations (G.2.1...)  
 
Options:
 
  1-10 of 10 Reviews about "Recurrences And Difference Equations (G.2.1...)": Date Reviewed
  Numerically satisfactory solutions of Kummer recurrence relations
Segura J., Temme N. Numerische Mathematik 111(1): 109-119, 2008.  Type: Article

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 sol...

Mar 19 2009
  Difference equations: from rabbits to chaos (Undergraduate Texts in Mathematics)
Cull P., Flahive M., Robson R., Springer-Verlag New York, Inc., Secaucus, NJ, 2005. 394 pp.  Type: Book (9780387232348)

Difference equations appear naturally in many fields of science and engineering. This book presents, in a systematic way, some general tools for handling difference equations....

Mar 24 2006
  Completely iterative algebras and completely iterative monads
Milius S. Information and Computation 196(1): 1-41, 2005.  Type: Article

The seminal work of Calvin Elgot on iteration theories, done in the mid 1970s, never received the full recognition it deserved, probably because of its high degree of abstraction and complexity. In this paper, the author studies comple...

Jun 1 2005
  Efficient multiply-with-carry random number generators with maximal period
Goresky M., Klapper A. ACM Transactions on Modeling and Computer Simulation 13(4): 310-321, 2003.  Type: Article

A pseudorandom number generator for high-speed simulation and Monte Carlo integration should have an enormous period, exhibit uniform distribution of d-tuples and a good structure in high dimensions, and be efficiently computable. In t...

Jan 15 2004
  The Pell sequence
Ayoub A. Mathematics and Computer Education 36(1): 5-12, 2002.  Type: Article

This paper addresses the elementary properties of the Pell sequence an, which is defined by the initial terms a0 = 0, a1 = 1, and by the recursion an+...

Jun 12 2003
  Discrete dynamical systems: theory and applications
Sandefur J., Clarendon Press, New York, NY, 1990.  Type: Book (9780198533849)

Designed for students with a background in calculus and linear algebra, this text starts at an elementary level and gradually adds more complex topics; the entire book is written in a style suitable for intermediate students, however. ...

Jul 1 1991
  Unique extrapolation of polynomial recurrences
Lagarias J., Reeds J. SIAM Journal on Computing 17(2): 342-362, 1988.  Type: Article

Let A be a commutative ring with unit k ≥ 1 an integer. Let T : A k → A k be defined by
T ( x 1...
Aug 1 1989
  Exact balancing is not always good
Snir M. Information Processing Letters 22(2): 97-102, 1986.  Type: Article

The author studies the following recurrence relation:...

Dec 1 1986
  An efficient formula for linear recurrences
Fiduccia C. SIAM Journal on Computing 14(1): 106-112, 1985.  Type: Article

Given a K-term constant-coefficient linear recurrence for F i, the nth solution F n can be computed in any ring supporting a fast Fourier...

Oct 1 1985
  Magma2: a language oriented toward experiments in control
Turini F. ACM Transactions on Programming Languages and Systems 6(4): 468-486, 1984.  Type: Article

Periodically, it is claimed that research in programming languages is now terminated, and that nothing new can be invented after completion of the design of the ultimate language X. Replace X with ADA, C, PROLOG, LOGO, Functional Progr...

Jun 1 1985
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy