Engineering Papers⌕ Search

Engineering topics

Koshelev, Misha

Publications and source records attributed to Koshelev, Misha.

2 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Fixed Future and Uncertain Past: Theorems Explain Why It Is Often More Difficult to Reconstruct the Past Than to Predict the Future

At first glance. it may seem that reconstructing the past is, in general, easier than predicting the future, because the past has already occurred and it has already left its traces, while the future is still yet to come, and so no traces of the future are available. However, in many real life situations, including problems from geophysics and celestial mechanics, reconstructing the past is much more computationally difficult than predicting the future. In this paper, we give an explanation of this difficulty. This explanation is given both on a formal level (as a theorem) and on the informal level (as a more intuitive explanation).

Alefeld, Goetz↗
NASA NTRS1997

Optimal Approximation of Quadratic Interval Functions

Measurements are never absolutely accurate, as a result, after each measurement, we do not get the exact value of the measured quantity; at best, we get an interval of its possible values, For dynamically changing quantities x, the additional problem is that we cannot measure them continuously; we can only measure them at certain discrete moments of time t(sub 1), t(sub 2), ... If we know that the value x(t(sub j)) at a moment t(sub j) of the last measurement was in the interval [x-(t(sub j)), x + (t(sub j))], and if we know the upper bound D on the rate with which x changes, then, for any given moment of time t, we can conclude that x(t) belongs to the interval [x-(t(sub j)) - D (t - t(sub j)), x + (t(sub j)) + D (t - t(sub j))]. This interval changes linearly with time, an is, therefore, called a linear interval function. When we process these intervals, we get an expression that is quadratic and higher order w.r.t. time t, Such "quadratic" intervals are difficult to process and therefore, it is necessary to approximate them by linear ones. In this paper, we describe an algorithm that gives the optimal approximation of quadratic interval functions by linear ones.

Koshelev, Misha↗