Summary
Iterative solvers based on Krylov subspace techniques form an important collection of tools for numerical linear algebra. The family of generic solvers is made up of a large number of slightly different algorithms with slightly different properties, which leads to redundancy when implementing them. To overcome this, we build the algorithms out of modular parts, which also makes the connections between the algorithms explicit. In addition to the design of this toolkit, we present here a summary of our initial investigations into automatic compiler optimisations of the code for the algorithms built from these parts. These optimisations are intended to mitigate the inefficiency introduced by modularity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Victor Eijkhout. Overview of iterative linear system solver packages. NHSE review, 3, 1998.
Stephen Watt et al. Aldor. http://www.aldor.org.
Anne Greenbaum. Iterative methods for solving linear systems. Society for Industrial and Applied Mathematics, 1997.
Martin H. Gutknecht and Klaus J. Ressel. Look-ahead procedures for Lanczostype product methods based on three-term Lanczos recurrences. SIAM Journal on Matrix Analysis and Applications, 21(4):1051–1078, 2000.
C.C. Paige and M.A. Saunders. Solution of sparse indefinite systems of linear equations. SIAM Journal Numerical Analysis, 12:617–629, 1975.
Y. Saad. Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, 2003.
T.J. Ashby, A.D. Kennedy, and M.F.P. O’Boyle. Cross component optimisation in a high level category-based language. Submitted to: EUROPAR 2004.
Todd L. Veldhuizen. Expression templates. C++ Report, 7(5):26–31, June 1995. Reprinted in C++ Gems, ed. Stanley Lippman.
R. Clint Whaley, Antoine Petitet, and Jack J. Dongarra. Automated empirical optimizations of software and the ATLAS project. Parallel Computing, 27(1-2):3–35, 2001.
Thorsten H.-G. Zörner and Rinus Plasmeijer. Solving linear systems with functional programming languages. In Implementation of Functional Languages’ 98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashby, T., Kennedy, A., O’Boyle, M. (2005). A Modular Iterative Solver Package in a Categorical Language. In: Bori~i, A., Frommer, A., Joó, B., Kennedy, A., Pendleton, B. (eds) QCD and Numerical Analysis III. Lecture Notes in Computational Science and Engineering, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28504-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-28504-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21257-7
Online ISBN: 978-3-540-28504-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)