ACM DL

Mathematical Software (TOMS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Mathematical Software (TOMS), Volume 22 Issue 1, March 1996

Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package
R. J. Renka
Pages: 1-8
DOI: 10.1145/225545.225546
TRIPACK is a Fortran 77 software package that employs an incremental algorithm to construct a constrained Delaunay traingulation of a set of points in the plane (nodes). The triangulation covers the convex hull of the nodes but may include...

Algorithm 752: SRFPACK: software for scattered data fitting with a constrained surface under tension
R. J. Renka
Pages: 9-17
DOI: 10.1145/225545.225547
SRFPACK is a Fortran 77 software package that constructs a smooth interpolatory or approximating surface to data values associated with arbitrarily distributed points in the plane. It employs automatically selected tension factors to preserve...

Efficient vector and parallel manipulation of tensor products
Paul E. Buis, Wayne R. Dyksen
Pages: 18-23
DOI: 10.1145/225545.225548

We present efficient vector and parallel methods for manipulating tensor products of matrices. We consider both computing the matrix-vector product (A1ļ...

Algorithm 753: TENPACK: a LAPACK-based library for the computer manipulation of tensor products
Paul E. Buis, Wayne R. Dyksen
Pages: 24-29
DOI: 10.1145/225545.225549
This article presents the interface of an implementation of methods to manipulate equations of this form A1⊗&cdots;⊗Am where the ...

The design of a new frontal code for solving sparse, unsymmetric systems
I. S. Duff, J. A. Scott
Pages: 30-45
DOI: 10.1145/225545.225550
We describe the design, implementation, and performance of a frontal code for the solution of large, sparse, unsymmetric systems of linear equations. The resulting software package, MA42, is included in Release 11 of the Harwell Subroutine...

QMRPACK: a package of QMR algorithms
Roland W. Freund, Noël M. Nachtigal
Pages: 46-77
DOI: 10.1145/225545.225551
The quasi-minimal residual (QMR) algorithm is a Krylov-subspace method for the iterative solution of large non-Hermitian linear systems. QMR is based on the look-ahead Lanczos algorithm that, by itself, can also be used to obtain approximate...

LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
Bo Kågström, Peter Poromaa
Pages: 78-103
DOI: 10.1145/225545.225552
Robust and fast software to solve the generalized Sylvester equation (AR - LB = C, DR - LE = F) for unknowns R and L is presented. This special linear system of equations, and its transpose,...

Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
Mauricio G. C. Resende, Panos M. Pardalos, Yong Li
Pages: 104-118
DOI: 10.1145/225545.225553
In the NP-complete quadratic assignment problem (QAP), n facilities are to be assigned to n sites at minimum cost. The contribution of assigning facility i to site k and...

Fast pseudorandom generators for normal and exponential variates
C. S. Wallace
Pages: 119-127
DOI: 10.1145/225545.225554
Fast algorithms for generating pseudorandom numbers from the unit-normal and unit-exponential distributions are described. The methods are unusual in that they do not rely on a source of uniform random numbers, but generate the target...