default search action
ACM Transactions on Mathematical Software (TOMS), Volume 33
Volume 33, Number 1, March 2007
- Wayne H. Enright, Wayne B. Hayes:
Robust and reliable defect control for Runge-Kutta methods. 1 - Markus Neher:
Complex standard functions and their implementation in the CoStLy library. 2 - Nicholas I. M. Gould, Philippe L. Toint:
FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. 3 - Håvard Berland, Bård Skaflestad, Will M. Wright:
EXPINT - A MATLAB package for exponential integrators. 4 - Marco Morandini, Paolo Mantegazza:
Using dense storage to solve small sparse linear systems. 5 - Ioannis C. Demetriou:
Algorithm 863: L2WPMA, a Fortran 77 package for weighted least-squares piecewise monotonic data approximation. 6 - Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst:
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. 7 - Fred G. Gustavson, John K. Reid, Jerzy Wasniewski:
Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format. 8
Volume 33, Number 2, June 2007
- Hong Zhang, Barry Smith, Michael G. Sternberg, Peter Zapol:
SIPs: Shift-and-invert parallel spectral transformations. 9 - Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu:
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. 10 - Steven Benson, Manojkumar Krishnan, Lois C. McInnes, Jarek Nieplocha, Jason Sarich:
Using the GA and TAO toolkits for solving large-scale optimization problems on parallel computers. 11 - Juan C. Meza, Ricardo A. Oliva, Patricia D. Hough, Pamela J. Williams:
OPT++: An object-oriented toolkit for nonlinear optimization. 12 - Laurent Fousse, Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Paul Zimmermann:
MPFR: A multiple-precision binary floating-point library with correct rounding. 13 - Howard C. Elman, Alison Ramage, David J. Silvester:
Algorithm 866: IFISS, a Matlab toolbox for modelling incompressible flow. 14 - David Frederic Crouse:
Remark on algorithm 515: Generation of a vector from the lexicographical index combinations. 15
Volume 33, Number 3, August 2007
- James Rioux, M. Halse, Eric E. Aubanel, Bruce J. Balcom, Joachim Kaffanke, Sandro Romanzetti, T. Dierkes, N. Jon Shah:
An accurate nonuniform fourier transform for SPRITE magnetic resonance imaging data. 16 - Robert C. Kirby, Anders Logg:
Efficient compilation of a class of variational forms. 17 - Jennifer A. Scott, Yifan Hu:
Experiences of sparse direct symmetric solvers. 18 - James S. Ball, Nelson H. F. Beebe:
Efficient Gauss-related quadrature for two classes of logarithmic weight functions. 19 - Nelson H. F. Beebe, James S. Ball:
Algorithm 867: QUADLOG - a package of routines for generating Gauss-related quadrature for two classes of logarithmic weight functions. 20 - Terje O. Espelid:
Algorithm 868: Globally doubly adaptive quadrature - reliable Matlab codes. 21
Volume 33, Number 4, August 2007
- Pierre L'Ecuyer, Richard J. Simard:
TestU01: A C library for empirical testing of random number generators. 22:1-22:40 - Lars Pesch, Alexander Bell, Henk Sollie, Vijaya R. Ambati, Onno Bokhove, Jaap J. W. van der Vegt:
hpGEM - A software framework for discontinuous Galerkin finite element methods. 23 - Wolfgang Bangerth, Ralf Hartmann, Guido Kanschat:
deal.II - A general-purpose object-oriented finite element library. 24 - Yihua Bai, Robert C. Ward:
A parallel symmetric block-tridiagonal divide-and-conquer algorithm. 25 - Lawrence F. Shampine:
Accurate numerical derivatives in MATLAB. 26 - Jason W. Zwolak, Paul T. Boggs, Layne T. Watson:
Algorithm 869: ODRPACK95: A weighted orthogonal distance regression code with bound constraints. 27 - Masao Kodama:
Remark on Algorithm 644. 28
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.