default search action
ACM Transactions on Mathematical Software (TOMS), Volume 37
Volume 37, Number 1, January 2010
- Christof Vömel:
ScaLAPACK's MRRR algorithm. 1:1-1:35 - Marc Daumas
, Guillaume Melquiond
Certification of bounds on expressions involving rounded operators. 2:1-2:20 - Damian W. I. Rouson, Helgi Adalsteinsson, Jim Xia:
Design patterns for multiphysics modeling in Fortran 2003 and C++. 3:1-3:30 - Peter Kornerup, Christoph Quirin Lauter, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
Computing correctly rounded integer powers in floating-point arithmetic. 4:1-4:23 - Robert C. Kirby
Singularity-free evaluation of collapsed-coordinate orthogonal polynomials. 5:1-5:16 - Martin Sandve Alnæs
On the efficiency of symbolic computations combined with code generation for finite element methods. 6:1-6:26 - John E. Savage, Mohammad Zubair:
Cache-optimal algorithms for option pricing. 7:1-7:30 - Kristian B. Ølgaard, Garth N. Wells
Optimizations for quadrature representations of finite element tensors through automated code generation. 8:1-8:23 - Martin R. Albrecht, Gregory V. Bard, William Hart:
Algorithm 898: Efficient multiplication of dense matrices over GF(2). 9:1-9:14 - Scott A. Sarra
Algorithm 899: The Matlab postprocessing toolkit. 10:1-10:15 - Germán Ariel Torres:
Algorithm 900: A discrete time Kalman filter package for large scale problems. 11:1-11:16 - D. S. Vlachos, Tom E. Simos:
Algorithm 901: LMEF - A program for the construction of linear multistep methods with exponential fitting for the numerical solution of ordinary differential equations. 12:1-12:10
Volume 37, Number 2, April 2010
- Arno Rasch, H. Martin Bücker
EFCOSS: An interactive environment facilitating optimal experimental design. 13:1-13:37 - Wei Chen, Gabor T. Herman:
Efficient controls for finitely convergent sequential algorithms. 14:1-14:23 - Fred T. Krogh:
Stepsize selection for ordinary differential equations. 15:1-15:11 - Luc M. W. J. Rutten, Marko C. J. D. van Eekelen:
Efficient and formally proven reduction of large integers by small moduli. 16:1-16:21 - Jonathan D. Hogg
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems. 17:1-17:24 - Fred G. Gustavson, Jerzy Wasniewski, Jack J. Dongarra, Julien Langou:
Rectangular full packed format for cholesky's algorithm: factorization, solution, and inversion. 18:1-18:21 - Jennifer A. Scott
Scaling and pivoting in an out-of-core sparse direct solver. 19:1-19:23 - Anders Logg
DOLFIN: Automated finite element computing. 20:1-20:28 - Andreas Stathopoulos
PRIMME: preconditioned iterative multimethod eigensolver - methods and software description. 21:1-21:30 - Anil V. Rao, David A. Benson, Christopher Darby, Michael A. Patterson, Camila Francolin, Ilyssa Sanders, Geoffrey T. Huntington:
Algorithm 902: GPOPS, A MATLAB software for solving multiple-phase optimal control problems using the gauss pseudospectral method. 22:1-22:39 - Elena Celledoni, Antonella Zanna:
Algorithm 903: FRB-Fortran routines for the exact computation of free rigid body motions. 23:1-23:24
Volume 37, Number 3, September 2010
- Gary Haggard, David J. Pearce, Gordon F. Royle
Computing Tutte Polynomials. 24:1-24:17 - Severiano González-Pinto
A Code Based on the Two-Stage Runge-Kutta Gauss Formula for Second-Order Initial Value Problems. 25:1-25:30 - Pedro Gonnet
Increasing the Reliability of Adaptive Quadrature Using Explicit Interpolants. 26:1-26:32 - Ichitaro Yamazaki, Zhaojun Bai, Horst D. Simon
Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method. 27:1-27:18 - Christopher Kumar Anand
Unified Tables for Exponential and Logarithm Families. 28:1-28:23 - Carl Ollivier-Gooch
An Interoperable, Data-Structure-Neutral Component for Mesh Query and Manipulation. 29:1-29:28 - Pasqua D'Ambra
MLD2P4: A Package of Parallel Algebraic Multilevel Domain Decomposition Preconditioners in Fortran 95. 30:7-30:23 - Piotr Wendykier, James G. Nagy:
Parallel Colt: A High-Performance Java Library for Scientific Computing and Image Processing. 31:1-31:22 - Robert Granat, Bo Kågström:
Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part I: Theory and Algorithms. 32:1-32:32 - Robert Granat, Bo Kågström:
Algorithm 904: The SCASY Library - Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part II. 33:1-33:4 - William I. Thacker, Jingwei Zhang, Layne T. Watson, Jeffrey B. Birch, Manjula A. Iyer, Michael W. Berry
Algorithm 905: Modified Shepard Algorithm for Interpolation of Scattered Multivariate Data. 34:1-34:20 - Tiancheng Li, Ian Robinson:
Algorithm 906: elrint3d - A Three-Dimensional Nonadaptive Automatic Cubature Routine Using a Sequence of Embedded Lattice Rules. 35:1-35:17 - Timothy A. Davis, Ekanathan Palamadai Natarajan:
Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems. 36:1-36:17 - Yongkang Zhu, Wayne B. Hayes
Algorithm 908: Online Exact Summation of Floating-Point Streams. 37:1-37:13
Volume 37, Number 4, February 2011
- Miroslav Rozlozník
Partitioned Triangular Tridiagonalization. 38:1-38:16 - William J. Cook, Daniel E. Steffy:
Solving Very Sparse Rational Systems of Equations. 39:1-39:21 - Lin Lin, Chao Yang, Juan C. Meza
SelInv - An Algorithm for Selected Inversion of a Sparse Symmetric Matrix. 40:1-40:19 - Ken Taylor, Scott T. Rickard, Konstantinos Drakakis:
Costas Arrays: Survey, Standardization, and MATLAB Toolbox. 41:1-41:31 - David J. Silvester
An Optimal Iterative Solver for Symmetric Indefinite Systems Stemming from Mixed Approximation. 42:1-42:22 - Xiaoye S. Li, Meiyue Shao
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting. 43:1-43:20 - Sébastien Le Digabel
Algorithm 909: NOMAD: Nonlinear Optimization with the MADS Algorithm. 44:1-44:15 - Christopher Kormanyos:
Algorithm 910: A Portable C++ Multiple-Precision System for Special-Function Calculations. 45:1-45:27 - David M. Smith:
Algorithm 911: Multiple-Precision Exponential Integral and Related Functions. 46:1-46:16 - Masao Kodama:
Algorithm 912: A Module for Calculating Cylindrical Functions of Complex Order and Complex Argument. 47:1-47:25
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.
last updated on 2025-01-10 18:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: