w/in this Title
ACM Transactions on Mathematical Software
1-10 of 351 reviews
Algorithm 933: reliable calculation of numerical rank, null space bases, pseudoinverse solutions, and basic solutions using SuiteSparseQR
Foster L., Davis T. ACM Transactions on Mathematical Software 40(1): 1-23, 2013. Type: Article
The rank is one of the major characteristics of a matrix. In practice, the rank is not clear cut due to measurement errors and/or noise. Thus, determining the numerical rank of a matrix is an important problem. Many applications require numerical ...
Jan 6 2014
On Ziv’s rounding test
de Dinechin F., Lauter C., Muller J., Torres S. ACM Transactions on Mathematical Software 39(4): 1-19, 2013. Type: Article
When working in classical finite precision arithmetic, one is often faced with the following problem: the result of a computation cannot be represented exactly. In such cases, one usually has the goal of constructing the computation algorithm so...
Sep 11 2013
Accelerating linear system solutions using randomization techniques
Baboulin M., Dongarra J., Herrmann J., Tomov S. ACM Transactions on Mathematical Software 39(2): 1-13, 2013. Type: Article
After almost 40 years of active research on parallel scientific computing, researchers are still struggling with the implementation of Gaussian elimination. The problem centers on how to implement pivoting, that is, row and/or column exchanges...
Aug 16 2013
Algorithm 928: a general, parallel implementation of Dantzig-Wolfe decomposition
Rios J. ACM Transactions on Mathematical Software 39(3): 1-10, 2013. Type: Article
An open-source implementation of the Dantzig-Wolfe decomposition method, a powerful and useful technique for solving linear programming problems of block-angular form, is described in this concise and well-written paper....
Jul 5 2013
Variants of Mersenne twister suitable for graphic processors
Saito M., Matsumoto M. ACM Transactions on Mathematical Software 39(2): 1-20, 2013. Type: Article
Generating sequences of pseudorandom numbers is a prerequisite for many applications, such as Monte Carlo simulations. Since such applications are often executed on parallel computers, the parallel computation of pseudorandom numbers is also...
Jun 5 2013
Graph-based software design for managing complexity and enabling concurrency in multiphysics PDE software
Notz P., Pawlowski R., Sutherland J. ACM Transactions on Mathematical Software 39(1): 1-21, 2012. Type: Article
The field of complex computational modeling involves the use of advanced hardware and software environments, and the issues faced in the combination of these areas are quite daunting. This paper provides a detailed study of developing software...
May 9 2013
Level-3 Cholesky factorization routines improve performance of many Cholesky algorithms
Gustavson F., Wa
niewski J., Dongarra J., Herrero J., Langou J. ACM Transactions on Mathematical Software 39(2): 1-10, 2013. Type: Article
The Cholesky decomposition of a positive definite matrix is the basis for many efficient and numerically accurate algorithms. The usual procedure is a variant of Gaussian elimination without pivoting, but the computation can be reordered in a...
May 6 2013
Families of algorithms for reducing a matrix to condensed form
Van Zee F., van de Geijn R., Quintana-Ortí G., Elizondo G. ACM Transactions on Mathematical Software 39(1): 1-32, 2012. Type: Article
As hardware continues to change, developers look for ways to maintain compatibility with current platforms. Right now, the principal issue is that memory bandwidth has not kept up with other changes in hardware, which constrains the performance...
Feb 22 2013
Algorithm 923: efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
Wimmer M. ACM Transactions on Mathematical Software 38(4): 1-17, 2012. Type: Article
The Pfaffian of a matrix, like the determinant, is a polynomial in the matrix elements. It is most frequently used in particle physics where the matrix is even-ordered and skew-symmetric, and the determinant is the square of the Pfaffian. In...
Oct 30 2012
High-performance up-and-downdating via Householder-like transformations
Van De Geijn R., Van Zee F. ACM Transactions on Mathematical Software 38(1): 1-17, 2011. Type: Article
The linear least-squares problem in statistics is usually solved by finding the Cholesky factor of the matrix of normal equations. In certain applications, one wants to solve several related problems formed by removing and/or adding data. In this ...
Apr 30 2012
Reproduction in whole or in part without permission is prohibited. Copyright © 2000-2014 ThinkLoud, Inc.