#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1994

2016

- This year (0)
- Last 5 years (14)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nedialko S. Nedialkov, Kenneth R. Jackson, George F. Corliss
- Applied Mathematics and Computation
- 1999

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)

This paper is one of a series underpinning the authors’ DAETS code for solving DAE initial value problems by Taylor series expansion. First, building on the second author’s structural analysis of DAEs (BIT 41 (2001) 364–394), it describes and justifies the method used in DAETS to compute Taylor coefficients (TCs) using automatic differentiation. The DAE may… (More)

- Nedialko S. Nedialkov, Kenneth R. Jackson, John D. Pryce
- Reliable Computing
- 2001

- Nedialko S. Nedialkov, Kenneth R. Jackson
- Reliable Computing
- 1999

Interval numerical methods produce results that can have the power of a mathematical proof. Although there is a substantial amount of theoretical work on these methods, little has been done to ensure that an implementation of an interval method can be readily verified. However, when claiming rigorous numerical results, it is crucial to ensure that there are… (More)

- Markus Neher, Kenneth R. Jackson, Nedialko S. Nedialkov
- SIAM J. Numerical Analysis
- 2007

The numerical solution of initial value problems (IVPs) for ODEs is one of the fundamental problems in computation. Today, there are many well-established algorithms for solving IVPs. However, traditional integration methods usually provide only approximate values for the solution. Precise error bounds are rarely available. The error estimates, which are… (More)

We investigate solution techniques for numerical constraint satisfaction problems and validated numerical set integration methods for computing reachable sets of nonlinear hybrid dynamical systems in presence of uncertainty. To use interval simulation tools with higher dimensional hybrid systems, while assuming large domains for either initial continuous… (More)

- George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, John D. Pryce, Spencer Smith
- Reliable Implementation of Real Number Algorithms
- 2006

We propose the collection, standardization, and distribution of a full-featured, production quality library for reliable scientific computing with routines using interval techniques for use by the wide community of applications developers. 1 Vision – Why are we doing this? The interval/reliable computing research community has long worked to attract… (More)

- Nedialko S. Nedialkov, Vladik Kreinovich, Scott A. Starks
- Numerical Algorithms
- 2004

In interval computations, the range of each intermediate result r is described by an interval r. To decrease excess interval width, we can keep some information on how r depends on the input x=(x 1,...,x n ). There are several successful methods of approximating this dependence; in these methods, the dependence is approximated by linear functions (affine… (More)