ACM Transactions on Mathematical Software (TOMS), Volume 28

Volume 28, Number 1, March 2002

• Koen Engelborghs, Tatyana Luzyanina, Dirk Roose:
  Numerical bifurcation analysis of delay differential equations using DDE-BIFTOOL. 1-21
  
• Mark S. Gockenbach, Daniel R. Reynolds, Peng Shen, William W. Symes:
  Efficient and automatic implementation of the adjoint state method. 22-44
  
• Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller:
  An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. 45-58
  
• Tim Hopkins:
  Renovating the collected algorithms from ACM. 59-74
  
• Ian Robinson, Michael Hill:
  Algorithm 816: r2d2lri: an algorithm for automatic two-dimensional cubature. 75-100
  
• Enrico Bertolazzi, Gianmarco Manzini:
  Algorithm 817 P2MESH: generic object-oriented interface between 2-D unstructured meshes and FEM/FVM-based PDE solvers. 101-132
  

Volume 28, Number 2, June 2002

• Ronald F. Boisvert, Jack Dongarra:
  Preface to the special issue on the basic linear algebra subprograms (BLAS). 133-134
  
• Xiaoye S. Li, James Demmel, David H. Bailey, Greg Henry, Yozo Hida, Jimmy Iskandar, William Kahan, Suh Y. Kang, Anil Kapur, Michael C. Martin, Brandon Thompson, Teresa Tung, Daniel J. Yoo:
  Design, implementation and testing of extended and mixed precision BLAS. 152-205
  
• David Bindel, James Demmel, William Kahan, Osni Marques:
  On computing givens rotations reliably and efficiently. 206-238
  
• Iain S. Duff, Michael A. Heroux, Roldan Pozo:
  An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum. 239-267
  
• Iain S. Duff, Christof Vömel:
  Algorithm 818: A reference model implementation of the sparse BLAS in fortran 95. 268-283
  

Volume 28, Number 3, September 2002

• Tim Hopkins:
  A comment on the presentation and testing of CALGO codes and a remark on algorithm 639: To integrate some infinite oscillating tails. 285-300
  
• Anshul Gupta:
  Recent advances in direct methods for solving unsymmetric sparse systems of linear equations. 301-324
  
• Amparo Gil, Javier Segura, Nico M. Temme:
  Algorithm 819: AIZ, BIZ: two Fortran 77 routines for the computation of complex airy functions. 325-336
  
• Sebastian E. Ferrando, Lawrence A. Kolasa, Natasa Kovacevic:
  Algorithm 820: A flexible implementation of matching pursuit for Gabor functions on the interval. 337-353
  
• Richard J. Hanson, Clay P. Breshears, Henry A. Gabb:
  Algorithm 821: A Fortran interface to POSIX threads. 354-371
  
• Tim Hopkins:
  Remark on algorithm 705: A Fortran-77 software package for solving the Sylvester matrix equation AXB^T + CXD^T = E. 372-375
  

Volume 28, Number 4, December 2002

• John K. Reid, Jennifer A. Scott:
  Implementing Hager's exchange methods for matrix profile reduction. 377-391
  
• Isak Jonsson, Bo Kågström:
  Recursive blocked algorithms for solving triangular systems - Part I: one-sided and coupled Sylvester-type matrix equations. 392-415
  
• Isak Jonsson, Bo Kågström:
  Recursive blocked algorithms for solving triangular systems - Part II: two-sided and generalized Sylvester and Lyapunov matrix equations. 416-435
  
• Amparo Gil, Javier Segura, Nico M. Temme:
  Algorithm 822: GIZ, HIZ: two Fortran 77 routines for the computation of complex Scorer functions. 436-447
  
• Ove Edlund:
  A software package for sparse orthogonal factorization and updating. 448-482