A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We describe the design, implementation, and performance of a frontal code for the solution of large sparse symmetric systems of linear finite-element equations. The code is intended primarily for positive-definite systems, since numerical pivoting is not performed. The resulting software package, MA62, will be included in the Harwell Subroutine Library. We illustrate the performance of our new code on a range of problems arising from real engineering and industrial applications. The performance of the code is compared with that of the Harwell Subroutine Library general frontal solver MA42 and with other positive-definite codes from the Harwell Subroutine Library. Categories and Subject Descriptors: G.1.0 [Numerical Analysis]: General - Numerical algorithms; G.1.3 [Numerical Analysis]: Numerical Linear Algebra - Sparse, structured and very large systems (direct and iterative methods).

Cite

CITATION STYLE

APA

Duff, I. S., & Scott, J. A. (1999). A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications. ACM Transactions on Mathematical Software, 25(4), 404–424. https://doi.org/10.1145/332242.332243

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free