Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
ACM Transactions on Mathematical Software
ACM Press
  1-10 of 353 reviews Date Reviewed 
  Algorithm 954: an accurate and efficient cubic and quartic equation solver for physical applications
Flocke N.  ACM Transactions on Mathematical Software 41(4): 1-24, 2015. Type: Article

Flocke developed an algorithm for obtaining all the zeros of cubic and quartic polynomials. The key to accuracy is scaling the polynomials so that all coefficients in absolute value are bounded by unity. A recent book by Boyd [1] contains a chapte...

Dec 1 2015
   Computing petaflops over terabytes of data: the case of genome-wide association studies
Fabregat-Traver D., Bientinesi P.  ACM Transactions on Mathematical Software 40(4): 1-22, 2014. Type: Article

With its catchy but somewhat misleading title, this paper proposes a method for efficiently solving multiple instances of the same problem when the instances are correlated....

Oct 16 2014
  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 t...

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 for...

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 impor...

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 for...

May 9 2013
  Level-3 Cholesky factorization routines improve performance of many Cholesky algorithms
Gustavson F., Waniewski 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 vari...

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 of...

Feb 22 2013
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2016 ThinkLoud, Inc.
Terms of Use
| Privacy Policy