ACM Transactions on Mathematical Software (TOMS), Volume 30

Volume 30, Number 1, March 2004

S. González-Pinto, J. I. Montijano, S. Pérez-Rodríguez:
Two-step error estimators for implicit Runge-Kutta methods applied to stiff systems. 1-18
Vladimir Rotkin, Sivan Toledo:
The design and implementation of a new out-of-core sparse cholesky factorization method. 19-46
A. Ismael F. Vaz, Edite M. G. P. Fernandes, M. Paula S. F. Gomes:
SIPAMPL: Semi-infinite programming with AMPL. 47-61
Roscoe A. Bartlett, Bart G. van Bloemen Waanders, Michael A. Heroux:
Vector reduction/transformation operators. 62-85
Richard J. Hanson, Tim Hopkins:
Algorithm 830: Another visit with standard and modified givens transformations and a remark on algorithm 539. 86-94

Iain S. Duff, Jennifer A. Scott:
A parallel direct solver for large sparse highly unsymmetric linear systems. 95-117
Iain S. Duff:
MA57 - a code for the solution of sparse symmetric definite and indefinite systems. 118-144
Amparo Gil, Javier Segura, Nico M. Temme:
Computing solutions of the modified Bessel differential equation for imaginary orders and positive arguments. 145-158
Amparo Gil, Javier Segura, Nico M. Temme:
Algorithm 831: Modified Bessel functions of imaginary order and positive argument. 159-164
Timothy A. Davis:
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. 165-195
Timothy A. Davis:
Algorithm 832: UMFPACK V4.3 - an unsymmetric-pattern multifrontal method. 196-199
Robert J. Renka:
Algorithm 833: CSRFPACK - interpolation of scattered data with a C¹ convexity-preserving surface. 200-211
Robert J. Renka:
Algorithm 834: glsurf - an interactive surface plotting program using OpenGL. 212-217
Zhonggang Zeng:
Algorithm 835: MultRoot - a Matlab package for computing polynomial roots and multiplicities. 218-236

Thierry Matthey, Trevor M. Cickovski, Scott S. Hampton, Alice Ko, Qun Ma, Matthew Nyerges, Troy Raeder, Thomas Slabach, Jesús A. Izaguirre:
ProtoMol, an object-oriented framework for prototyping novel algorithms for molecular dynamics. 237-265
Shaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid:
Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. 266-299
Nicholas I. M. Gould, Jennifer A. Scott:
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. 300-325
Yihua Bai, Wilfried N. Gansterer, Robert C. Ward:
Block tridiagonalization of "effectively" sparse symmetric matrices. 326-352
Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
A column approximate minimum degree ordering algorithm. 353-376
Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. 377-380
Patrick Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff:
Algorithm 837: AMD, an approximate minimum degree ordering algorithm. 381-388

Douglas M. Priest:
Efficient scaling for complex division. 389-401
Yves Nievergelt:
Analysis and applications of Priest's distillation. 402-433
Jon Whittle, Johann Schumann:
Automating the implementation of Kalman filter algorithms. 434-453
R. Wang, Patrick Keast, Paul H. Muir:
BACOL: B-spline adaptive collocation software for 1-D parabolic PDEs. 454-470
B. R. Fabijonas, Daniel W. Lozier, F. W. J. Olver:
Computation of complex Airy functions and their zeros using asymptotics and the differential equation. 471-490
B. R. Fabijonas:
Algorithm 838: Airy Functions. 491-501
Robert C. Kirby:
Algorithm 839: FIAT, a new paradigm for computing finite element basis functions. 502-516

Last update Thu May 23 19:41:29 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page