A compact database scheme for the partitioned frontal solution algorithm
✍ Scribed by Lin, Hong-Tsung
- Publisher
- Wiley (John Wiley & Sons)
- Year
- 1988
- Tongue
- English
- Weight
- 418 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0748-8025
No coin nor oath required. For personal study only.
✦ Synopsis
A compact and effective data structure for memory management is introduced for front partitioning under relatively small memory capacity. The algorithm indexes frontal equations in a special database form and provides the frontal solver with the necessary coefficients for the Gaussian elimination process. If symmetry exists in frontal equations, only the upper/lower-triangular part is accessed. An adjustable memory buffer is implemented to minimize data input/output operations in the database file. Ease of implementation is demonstrated (about 100 FORTRAN statements) in an existing coding. This development is advantageous for (but not restricted to) micro/minicomputer environments because of the compactness in coding and the efficiency in the access to the mass storage (requires at most the size of coefficients of the largest frontal). Results obtained on microcomputers using this scheme are given, together with comparisons. Other possible applications of the scheme are discussed.