Neural networks for predicting the behavior of preconditioned iterative solvers

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

Volumn 4487 LNCS, Issue , 2007, Pages 302-309

  Holloway, America ^a   Chen, Tzu Yi ^a  

^a POMONA COLLEGE   (United States)

Author keywords

Iterative methods; Neural networks; Preconditioners

Indexed keywords

ITERATIVE METHODS; LINEAR SYSTEMS; PROBLEM SOLVING;

ADDITIONAL COMPUTATION; ITERATIVE SOLVERS; PRECONDITIONERS;

NEURAL NETWORKS;

EID: 37249082693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72584-8_39     Document Type: Conference Paper

References (13)

1. T.-Y. Chen.: Preconditioning sparse matrices for computing eigenvalues and solving linear systems of equations. PhD thesis, University of California at Berkeley (December 2001)
2. E. Chow and Y. Saad.: Experimental study of ILU preconditioners for indefinite matrices. J. Comp, and Appl. Math. 16 (1997) 387-414
3. S. Xu, E. Lee, and J. Zhang.: An interim report on preconditioners and matrices. Technical Report Technical Report 388-03, Department of Computer Science, University of Kentucky (2003)
4. S. Bhowmick, V. Eijkhout, Y. Freund, E. Fuentes, and D. Keyes.: Application of machine learning to the selection of sparse linear solvers. Submitted (2006)
5. S. Xu and J. Zhang.: Solvability prediction of sparse matrices with matrix structure-based preconditioners. In Proceedings of Preconditioning 2005, Atlanta, Georgia (May 2005)
6. T. M. Mitchell.: Machine Learning. McGraw-Hill (1997)
7. T. Davis.: University of Florida sparse matrix collection. NA Digest, Vol. 92, No. 42 (Oct. 16, 1994) and NA Digest, Vol. 96, No. 28 (Jul. 23, 1996) and NA Digest, Vol. 97, No. 23 (June 7, 1997) Available at: http://www.cise.ufl. edu/research/sparse/matrices/.
8. T.-Y. Chen.: ILUTP_Mem: A space-efficient incomplete LU preconditioner. In A.Laganà,M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K. Tan, and O. Gervasi (eds.), Proceedings of the 2004 International Conference on Computational Science and its Applications, volume 3046 of LNCS. (2004) 31-39
9. Y. Saad and M. H. Schultz.: GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3) (July 1986) 856-869
10. I. S. Duff and J. Koster.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20(4) (1999) 889-901
11. I. S. Duff and J. Koster.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22(4)(2001) 973-996.
12. T. Davis, J. Gilbert, S. Larimore, and E. Ng.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans, on Math. Softw. 30(3) (September 2004) 377-380
13. T. Davis, J. Gilbert, S. Larimore, and E. Ng. A column approximate minimum degree ordering algorithm. ACM Trans. on Math. Softw. 30(3) (September 2004) 353-376