| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 58
reviews
|
|
|
 |
|
|
|
|
 Estimating differential quantities using polynomial fitting of osculating jets
Cazals F., Pouget M. Computer Aided Geometric Design 22(2): 121-146, 2005. Type: Article
This paper considers the problem of estimating differential quantities (for example, slope of a tangent, direction of a normal, curvature, and so on) for curves on the plane and surfaces in three dimensions, from scattered data, using ...
|
May 19 2005 |
|
|
|
|
|
|
Symmetric multistep methods over long times
Hairer E., Lubich C. Numerische Mathematik 97(4): 699-723, 2004. Type: Article
This important paper explains, with full theoretical justification, why certain symmetric multistep methods are so successful when used to integrate the special second order systems of ordinary differential equations (ODEs), arising in...
|
Dec 26 2004 |
|
|
|
|
|
|
Parallel two-step W-methods with peer variables
Schmitt B., Weiner R. SIAM Journal on Numerical Analysis 42(1): 265-282, 2004. Type: Article
The problem of parallel solution of systems of initial value problems in ordinary differential equations (ODEs) has received much attention in the last 20 years. The difficulty is that the problem is inherently sequential. So although ...
|
Mar 25 2004 |
|
|
|
|
|
|
On structure-exploiting trust-region regularized nonlinear least squares algorithms for neural-network learning
Sullivan B., Demmel J. Neural Networks 16(5-6): 745-753, 2003. Type: Article
The relationship of various neural network learning algorithms to block-separable nonlinear least-squares problems, using Levenberg-Marquardt algorithms and trust region types, is discussed in this paper....
|
Oct 24 2003 |
|
|
|
|
|
|
A Novel Data Distribution Technique for Host-Client Type Parallel Applications
Comino N., Narasimhan V. IEEE Transactions on Parallel and Distributed Systems 13(2): 97-110, 2002. Type: Article
The authors discuss and analyze data distribution techniques for host-client parallel applications. They start with the assumption that the host is not involved in computation, and that it is involved in data distribution and reception...
|
Jun 21 2002 |
|
|
|
|
|
|
An automatic continuation strategy for the solution of singularly perturbed nonlinear boundary value problems
Cash J., Moore G., Wright R. ACM Transactions on Mathematical Software 27(2): 245-266, 2001. Type: Article
This paper considers a continuation algorithm for nonlineartwo-point boundary value problems in ordinary differentialequations. It is assumed that the problem may be written in the“singular perturbation” form &e...
|
Mar 1 2002 |
|
|
|
|
|
|
Templates for the solution of algebraic eigenvalue problems: a practical guide
Bai Z. (ed), Demmel J., Dongarra J., Ruhe A., van der Vorst H., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000. 410 pp. Type: Book (9780898714715)
This excellent text is carefully organized as a reference. It mainly deals with iterative solution techniques for solving most types of algebraic eigenvalue problems that are of interest and for which there exist reliable algorithms. T...
|
Mar 1 2001 |
|
|
|
|
|
|
ADMIT-1: automatic differentiation and MATLAB interface toolbox
Coleman T., Verma A. ACM Transactions on Mathematical Software 26(1): 150-175, 2000. Type: Article
ADMIT-1 is an automatic differentiation package that computes the Jacobian for use when solving a nonlinear system f ( X ) = 0, say by a Newton method, ...
|
Jul 1 2000 |
|
|
|
|
|
|
A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications
Duff I., Scott J. ACM Transactions on Mathematical Software 25(4): 404-424, 1999. Type: Article
The authors develop a new frontal code, MA62 in the Harwell subroutine library, for solving sparse, positive definite, linear symmetric systems. The matrices must arise from a finite element analysis, because a crucial part of the fron...
|
Jun 1 2000 |
|
|
|
|
|
|
Performance rating via the FEAST indices
Turek S., Becker C., Runge A. Computing 63(3): 283-297, 1999. Type: Article
The FEAST indices are an attempt to provide a realistic measure of computer performance on numerically intensive benchmarks from current 2D and 3D simulations. The authors argue that most standard benchmarks in current use (including L...
|
Feb 1 2000 |
|
|
|
|
|
| |
|
|
| |
|
|
