Interval bounds on the solutions of semi-explicit index-one DAEs. Part 2: computation.

Joseph K. Scott Paul I. Barton

Published in: Numerische Mathematik (2013)

Keyphrases

upper bound
optimal solution
data structure
lower bound
efficient computation
index structure
similarity search
solution space
interior point methods
data sets
structural similarity
upper and lower bounds
indexing techniques
solution quality
error bounds
multi objective
search space
high dimensional
neural network