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
 
Kincaid, David
University of Texas at Austin
Austin, Texas
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 14 reviews

   
  Stability of the Gauss-Huard algorithm with partial pivoting
Dekker T., Hoffmann W., Potma K. Computing 58(3): 225-244, 1997.  Type: Article

The Gauss-Huard algorithm is a variant of the Gauss-Jordan algorithm for solving dense linear systems. Both algorithms reduce the system to an equivalent diagonal system. However, the Gauss-Jordan method does more floating-point operat...

Apr 1 1998  
  A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Berman P., Lingas A. Theoretical Computer Science 174(1-2): 193-202, 1997.  Type: Article

The Voronoi diagram and its dual, the Delaunay triangulation, are fundamental structures in computational geometry, so it is natural to seek efficient parallel algorithms in special site configurations. This paper obtains a nearly work...

Apr 1 1998  
  An optimal O(log log N)-time parallel algorithm for detecting all squares in a string
Apostolico A. (ed), Breslauer D. SIAM Journal on Computing 25(6): 1318-1331, 1996.  Type: Article

A concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that it is the fastest possible algorithm over general alphabets, with optimal O ( l...

Oct 1 1997  
  Numerical algorithms with C
Engeln-Müllges G., Uhlig F., Springer-Verlag New York, Inc., New York, NY, 1996.  Type: Book (9783540605300)

The origins of this book date back more than 20 years, to classes in numerical analysis taught at a German technical university. Engeln-Müllges and the late Fritz Reutter produced the first edition in 1974. Over the years, sev...

May 1 1997  
  Algorithm 747: a Fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback
Miminis G., Roth H. ACM Transactions on Mathematical Software 21(3): 299-326, 1995.  Type: Article

The authors briefly describe an algorithm for the computation of a state feedback for multi-input linear systems resulting in a closed-loop matrix with a specified self-conjugate set of eigenvalues. “The computation uses only...

Oct 1 1996  
  Not all insertion methods yield constant approximate tours in the Euclidean plane
Bafna V., Kalyanasundaram B., Pruhs K. Theoretical Computer Science 125(2): 345-353, 1994.  Type: Article

An insertion heuristic for the traveling salesman problem adds cities iteratively to an existing tour by replacing one edge with a two-edge path through the new city in the cheapest possible way. In 1977, Rosenkrantz, Stearns, and Lewi...

Jun 1 1995  
  Concurrent scientific computing
van de Velde E., Springer-Verlag New York, Inc., New York, NY, 1994.  Type: Book (9780387941950)

Derived from lectures given since 1988 in a course on “Concurrent Scientific Computing” at the California Institute of Technology, this book uses a stepwise refinement approach to developing parallel computer progra...

Feb 1 1995  
  Fast and efficient parallel solution of sparse linear systems
Pan V., Reif J. SIAM Journal on Computing 22(6): 1227-1250, 1993.  Type: Article

A parallel algorithm is presented for the solution of a linear system A x = b with a sparse n × n symmetric positive definite matrix A utilizing properties of the graph...

Nov 1 1994  
  Efficient Tridiagonal Solvers on Multicomputers
Sun X., Zhang H., Ni L. IEEE Transactions on Computers 41(3): 286-296, 1992.  Type: Article

Based on a matrix partitioning matrix, three parallel algorithms for solving a tridiagonal system on multicomputers are discussed. All are based on the divide-and-conquer principle and designed for the situation in which the number of ...

Sep 1 1993  
  A comparison of adaptive refinement techniques for elliptic problems
Mitchell W. (ed) ACM Transactions on Mathematical Software 15(4): 326-347, 1989.  Type: Article

Mitchell presents results that compare several techniques for the adaptive refinement of triangulations of piecewise linear functions used with finite element methods. He briefly describes each method, thus giving a nice survey of the ...

Sep 1 1990  
 
 
 
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