Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Distributed-memory parallel algorithms for finding the eigenvalues and eigenvectors of a dense unsymmetric matrix are given. While several parallel algorithms have been developed for symmetric matrices, little work has been done on the unsymmetric case. Our parallel implementation proceeds in three major steps: reduction of the original matrix to Hessenberg form, application of the implicit double-shift QR algorithm to compute the eigenvalues, and back transformations to compute the eigenvectors. Several modifications to our parallel QR algorithm, including ring communication, pipelining and delayed updating are discussed and compared. Results and timings are given. 9 refs., 7 figs., 1 tab.
['George Al Geist', 'G. J. Davis']
I am writing a research paper on a idea Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
[{"from": "human", "value": "I am writing a research paper on a idea Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Distributed-memory parallel algorithms for finding the eigenvalues and eigenvectors of a dense unsymmetric matrix are given. While several parallel algorithms have been developed for symmetric matrices, little work has been done on the unsymmetric case. Our parallel implementation proceeds in three major steps: reduction of the original matrix to Hessenberg form, application of the implicit double-shift QR algorithm to compute the eigenvalues, and back transformations to compute the eigenvectors. Several modifications to our parallel QR algorithm, including ring communication, pipelining and delayed updating are discussed and compared. Results and timings are given. 9 refs., 7 figs., 1 tab."}]