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
 
Guggenheimer, Heinrich
Polytechnic University
Farmingdale, New York
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 53 reviews

   
  Three-dimensional deformation using directional polar coordinates
Jin X., Li Y. Journal of Graphics Tools 5(2): 15-24, 2000.  Type: Article

The authors discuss existing methods of ray-tracing for non-tesselated nonuniform rational B-spline (NURBS) surfaces carefully and combine them into a detailed method for efficient execution. They have to be commended for making the so...

Sep 1 2001  
  Superconvergent interpolants for collocation methods applied to mixed-order BVODEs
Enright W., Sivasothinathan R. ACM Transactions on Mathematical Software 26(3): 323-351, 2000.  Type: Article

In the output of the software package COLNEW/COLSYS for separated boundary value problems of mixed-order systems of ordinary differential equations (ODEs), the approximation is of much higher precision at the Gauss points used for the ...

Jan 1 2001  
  Reduced Gro¨bner bases under composition
Gutierrez J., San Miguel R. Journal of Symbolic Computation 26(4): 433-444, 1998.  Type: Article

Composition of polynomials (replacing the variables of onepolynomial by other polynomials) is an important numerical technique inmany applications. H. Hong has shown [1] that compositions with a set&THgr; of polynomials commutes wi...

May 1 1999  
  Elements of applied bifurcation theory (2nd ed.)
Kuznetsov Y., Springer-Verlag New York, Inc., New York, NY, 1998.  Type: Book (9780387983820)

Bifurcation theory studies the behavior of parameter-dependent differential dynamical systems and parameter-dependent discrete-time dynamical systems when the parameters vary in the neighborhood of a parameter value at which the differ...

Apr 1 1999  
  Decomposing polynomial systems into simple systems
Wang D. (ed) Journal of Symbolic Computation 25(3): 295-314, 1998.  Type: Article

The preparation of systems of algebraic equations for effective solutions, using either Gröbner bases or Ritt characteristic sets, is notoriously difficult and time-consuming. In this paper, some ideas of J. M. Thomas [1] are ...

Feb 1 1999  
  Error guided design of a 3D vision system
Georgis N., Petrou M., Kittler J. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(4): 366-379, 1998.  Type: Article

The authors note that 3D vision systems are not practically usable if no estimates of errors and sensitivity are available. They consider the problem of describing the surface of a rectangular solid from two plane images and use projec...

Sep 1 1998  
  The switching-method in multiple shooting
Bellavia S., Macconi M., Morini B. Computing 60(3): 275-283, 1998.  Type: Article

In the shooting method for nonlinear boundary value problems of nonlinear differential equations with unique solutions, local integration is used to provide the data for a global (usually, damped) Newton approximation for a high-dimens...

Sep 1 1998  
  On testing a bivariate polynomial for analytic reducibility
McCallum S. Journal of Symbolic Computation 24(5): 509-535, 1997.  Type: Article

The author works out all the complicated details of a method of testing for the reducibility of a polynomial, first suggested by Kuo [1]. The notion of reducibility used here is in an algebraically closed field of formal power series. ...

Jun 1 1998  
  Chaos in electronics
van Wyk M., Steeb W., Kluwer Academic Publishers, Norwell, MA, 1997.  Type: Book (9780792345763)

Being more an encyclopedia than a textbook, this work will be most useful to people who want to learn what is known about this new field and where to find details. There are no exercises, but the bibliography contains 881 items. The in...

May 1 1998  
  The equational logic of fixed points
Bloom S., Ésik Z. Theoretical Computer Science 179(1-2): 1-60, 1997.  Type: Article

The authors survey the category of partially ordered sets in which each partially ordered subset has a least upper bound. No proofs are given. They state that every endomorphism f (or every order-preserving map of a ...

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