Parallel Evolutionary Computation in Very Large Scale Eigenvalue Problems

The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions. This paper reports on a new method for finding eigenvalues of very large matrices by a synthesis of evolutionary computation, parallel programming, and empirical stochastic search. The direct design of our method has the added advantage that it could be adapted to extend many algorithmic variants of solutions of generalized eigenvalue problems to improve the accuracy of our algorithms. The preliminary evaluation results are encouraging and demonstrate the method's efficiency and practicality.

[1]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[2]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[3]  William G. Poole,et al.  A geometric theory for the QR, LU and power iterations. , 1973 .

[4]  Robert Schreiber,et al.  Efficient, Massively Parallel Eigenvalue Computation , 1993, Int. J. High Perform. Comput. Appl..

[5]  Robert A. van de Geijn,et al.  A flexible class of parallel matrix multiplication algorithms , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  D. Calvetti,et al.  AN IMPLICITLY RESTARTED LANCZOS METHOD FOR LARGE SYMMETRIC EIGENVALUE PROBLEMS , 1994 .

[8]  Xuebin Chi,et al.  An Implementation of Parallel Eigenvalue Computation Using Dual-Level Hybrid Parallelism , 2007, ICA3PP.

[9]  D. S. SzyId,et al.  Parallel Computation: Models And Methods , 1998, IEEE Concurrency.

[10]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[11]  Takahiro Katagiri,et al.  An efficient implementation of parallel eigenvalue computation for massively parallel processing , 2000, Parallel Comput..

[12]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[13]  Roger G. Grimes,et al.  Solving systems of large dense linear equations , 1988, The Journal of Supercomputing.

[14]  Wen Lea Pearn,et al.  (Journal of Computational and Applied Mathematics,228(1):274-278)Optimization of the T Policy M/G/1 Queue with Server Breakdowns and General Startup Times , 2009 .

[15]  Victor Y. Pan,et al.  Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System , 2001, IEEE Trans. Computers.

[16]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[17]  A. D. Sneyd,et al.  The acceleration of matrix power methods by cyclic variations of the shift parameter , 1989 .

[18]  H. Rutishauser.  Simultaneous iteration method for symmetric matrices , 1970 .

[19]  Henk A. van der Vorst,et al.  Approximate solutions and eigenvalue bounds from Krylov subspaces , 1995, Numer. Linear Algebra Appl..

[20]  Selim G. Akl.  Parallel computation: models and methods , 1997 .