ACM Transactions on Mathematical Software (TOMS), Volume 29

Volume 29, Number 1, March 2003

• Gustaf Söderlind:
  Digital filters in adaptive time-stepping. 1-26
  
• Yves Nievergelt:
  Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit. 27-48
  
• Stephen Joe, Frances Y. Kuo:
  Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator. 49-57
  
• E. Michael Gertz, Stephen J. Wright:
  Object-oriented software for quadratic programming. 58-81
  
• Lothar Wenzel, Ram Rajagopal, Dinesh Nair:
  Induced well-distributed sets in Riemannian spaces. 82-94
  

Volume 29, Number 2, June 2003

• Hee Sun Hong, Fred J. Hickernell:
  Algorithm 823: Implementing scrambled digital sequences. 95-109
  
• Xiaoye S. Li, James Demmel:
  SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. 110-140
  
• Annick Dhooge, Willy Govaerts, Yuri A. Kuznetsov:
  MATCONT: A MATLAB package for numerical bifurcation analysis of ODEs. 141-164
  
• Didier Henrion, Jean B. Lasserre:
  GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. 165-194
  
• Scott A. Sarra:
  The spectral signal processing suite. 195-217
  
• Enrique S. Quintana-Ortí, Robert A. van de Geijn:
  Formal derivation of algorithms: The triangular sylvester equation. 218-243
  

Volume 29, Number 3, September 2003

• Joaquim R. R. A. Martins, Peter Sturdza, Juan J. Alonso:
  The complex-step derivative approximation. 245-262
  
• Ingo Eble, Markus Neher:
  ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions. 263-286
  
• Ronald Cools, Ann Haegemans:
  Algorithm 824: CUBPACK: a package for automatic cubature; framework description. 287-296
  
• Alan Genz, Ronald Cools:
  An adaptive numerical cubature algorithm for simplices. 297-308
  
• Spencer D. Shellman, K. Sikorski:
  Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. 309-325
  
• Mark R. Fahey:
  Algorithm 826: A parallel eigenvalue routine for complex Hessenberg matrices. 326-336
  
• James Baglama, Daniela Calvetti, Lothar Reichel:
  Algorithm 827: irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix. 337-348
  
• Tim Hopkins:
  Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. 349-351
  

Volume 29, Number 4, December 2003

• Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
  GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. 353-372
  
• Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. 373-394
  
• Jennifer A. Scott:
  Parallel frontal solvers for large sparse linear systems. 395-417
  
• Emma L. Bradbury, Wayne H. Enright:
  Fast contouring of solutions to partial differential equations. 418-439
  
• H. Martin Bücker, Arno Rasch:
  Modeling the performance of interface contraction. 440-457
  
• Robert J. Renka:
  Algorithm 828: DNSPLIN1: discrete nonlinear spline interpolation. 458-468
  
• Marco Gaviano, Dmitri E. Kvasov, Daniela Lera, Yaroslav D. Sergeyev:
  Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization. 469-480
  

Last update Wed May 22 19:07:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page