Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms.

Susanne C. Brenner Qingmi He

Published in: Numerische Mathematik (2003)

Keyphrases

three dimensional
lower bound
learning algorithm
data structure
domain independent
data sets
computational cost
worst case
computationally efficient
image sequences
objective function
upper bound
machine learning algorithms
running times
randomized algorithm