## Computing and Combinatorics: Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings., Volume 3The book is aimed at graduate students, researchers, engineers and physicists involved in fluid computations. An up-to-date account is given of the present state of the art of numerical methods employed in computational fluid dynamics. The underlying numerical principles are treated with a fair amount of detail, using elementary methods. Attention is given to the difficulties arising from geometric complexity of the flow domain. Uniform accuracy for singular perturbation problems is studied, pointing the way to accurate computation of flows at high Reynolds number. Unified methods for compressible and incompressible flows are discussed. A treatment of the shallow-water equations is included. A basic introduction is given to efficient iterative solution methods. Many pointers are given to the current literature, facilitating further study. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

II | 11 |

III | 18 |

IV | 23 |

V | 32 |

VI | 42 |

VII | 52 |

VIII | 62 |

XXX | 284 |

XXXI | 294 |

XXXII | 304 |

XXXIII | 311 |

XXXIV | 321 |

XXXV | 331 |

XXXVI | 343 |

XXXVII | 353 |

IX | 72 |

X | 82 |

XI | 91 |

XII | 101 |

XIII | 111 |

XIV | 124 |

XV | 134 |

XVI | 146 |

XVII | 156 |

XVIII | 166 |

XIX | 176 |

XX | 186 |

XXI | 192 |

XXII | 202 |

XXIII | 212 |

XXIV | 222 |

XXV | 232 |

XXVI | 242 |

XXVII | 251 |

XXVIII | 264 |

XXIX | 274 |

XXXVIII | 363 |

XXXIX | 373 |

XL | 383 |

XLI | 393 |

XLII | 403 |

XLIII | 412 |

XLIV | 422 |

XLV | 431 |

XLVI | 441 |

XLVII | 451 |

XLVIII | 460 |

XLIX | 470 |

L | 482 |

LI | 492 |

LII | 502 |

LIII | 512 |

LIV | 514 |

LV | 515 |

LVI | 516 |

LVII | 521 |

### Other editions - View all

Computing and Combinatorics: Third Annual International Conference, Cocoon ... Tao Jiang,D. T. Lee No preview available - 2014 |

### Common terms and phrases

adjacency matrices adjacent approximation assignment assume bidders bidding algorithm binary bipartite graphs c-ranking called circuit classes column complexity Computer Science consider constraints construct contains convex corresponding cost defined Definition denote distance edge element exists finite function genes genomes given graph G Hence Heuristic hypercube hypergraph identification matrices independent spanning trees input integer intersection interval graphs isomorphism labeled language leaf leaf-size Lemma length linear lower bound matrix maximal method minimal minimum morphism neighbor-joining node NP-complete nv-mc OBDD objects obtained optimal order-sorted packets paper parallel partitioning path permutation permutation graphs polygonal curve polynomial problem Proof prove quadtree r4-trees recursive regular language regular points representation respectively root routing rows satisfies scheme Section sequence solution spanning trees Steiner point step subset subtree symmetric Theorem threshold topology trapezoid variable ordering vector vertex vertices weight