Abstract
The complexity of parallel Givens factorization on a shared memory architecture composed with p identical processors has been determined for square matrices [6]. For the rectangular case the problem of the optimality (construction and execution time of the optimal algorithm) is still open. In this paper we describe two parallel algorithms to compute the Givens factorization of a rectangular matrix of size mxn (m ≥ n). The first one is formulated for any m, n and p. Its execution time is equal to (mn-n(n+1)/2)/p +3p/2 + o (p). The second one is for p ≤ min(m/4, n/2). Its execution time is equal to (mn-n(n+1)/2)/p + p/2 + o(p) if m-n > p, and (mn-n(n+1)/2)/p + p + (m-n)(m-n-2p)/2p + o(p) if m-n ≤ p. We think that the second algorithm is asymptotically optimal and prove it for m=n.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BOJANCZYK A., BRENT R.P., KUNG H.T., "Numerically stable solution of dense systems of linear equations using mesh-connected processors", Tech. Rep, Carnegie Mellon University (1981)
CHAMBERLAIN R.M., POWELL M.J., "QR factorization for linear least-squares problems on hypercube multiprocessor", IMA J. Numerical Analysis 8, (1988) 401–413
COSNARD M., ROBERT Y., "Complexité de la factorisation QR en parallèle", C. R. Acad. Sc. Paris, 297, A, (1983) 549–552
COSNARD M., ROBERT Y., "Complexity of parallel QR decomposition", J. ACM 33 (4), (1986) 712–723
COSNARD M., DAOUDI E.M., MULLER J.M, ROBERT Y., "On parallel and systolic Givens factorisation of dense matrix", in Parallel Algorithms and Architectures, Eds. M. COSNARD et al., North-Holland (1986), 245–258
COSNARD M., DAOUDI E.M., ROBERT Y., "Complexity of parallel Givens factorization on shared memory architectures", Symposium on optimal algorithms, Bulgarie (1989), in Springer Verlag
COSNARD M., DAOUDI E.M., TOURANCHEAU B., "Communication dans les réseaux de processeurs et complexité des algorithmes", Actes Coll.C3, Angoulème (1987)
COSNARD M., MULLER J.M., ROBERT Y., "Parallel QR decompostion of a rectangular matrix", Numerische Mathematik 48, (1986) 239–249
CHU E., GEORGE A., "QR factorization of a dense matrix on a shared-memory multiprocessor", Parallel computing 11, (1989) 55–71
DAOUDI E.M., Etude de la complexité de la décomposition orthogonale d'une matrice sur plusieurs modèles d'architectures parallèles, Thèse de l'INP Grenoble, mai 1989.
GOLUB G.H., VAN LOAN C.F., Matrix Computations, The John Hopkins Univ. Press (1983)
LORD R.E., KOWALIK J.S., KUMAR S.P., "Solving linear algebraic equations on an MIMD computer", J. ACM 30 (1), (1983) 103–117
MODI J.J., CLARKE M.R.B., "An alternative Givens ordering", Numerische Mathematik 43, (1984) 83–90
POTHEN A., JHA S., VEMULAPATI U., "Orthogonal factorization on a distributed memory multiprocessor", Hypercube Multiprocessor 1987, Eds M.T. HEATH, 587–596
SAMEH A., "Solving the linear least squares problem on a linear array of processors", Proc. Purdue Workshop on algorithmically-specialized computer organizations, W. Lafayette, Indiana, September 1982
SAMEH A., "On some parallel algorithms on a ring of processors", Computer Phys. Com. 37 (1985) 159–166.
SAMEH A., KUCK D., "On stable parallel linear system solvers", J. ACM 25 (1), (1978) 81–91
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daoudi, E.M., Libert, G. (1990). Parallel givens factorization on a shared memory multiprocessor. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_94
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive