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

Authors:
Iain S. Duff;Jennifer A. Scott
Affiliations:
Rutherford Appleton Lab, Oxford, UK;Rutherford Appleton Lab, Oxford, UK
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1999

Citing 2
Cited 3

A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
The design of a new frontal code for solving sparse, unsymmetric systems

ACM Transactions on Mathematical Software (TOMS)

A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)
An out-of-core sparse symmetric-indefinite factorization method

ACM Transactions on Mathematical Software (TOMS)
Experiences of sparse direct symmetric solvers

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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.