enter search term and/or author name
Editorial: ACM TOMS Replicated Computational Results Initiative
Michael A. Heroux
Article No.: 13
The scientific community relies on the peer review process for assuring the quality of published material, the goal of which is to build a body of work we can trust. Computational journals such as the ACM Transactions on Mathematical...
BLIS: A Framework for Rapidly Instantiating BLAS Functionality
Field G. Van Zee, Robert A. van de Geijn
Article No.: 14
The BLAS-like Library Instantiation Software (BLIS) framework is a new infrastructure for rapidly instantiating Basic Linear Algebra Subprograms (BLAS) functionality. Its fundamental innovation is that virtually all computation within level-2...
Replicated Computational Results (RCR) Report for “BLIS: A Framework for Rapidly Instantiating BLAS Functionality”
James M. Willenbring
Article No.: 15
Numerical Integration of Discontinuous Functions in Many Dimensions
Article No.: 16
We consider the problem of numerically integrating functions with hyperplane discontinuities over the entire Euclidean space in many dimensions. We describe a simple process through which the Euclidean space is partitioned into simplices on which...
odeToJava: A PSE for the Numerical Solution of IVPs
Andrew Kroshko, Raymond J. Spiteri
Article No.: 17
Problem-solving environments (PSEs) offer a powerful yet flexible and convenient means for general experimentation with computational methods, algorithm prototyping, and visualization and manipulation of data. Consequently, PSEs have become the...
Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) to obtain portable high performance. However, many numerical algorithms require several BLAS calls in sequence, and those successive calls do not achieve...
Complex Root Finding Algorithm Based on Delaunay Triangulation
Article No.: 19
A simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch...
Algorithm 949: MATLAB Tools for HDG in Three Dimensions
Zhixing Fu, Luis F. Gatica, Francisco-javier Sayas
Article No.: 20
In this article, we provide some MATLAB tools for efficient vectorized implementation of the Hybridizable Discontinuous Galerkin for linear variable coefficient reaction-diffusion problems in polyhedral domains. The resulting tools are modular and...
Algorithm 950: Ncpol2sdpa—Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
Article No.: 21
A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of...
Remark on Algorithm 897: VTDIRECT95: Serial and Parallel Codes for the Global Optimization Algorithm DIRECT
Masha Sosonkina, Layne T. Watson, Jian He
Article No.: 22
The Fortran95 code VTDIRECT95, based on the original MPI, has been modified to use MPI-2. An option for VTDIRECT95 is to divide the feasible box into subdomains, and concurrently apply the global direct search algorithm DIRECT within each...