caa a22 4500 465774288 CHVBK 20180323111937.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02023056 doi (NATIONALLICENCE)springer-10.1007/BF02023056 Park Haesun Department of Computer Science, EE/CSci Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA aut Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor [Elektronische Daten] [Haesun Park] On parallel architectures, Jacobi methods for computing the singular value decomposition (SVD) and the symmetric eigenvalue decomposition (EVD) have been established as one of the most popular algorithms due to their excellent parallelism. Most of the Jacobi algorithms for distributed-memory architectures have been developed under the assumption that matrices can be distributed over the processors by square blocks of an even order or column blocks with an even number of columns. Obviously, there is a limit on the number of processors while we need to deal with problems of various sizes. We propose algorithms to diagonalize oversized matrices on a given distributed-memory multiprocessor with good load balancing and minimal message passing. Performances of the proposed algorithms vary greatly, depending on the relation between the problem size and the number of available processors. We give theoretical performance analyses which suggest the faster algorithm for a given problem size on a given distributed-memory multiprocessor. Finally, we present a new implementation for the convergence test of the algorithms on a distributed-memory multiprocessor and the implementation results of the algorithms on the NCUBE/seven hypercube architecture. J.C. Baltzer AG, Scientific Publishing Company, 1990 Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 22/1(1990-12-01), 253-269 0254-5330 22:1<253 1990 22 10479 https://doi.org/10.1007/BF02023056 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02023056 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Park Haesun Department of Computer Science, EE/CSci Bldg., University of Minnesota, 200 Union Street SE, 55455, Minneapolis, Minnesota, USA aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 22/1(1990-12-01), 253-269 0254-5330 22:1<253 1990 22 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer