A MIMD implementation of a parallel Euler solver for unstructured grids (Q973415): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient massively parallel Euler solver for two-dimensional unstructured grids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cost Trade-offs in Graph Embeddings, with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:46, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A MIMD implementation of a parallel Euler solver for unstructured grids |
scientific article |
Statements
A MIMD implementation of a parallel Euler solver for unstructured grids (English)
0 references
31 May 2010
0 references
Unstructured grids
0 references
Euler equations
0 references
MIMD computers
0 references
partitioning of grids
0 references
