Minimization of indirect addressing for edge-based field solvers (Q4543645): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/cnm.494 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128650947 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An unstructured grid-based, parallel free surface solver / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edges, stars, superedges and chains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some useful renumbering strategies for unstructured grids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Renumbering strategies for unstructured-grid solvers operating on shared-memory, cache-based parallel machines / rank | |||
Normal rank | |||
Latest revision as of 11:28, 4 June 2024
scientific article; zbMATH DE number 1777586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimization of indirect addressing for edge-based field solvers |
scientific article; zbMATH DE number 1777586 |
Statements
Minimization of indirect addressing for edge-based field solvers (English)
0 references
8 August 2002
0 references
grid renumbering
0 references
loop structure
0 references
vector-parallel machines
0 references
