A combinatorial scheme for developing efficient composite solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2330 LNCS, Issue PART 2, 2002, Pages 325-334

  Bhowmick, Sanjukta ^a   Raghavan, Padma ^a   Teranishi, Keita ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; RELIABILITY;

ALTERNATIVE SOLUTIONS; ANALYTICAL RESULTS; MEASURES OF PERFORMANCE; NUMERICAL PROPERTIES; PERFORMANCE AND RELIABILITIES; PROBLEM INSTANCES; SOLUTION METHODS; SPARSE LINEAR SYSTEMS;

NUMERICAL METHODS;

EID: 23044532053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46080-2_34     Document Type: Conference Paper

References (3)

1. 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.
2. 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.
3. Golub, G.H., Van Loan, C.F.: Matrix Computations (3rd Edition). The John Hopkins University Press, Baltimore Maryland (1996).