We discuss the object-oriented design of a software package for solving sparse, symmetric systems of equations (positive definite and indefinite) by direct methods. At the highest layers, we decouple data structure classes from algorithmic classes for flexibility. We describe the important structural and algorithmic classes in our design, and discuss the trade-offs we made for high performance. The kernels at the lower layers were optimized by hand. Our results show no performance loss from our object-oriented design, while providing flexibility, ease of use, and extensibility over solvers using procedural design.
CITATION STYLE
Dobrian, F., Kumfert, G., & Pothen, A. (1998). Object-oriented design for sparse direct solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1505, pp. 207–214). Springer Verlag. https://doi.org/10.1007/3-540-49372-7_22
Mendeley helps you to discover research relevant for your work.