Abstract:
Can you imagine doing hundreds of millions of operations on non-integers and not obtaining a single round-off error? For n < 12, the algorithm used in this thesis does exactly that. We took advantage of a floating point property that we have not seen used before. If only we had quad precision we could have gone even further and extended the algorithm without round-off error for higher values of 'n'. The problem in question concerns whether the eigenvalues are real or complex. The eigenvalues of an n-by-n real random matrix whose elements are independent random variables with standard normal are examined. An exact expression to determine the probability Pn,k that exactly k eigenvalues are real are derived in [1]. This expression was used to compute the probabilities Pn,k, but the computation was achieved only up to n = 9. For higher values of n, the symbolic expressions generated during the course of an algorithm to compute an exact probability as expressed in Mathematica code requires large amounts of memory. In this thesis, we target development of a more efficient algorithm. The symbolic algorithm implemented in Mathematica is converted into an equivalent numerical version and is implemented using MATLAB. After implementing the serial code in MATLAB, the code is parallelized using a client-server parallel computing platform named Star-p. This modified code implementation along with superior hardware in terms of better processor speeds and larger memory, has enabled the probability evaluation for all values of k up to n= 11, and for certain k values for n = 12 and 13.(cont.) An expression for the expected number of real eigenvalues En=o kpn,k is obtained in paper [2]. Results relating the rational and irrational parts of the summations n =o kpn,ki, En k=0 (Pk n,k and En= - n,k 0 k)Pn,k are conjectured. Three eigenvalue algorithms, the block Davidson, the block KrylovSchur and the Locally optimal Block Pre-conditioned Conjugate Gradient Method (LOBPCG) are analyzed and their performance on different types of matrices are studied. The performance of the algorithms as a function of the parameters , block size, number of blocks and the type of preconditioner is also examined in this thesis. The block Krylov Schur Algorithm for the matrices which are used for the experiments have proved to much superior to the others in terms of computation time. Also its been more efficient in finding eigenvalues for matrices representing grids with Neumann boundary conditions which have at least one zero eigenvalue. There exists one optimal combination of block size and number of blocks at which the time for eigenvalue computation is minimum. These parameters have different effects for different cases. The block Davidson algorithm has also been incorporated with the locking mechanism and this implementation is found to be much superior to its counterpart without the locking mechanism for matrices which have at least one zero eigenvalue.

Description:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from PDF version of thesis.Includes bibliographical references (p. 43-44).