The use of unstructured mesh codes on parallel machines can be one of the most e cient ways to solve large Computational Fluid Dynamics (CFD) and Computational Mechanics (CM) problems. Completely general geometries and complex behaviour can readily be modelled and, in principle, the inherent sparsity of many such problems can be exploited to obtain excellent parallel e ciencies. An important co...

With the dramatic proliferation of case based reasoning sys tems in commercial applications many case bases are now becoming legacy systems They represent a signi cant portion of an organization s assets but they are large and di cult to maintain One of the contribut ing factors is that these case bases are often large and yet unstructured they are represented in natural language text Adding to...

Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this coll...

Funct onal ty for Unstructured Meshes and Var ables One of the important and powerful functions in the UDM library is the management of unstructured meshes and variables. The library supports a broad range of unstructured meshes, which include meshes with fixed shapes, arbitrary polygons, and arbitrary polyhedrons. A mesh element may be a zone, or face, or edge; i.e., zone-mesh, face-mesh, and ...

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...

An approximation scheme for the evolutive Hamilton-Jacobi equation associated with the nite horizon deterministic problem is presented. The scheme allows a variable time step and can be applied to structured and unstructured grids. Depending on the regularity of the value function di erent orders of convergence are proved. In particular, under Lipschitz assumptions the convergence behavior of c...