| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 14
reviews
|
|
|
 |
|
|
|
|
Application of the over-set grid technique to a model singular perturbation problem
Havik E., Hemker P., Hoffman W. Computing 65(4): 339-356, 2000. Type: Article
This paper addresses the numerical solution of a singularly perturbed two-dimensional convective-diffusion problem and the use of over-set (or overlapping or chimera) grids to solve the problem. The focus of the paper is the developmen...
|
May 1 2001 |
|
|
|
|
|
|
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu C., Byrd R., Lu P., Nocedal J. ACM Transactions on Mathematical Software 23(4): 550-560, 1997. Type: Article
The authors provide an excellent algorithmic description of the software known as L-BFGS-B, an extension of a well-known limited-memory BFGS algorithm and software (due to Liu and Nocedal), L-BFGS. Bound constraints are often not treat...
|
Feb 1 1999 |
|
|
|
|
|
|
DESI methods for stiff initial-value problems
Butcher J., Cash J., Diamantakis M. ACM Transactions on Mathematical Software 22(4): 401-422, 1996. Type: Article
The authors describe a class of recently developed Runge-Kutta methods. These techniques are known as DESI (diagonally extended singly implicit) methods and have been introduced to overcome limitations of the more standard singly impli...
|
Aug 1 1997 |
|
|
|
|
|
|
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
Kearfott R. ACM Transactions on Mathematical Software 21(1): 63-78, 1995. Type: Article
Kearfott describes an environment for conducting research and prototyping algorithms designed for two closely related problem areas: constrained and unconstrained global optimization problems, and finding all roots of a system of nonli...
|
Aug 1 1996 |
|
|
|
|
|
|
Algorithm 744: a stochastic algorithm for global optimization with constraints
Rabinowitz F. ACM Transactions on Mathematical Software 21(2): 194-213, 1995. Type: Article
A stochastic algorithm for global optimization subject to general constraints is presented. The algorithm is based on using an adaptive n-dimensional torus to surround and isolate the global minimum. The paper compar...
|
May 1 1996 |
|
|
|
|
|
|
An interval computational method for approximating controllability sets
Burgmeier P., Jahn K., Plochov A. Computing 44(1): 35-46, 1990. Type: Article
The authors present an approach to computing the null-controllability set of an autonomous nonlinear system using interval arithmetic. In developing a numerical approach, they introduce the concept of an approximating controllability s...
|
Apr 1 1991 |
|
|
|
|
|
|
On first and second order box schemes
Hackbusch W. (ed) Computing 41(4): 277-296, 1989. Type: Article, Reviews: (2 of 2)
This paper presents the box method for discretizing elliptic boundary value. This method is similar to finite element techniques but has the advantage that all the elements of the stiffness matrix are line integrals over the box bounda...
|
Jun 1 1990 |
|
|
|
|
|
|
A global optimization algorithm using stochastic differential equations
Aluffi-Pentini F., Parisi V., Zirilli F. ACM Transactions on Mathematical Software 14(4): 345-365, 1988. Type: Article
This paper presents an algorithm and software that solve the global unconstrained optimization problem. The package, SIGMA, is based on the use of stochastic differential equations and is inspired by a statistical mechanics approach. T...
|
Jul 1 1989 |
|
|
|
|
|
|
Symmetric minimum-norm updates for use in Gibbs free energy calculations
Salane D. Mathematical Programming: Series A 36(2): 145-156, 1986. Type: Article
This paper deals with the numerical solution of a difficult class of problems that arise in chemical and phase equilibria. These problems involve the minimization of the Gibbs free energy subject to linear constraints. These constrai...
|
Jun 1 1988 |
|
|
|
|
|
|
Equilibrium states of Runge-Kutta schemes: part II
Hall G. ACM Transactions on Mathematical Software 12(3): 183-192, 1986. Type: Article
This paper deals with the behavior of Runge-Kutta methods when stepsize is restricted by stability requirements. In Part I (see ACM Trans. Math Softw. 11, 3 (Sept. 1985), 289–301), this requirement was studied i...
|
Feb 1 1988 |
|
|
|
|
|
| |
|
|
| |
|
|
