#### Filter Results:

#### Publication Year

1976

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The numerical methods employed in the solution of many scientiic computing problems require the computation of derivatives of a function f : R n ! R m. Both the accuracy and the computationalrequirements of the derivativecomputation are usually of critical importance for the robustness and speed of the numerical solution. ADIFOR (Automatic Diierentiation In… (More)

In many practical problems in which derivatives are calculated, their basic purpose is to be used in the modeling of a functional dependence, often based on a Taylor expansion to rst or higher orders. While the practical computation of such derivatives is greatly facilitated and in many cases is possible only through the use of forward or reverse… (More)

Equations Taylor series methods compute a solution to an initial value problem in ordinary differential equations by expanding each component of the solution in a long series. A portable translator program accepts statements of the system of differential equations and produces a portable FORTRAN object code which is then run to solve the system. At each… (More)

The formal process of the evaluation of derivatives using some of the various modern methods of computational diierentiation can be recognized as an example for the application of conventional \approximate" numerical techniques on a non-archimedean extension of the real numbers. In many cases, the application of \innnitely small" numbers instead of \small… (More)

Compared to standard numerical methods for initial value problems (IVPs) for ordinary diierential equations (ODEs), validated methods for IVPs for ODEs have two important advantages: if they return a solution to a problem, then (1) the problem is guaranteed to have a unique solution, and (2) an enclosure of the true solution is produced. The authors survey… (More)

We describe algorithms for computing the greatest common divisor GCD of two univariate polynomials with inexactly-known coeecients. Assuming that an estimate for the GCD degree is available e.g., using an SVD-based algorithm, we formulate and solve a nonlinear optimization problem in order to determine the coeecients of the best" GCD. We discuss various… (More)

- Richard J Povinelli, Naveen Bansal, Ronald Brown, George Corliss, James Heinen
- 1999

and his brother, who will arrive shortly. iii Acknowledgment I would like to thank Dr. Xin Feng for the encouragement, support, and direction he has provided during the past three years. His insightful suggestions, enthusiastic endorsement, and shrewd proverbs have made the completion of this research possible. They provide an example to emulate. I owe a… (More)

We introduce a modiication of existing algorithms that allows easier analysis of numerical solutions of ordinary diierential equations. We relax the requirement that the speciied problem be solved, and instead solve a \nearby" problem exactly, in Wilkinson's tradition of backward error analysis. The precise meaning of \nearby" is left to the user. This… (More)

- George F Corliss
- 1998

We apply interval techniques for global optimization to several industrial applications including Swiss Bank (currency trading), BancOne (portfolio management), MacNeal-Schwendler (finite element), GE Medical Systems (Magnetic resonance imaging), Genome Theraputics (gene prediction), inexact greatest common divisor computations from computer algebra, and… (More)

The numerical methods employed in the solution of many scientiic computing problems require the computation of derivatives of a function f : R n ! R m. Both the accuracy and the computationalrequirements of the derivativecomputation are usually of critical importance for the robustness and speed of the numerical solution. ADIFOR (Automatic Diierentiation In… (More)