enter search term and/or author name
A BVP solver based on residual control and the Maltab PSE
Jacek Kierzenka, Lawrence F. Shampine
Our goal was to make it as easy as possible to solve a large class of boundary value problems (BVPs) for ordinary differential equations in the Matlab problem solving environment (PSE). We present here theoretical and software developments resulting...
Compression of particle data from hierarchical approximate methods
Dow-Yung Yang, Ananth Grama, Vivek Sarin, Naren Ramakrishnan
This article presents an analytical and computational framework for the compression of particle data resulting from hierarchical approximate treecodes such as the Barnes--Hut and Fast Multipole Methods. Due to approximations introduced...
Algorithm 813: SPG—Software for Convex-Constrained Optimization
Ernesto G. Birgin, José Mario Martínez, Marcos Raydan
Fortran 77 software implementing the SPG method is introduced. SPG is a nonmonotone projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral...
A revised simplex method with integer Q-matrices
David-Olivier Azulay, Jean-François Pique
We describe a modification of the simplex formulas in which Q-matrices are used to implement exact computations with an integer multiprecision library. Our motivation comes from the need for efficient and exact incremental solvers in the...
A case study in the performance and scalability of optimization algorithms
Steven J. Benson, Lois Curfman McInnes, Jorge J. Moré
We analyze the performance and scalabilty of algorithms for the solution of large optimization problems on high-performance parallel architectures. Our case study uses the GPCG (gradient projection, conjugate gradient) algorithm for solving...