Abstract
Many fundamental problems in scientific computing have more than one solution method. It is not uncommon for alternative solution methods to represent different tradeoffs between solution cost and reliability. Furthermore, the performance of a solution method often depends on the numerical properties of the problem instance and thus can vary dramatically across application domains. In such situations, it is natural to consider the construction of a multi-method composite solver to potentially improve both the average performance and reliability. In this paper, we provide a combinatorial framework for developing such composite solvers. We provide analytical results for obtaining an optimal composite from a set of methods with normalized measures of performance and reliability. Our empirical results demonstrate the effectiveness of such optimal composites for solving large, sparse linear systems of equations.
This work has been funded in part by the National Science Foundation through grants NSF CCR-981334, NSF ACI-0196125, and NSF ACI-0102537.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barrett, R., Berry, M., Dongarra, J., Eijkhout, V., Romine, C.: Algorithmic Bombardment for the Iterative Solution of Linear Systems: A PolyIterative Approach. Journal of Computational and applied Mathematics, 74, (1996) 91–110
Bramley, R., Gannon, D., Stuckey, T., Villacis, J., Balasubramanian, J., Akman, E., Berg, F., Diwan, S., Govindaraju, M.:Component Architectures for Distributed Scientific Problem Solving. To appear in a special issue of IEEE Computational Science and Eng., 2001
Golub, G.H., Van Loan, C.F.: Matrix Computations (3rd Edition). The John Hopkins University Press, Baltimore Maryland (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhowmick, S., Raghavan, P., Teranishi, K. (2002). A Combinatorial Scheme for Developing Efficient Composite Solvers. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46080-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-46080-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43593-8
Online ISBN: 978-3-540-46080-0
eBook Packages: Springer Book Archive