Mathematics in Science and Engineering, Volume 91Academic Press, 1972 - Engineering mathematics |
Other editions - View all
Common terms and phrases
a₁ adjacent in G belong block elimination process Chapter complete graph components computing connected in G Consider the graph constrained criterion function defined DEFINITION denoted descendant from G dynamic programming edges elimination of variables EXAMPLE Figure Final Theorem fully connected functional evaluations G of Fig Gaussian elimination given graph G graph of G h₁ Hence Initial Theorem integer interaction graph invariance theorem k₁ Let G lower bound maximum number multilevel elimination procedure multilevel ordered partition nonnegative integer nonserial problem nonserial unconstrained problem null graph number of functional number of variables objective function optimal elimination ordering optimal ordered partition optimizing assignment parametric unconstrained problem problem P₁ quasi-standard form secondary optimization problem section graph shown in Fig solution strong interaction subgraph subset T₁ tion U₁ v₁ vertex set vertices of degree W₁ x₁ y(Y₁ Y₁ Z₁ ZM+1 σ²