Component-based iterative methods for sparse linear systems

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Iterative methods play an important role in solving large-scale systems of linear equations that arise in real-world applications. Due to numerous linear system properties that may affect the solution, it is rather difficult for a user to develop a good sparse linear system solver from scratch. Thus, various collections of solution methods are made available to the user. One such software package is SPARSKIT, which is well known in the scientific community. Written in FORTRAN77 and provided with a cumbersome interface, it is considered, however, a legacy code. Our objective is to enable its wider usage in modern applications and to facilitate further SPARSKIT enhancements. Applying a 'peer-component' design, we have created a set of SPARSKIT components that: (a) incorporate both original and new iterative methods; (b) are readily extensible with more methods; (c) may be connected to applications in a component framework; and (d) provide access from a variety of programming languages. Tools available from the Common Component Architecture (CCA) Forum enabled our component design of SPARSKIT. Copyright © 2006 John Wiley & Sons, Ltd.

Cite

CITATION STYLE

APA

Jones, J., Sosonkina, M., & Saad, Y. (2007). Component-based iterative methods for sparse linear systems. In Concurrency and Computation: Practice and Experience (Vol. 19, pp. 625–635). John Wiley and Sons Ltd. https://doi.org/10.1002/cpe.1057

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