| タイトル | Algorithms and data structures for adaptive multigrid elliptic solvers |
| 本文（外部サイト） | http://hdl.handle.net/2060/19830021785 |
| 著者（英） | Vanrosendale, J. |
| 著者所属（英） | NASA Langley Research Center |
| 発行日 | 1983-06-01 |
| 言語 | eng |
| 内容記述 | Adaptive refinement and the complicated data structures required to support it are discussed. These data structures must be carefully tuned, especially in three dimensions where the time and storage requirements of algorithms are crucial. Another major issue is grid generation. The options available seem to be curvilinear fitted grids, constructed on iterative graphics systems, and unfitted Cartesian grids, which can be constructed automatically. On several grounds, including storage requirements, the second option seems preferrable for the well behaved scalar elliptic problems considered here. A variety of techniques for treatment of boundary conditions on such grids are reviewed. A new approach, which may overcome some of the difficulties encountered with previous approaches, is also presented. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 83N30056
ICASE-83-29
NAS 1.26:172158
NASA-CR-172158 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/162032 |
|
