We describethe design, implementation, and performance of a frontal code for the solution of large, sparse, unsymmetric systems of linear equations. The resulting software package, MA42, is included in Release 11 of the Harwell Subroutine Library and is intended to supersede the earlier MA32 package. We discuss in detail the extensive use of higher-level BLAS kernels within MA42 and illustrate the performance on a range of practical problems on a CRAY Y-MP, an IBM 3090, and an IBM RISC System/6000. We examine extending the frontal solution scheme ti use multiple fronts to allow MA42 tn be run in parallel. We indicate some directions for future development
In nite element simulations, the overall computing time is dominated by the time needed to solve lar...
We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. A new...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...
We consider the implementation of a frontal code for the solution of large sparse unsymmetric linear...
In recent years there have been a number of important developments in frontal algorithms for solving...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--93-064) / BLDSC - Bri...
We describe the design, implementation, and performance of a frontal code for the solution of large ...
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of...
We report on the design and development of a parallel frontal code HSL–MP43 for the numerical soluti...
3.00SIGLELD:9091.9F(AERE-R--10079). / BLDSC - British Library Document Supply CentreGBUnited Kingdo
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
The purpose of this paper is to discuss the linear solution of equality constrained problems by usin...
In nite element simulations, the overall computing time is dominated by the time needed to solve lar...
We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. A new...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...
We consider the implementation of a frontal code for the solution of large sparse unsymmetric linear...
In recent years there have been a number of important developments in frontal algorithms for solving...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--93-064) / BLDSC - Bri...
We describe the design, implementation, and performance of a frontal code for the solution of large ...
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of...
We report on the design and development of a parallel frontal code HSL–MP43 for the numerical soluti...
3.00SIGLELD:9091.9F(AERE-R--10079). / BLDSC - British Library Document Supply CentreGBUnited Kingdo
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
We discuss the organization of frontal matrices in multifrontal methods for the solution of large sp...
The purpose of this paper is to discuss the linear solution of equality constrained problems by usin...
In nite element simulations, the overall computing time is dominated by the time needed to solve lar...
We consider the solution of both symmetric and unsymmetric systems of sparse linear equations. A new...
Gary Kumfert and Alex Pothen have improved the quality and run time of two ordering algorithms for m...