Search ACM DL

Search Issue

enter search term and/or author name

**An improved incomplete Cholesky factorization**

Mark T. Jones, Paul E. Plassmann

Pages: 5-17

DOI: 10.1145/200979.200981

**Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations**

Mark T. Jones, Paul E. Plassmann

Pages: 18-19

DOI: 10.1145/200979.200986

**Algorithm 741: least-squares solution of a linear, bordered, block-diagonal system of equations**

Richard D. Ray

Pages: 20-25

DOI: 10.1145/200979.200987

**Fast floating-point processing in Common Lisp**

Richard J. Fateman, Kevin A. Broughan, Diane K. Willcock, Duane Rettig

Pages: 26-62

DOI: 10.1145/200979.200989

**A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization**

R. Baker Kearfott

Pages: 63-78

DOI: 10.1145/200979.200991

**Software distribution using Xnetlib**

Jack Dongarra, Tom Rowan, Reed Wade

Pages: 79-88

DOI: 10.1145/200979.200995

**Repository mirroring**

Eric Grosse

Pages: 89-97

DOI: 10.1145/200979.201000

**Algorithm 742: L2CXFT**: a Fortran subroutine for least-squares data fitting with nonnegative second divided differences

I. C. Demetriou

Pages: 98-110

DOI: 10.1145/200979.201039

**The accelerated integer GCD algorithm**

Kenneth Weber

Pages: 111-122

DOI: 10.1145/200979.201042

**CUTE**: constrained and unconstrained testing environment

I. Bongartz, A. R. Conn, Nick Gould, Ph. L. Toint

Pages: 123-160

DOI: 10.1145/200979.201043