Courant Institute of Mathematical Sciences

About: Courant Institute of Mathematical Sciences is a education organization based out in New York, New York, United States. It is known for research contribution in the topics: Nonlinear system & Boundary value problem. The organization has 2414 authors who have published 7759 publications receiving 439773 citations. The organization is also known as: CIMS & New York University Department of Mathematics.

A Detached Shock Calculation by Second Order Finite Differences

Abstract: A detached shock problem for a symmetric curved convex cylindrical body moving parallel to its plane of symmetry was solved by using a third-order accurate Richtmyer form of the Lax-Wendroff conservation equations. One innovation is an easy to use “artificial viscosity” term which preserves the high order of accuracy of the calculation while removing the nonlinear instabilities which otherwise appear in the shock region and near boundaries. Another innovation is a simple transformation of Cartesian space which changes the curved body into a straight line, thus reducing the large number of special points and irregularly shaped mesh regions which would otherwise appear in the difference method calculation. Such transformations are shown to preserve the conservation property of the system of differential equations. Other aspects of the third-order artificial viscosity term and the transformation are discussed. The results of a numerical calculation on a CDC 6600 computer are compared with known results.

CHAPTER 3 – Perfect Graphs

Abstract: Publisher Summary Th perfect graph satifies the following properties: (P1): ω(GA) + χ(GA) (for all A⊆V) and (P2): α(GA ) + k(GA) (for all A⊆V). It is clear by duality that a graph G satisfies (P1) if its complement satisfies (P2). A much stronger result was conjectured by Berge, cultivated by Fulkerson, and finally proven by Lovâsz, namely, that (P1 and (P 2 ) are equivalent. This has become known as the perfect graph theorem. This chapter presents the proof of this theorem.

Introducing efficient parallelism into approximate string matching and a new serial algorithm

Abstract: Consider the stnng matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present parallel and serial algorithms for finding all occurrences of the pattern in the text with at most k differences. The first part of the parallel algorithm consists of analysis of the pattern and takes 0 (log m ) time using m 2 processors. The rest of the algorithm consists of handling the text. The text han1. The research of this author was supported by NSF grants NSF-DCR-8318874 and NSF-DCR-8413359 and ONR grant