Mathematical Software (TOMS)


Search Issue
enter search term and/or author name


ACM Transactions on Mathematical Software (TOMS), Volume 27 Issue 2, June 2001

Algorithm 810: The SLEIGN2 Sturm-Liouville Code
P. B. Bailey, W. N. Everitt, A. Zettl
Pages: 143-192
DOI: 10.1145/383738.383739
The SLEIGN2 code is based on the ideas and methods of the original SLEIGN code of 1979. The main purpose of the SLEIGN2 code is to compute eigenvalues and eigenfunctions of regular and singular self-adjoint Sturm-Liouville problems, with both...

Algorithm 811: NDA: algorithms for nondifferentiable optimization
Ladislav Lukšan, Jan Vlček
Pages: 193-213
DOI: 10.1145/383738.383740
We present four basic Fortran subroutines for nondifferentiable optimization with simple bounds and general linear constraints. Subroutine PMIN, intended for minimax optimization, is based on a sequential quadratic programming variable metric...

A recursive formulation of Cholesky factorization of a matrix in packed storage
Bjarne Stig Andersen, Jerzy Waśniewski, Fred G. Gustavson
Pages: 214-244
DOI: 10.1145/383738.383741
A new compact way to store a symmetric or triangular matrix called RPF for Recursive Packed Format is fully described. Novel ways to transform RPF to and from standard packed format are included. A new algorithm, called RPC for Recursive Packed...

An automatic continuation strategy for the solution of singularly perturbed nonlinear boundary value problems
J. R. Cash, G. Moore, R. W. Wright
Pages: 245-266
DOI: 10.1145/383738.383742
In a recent paper, the present authors derived an automatic continuation algorithm for the solution of linear singular perturbation problems. The algorithm was incorporated into two general-purpose codes for solving boundary value problems, and...

Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in Bernstein form
Yi-Feng Tsai, Rida T. Farouki
Pages: 267-296
DOI: 10.1145/383738.383743
The design, implementation, and testing of a C++ software library for univriate polynomials in Bernstein form is described. By invoking the class environment and operator overloading, each polynomial in an expression is interpreted as an object...