| |
 |
|
|
Plemmons, Robert
Wake Forest University
Winston-Salem, North Carolina
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 17
reviews
|
|
|
|
|
|
|
|
Local scale control for edge detection and blur estimation
Elder J., Zucker S. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(7): 699-716, 1998. Type: Article
In this seminal paper on new approaches to edge detection and blur estimation for natural images, the authors use local scale control techniques, which have clear advantages over the standard techniques based on a model of edges as lar...
|
Apr 1 1999 |
|
|
|
|
|
|
Cosmology of the early universe viewed through the new infrastructure
Ostriker J., Norman M. Communications of the ACM 40(11): 84-94, 1997. Type: Article
The ultimate goal of (physical) cosmology is to understand the mechanisms that led to the structure and evolution of the universe. Cosmologists seek to discover the physical composition of the universe and the principles that establish...
|
Jun 1 1998 |
|
|
|
|
|
|
LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
Kågström B., Poromaa P. ACM Transactions on Mathematical Software 22(1): 78-103, 1996. Type: Article
The authors discuss software development for some specialized computations in numerical linear algebra. Specifically, block matrix (level 3 BLAS, as in LAPACK codes) algorithms are implemented for solving generalized Sylvester equation...
|
Feb 1 1997 |
|
|
|
|
|
|
Sparse approximate solutions to linear systems
Natarajan B. SIAM Journal on Computing 24(2): 227-234, 1995. Type: Article
Natarajan studies a greedy algorithm for computing an approximate solution x to a linear system A x = b, where x contains a minimal number of non-zero entries. The greedy algorithm considered is a merging of...
|
Jul 1 1996 |
|
|
|
|
|
|
A new algorithm for the evaluation of the incomplete gamma function on vector computers
Früchtl H., Otto P. ACM Transactions on Mathematical Software 20(4): 436-446, 1994. Type: Article
Früchtl and Otto describe quantum chemical computations on vector computers, such as a Cray or Convex architecture. The authors have adapted an approximation scheme by Schaad and Morrell for the incomplete gamma function to th...
|
Nov 1 1995 |
|
|
|
|
|
|
A parallel block implementation of Level-3 BLAS for MIMD vector processors
Daydé M., Duff I., Petitet A. ACM Transactions on Mathematical Software 20(2): 178-193, 1994. Type: Article, Reviews: (2 of 2)
Level-3 BLAS (Basic Linear Algebra Subprograms)consists of a set of computational kernels for matrix-matrix operations.Their purpose is to provide efficient and portable implementations ofdense matrix computations on vector and paralle...
|
May 1 1995 |
|
|
|
|
|
|
Solution of the Sylvester matrix equation AXBT + CXDT = E
Gardiner J., Laub A. (ed), Amato J., Moler C. ACM Transactions on Mathematical Software 18(2): 223-231, 1992. Type: Article
The authors have developed an efficient algorithm and software system for solving Sylvester-type matrix equations of the form AXB T + CXD T = E for X. This problem arises in c...
|
Nov 1 1993 |
|
|
|
|
|
|
FORTRAN subroutines for general Toeplitz systems
Hansen P., Chan T. ACM Transactions on Mathematical Software 18(3): 256-273, 1992. Type: Article
Some FORTRAN 77 implementations of direct algorithms are given for solving systems of linear equations where the coefficient matrix T is Toeplitz. Such systems arise in a variety of applications, especially in signal...
|
Jul 1 1993 |
|
|
|
|
|
|
On the computation of a matrix inverse square root
Sherif N. Computing 46(4): 295-305, 1991. Type: Article
Given an n -by- n nonsingular matrix A, the solution to X 2 A = I is called an inverse square root of A and is denoted by
|
Feb 1 1993 |
|
|
|
|
|
|
The inverses of block Hankel and block Toeplitz matrices
Labahn G., Chio D., Cabay S. SIAM Journal on Computing 19(1): 98-123, 1990. Type: Article
The primary contribution of this paper is a set of closed formulas for inverses of block Hankel matrices H. These formulas have the advantage of requiring only that H itself be nonsingular. Many fast algorithms for comput...
|
Nov 1 1991 |
|
|
|
|
|
| |
|
|
| |
|
|
