| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10357856 | Journal of Computational Physics | 2005 | 16 Pages |
Abstract
The resulting algorithm is tested on several different grid types, some with very high degrees of stretching. The computational cost is found to scale almost linearly with the number of grid points, and parallel efficiencies of over 90% are achieved even for very coarse grids.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
J. Larsson, F.S. Lien, E. Yee,