Block and parallel versions of one-sided bidiagonalization

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 3, 2007, Pages 927-953

  Bosner, Nela ^a   Barlow, Jesse L ^b  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b The Pennsylvania State University   (United States)

Author keywords

Bidiagonalization; Block algorithm; Numerical analysis; Parallel algorithm; Singular value decomposition

Indexed keywords

APPLIED MATHEMATICS; CACHE UTILIZATION; EXECUTION TIME; NUMERICA L RESULTS; PARALLEL COMPUTATIONS; SINGULAR VALUES;

BOOLEAN FUNCTIONS; SINGULAR VALUE DECOMPOSITION; TREES (MATHEMATICS);

ERROR ANALYSIS;

EID: 48249107440     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050636723     Document Type: Article

References (32)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL, J. J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. J. HAMMARLING, A. MCKENNEY, AND D. C. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. J. L. BARLOW, More accurate bidiagonal reduction for computing the singular value decomposition, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 761-798.
3. J. L. BARLOW, N. BOSNER, AND Z. DRMAČ, A new stable bidiagonal reduction algorithm, Linear Algebra Appl., 397 (2005), pp. 35-84.
4. C. BISCHOF AND C. VAN LOAN, The WY representation for products of Householder matrices, SIAM J. Sci. Comput., 8 (1987), pp. s2-s13.
5. A. BJÖRCK AND C. C. PAIGE, Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 176-190.
6. L. S. BLACKFORD, J. CHOI, A. CLEARY, E. D'AZEVEDO, J. DEMMEL, I. DHILLON, J. J. DON-GARRA, S. J. HAMMARLING, G. HENRY, A. PETITET, K. STANLEY, D. WALKER, AND R. C. WHALEY, ScaLAPACK Users' Guide, SIAM, Philadelphia, 1997.
7. N. BOSNER, Fast methods for large scale singular value decomposition, Ph.D. thesis, Department of Mathematics, University of Zagreb, 2006, http://www.math.hr/~nela/eng.html.
8. N. BOSNER AND Z. DRMAČ, On accuracy properties of one-sided bidiagonalization algorithm and its applications, in Proceedings of the Conference on Applied Mathematics and Scientific Computing, Z. Drmač, M. Marušić, and Z. Tutek, eds., Springer, Dordrecht, 2005, pp. 141-150.
9. C. CAMPOS, D. GUERRERO LÓPEZ, V. HERNANDEZ, AND R. RALHA, Parallel bidiagonalization of a dense matrix, SIAM J. Matrix Anal. Appl., to appear.
10. T. F. CHAN, An improved algorithm for computing the singular value decomposition, ACM Trans. Math. Software, 8 (1982), pp. 72-83.
11. J. DEMMEL, S. C. EISENSTAT, J. R. GILBERT, X. S. LI, AND J. W. H. LIU, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 720-755.
12. J. DEMMEL AND K. VESELIĆ, Jacobi's method is more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204-1245.
13. J. J. DONGARRA, J. J. DUCROZ, S. J. HAMMARLING, AND R. J. HANSEN, An extended set of Fortran basic linear algebra subroutines, ACM Trans. Math. Software, 14 (1988), pp. 1-17.
14. J. J. DONGARRA, J. DU CROZ, S. J. HAMMARLING, AND I. S. DUFF, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
15. J. J. DONGARRA, J. DU CROZ, S. J. HAMMARLING, AND I. S. DUFF, Algorithm 679; A set of level 3 basic linear algebra subprogram: Model implementation and test programs, ACM Trans. Math. Software, 16 (1990), pp. 18-28.
16. J. J. DONGARRA, S. J. HAMMARLING, AND D. C. SORENSEN, Block reduction of matrices to condensed forms for eigenvalue computations, J. Comput. Appl. Math., 27 (1989), pp. 215-227.
17. Z. DRMAČ AND K. VESELIĆ, New fast and accurate Jacobi SVD algorithm: I, SIAM J. Matrix Anal. Appl., to appear.
18. Z. DRMAČ AND K. VESELIĆ, New fast and accurate Jacobi SVD algorithm: II, SIAM J. Matrix Anal. Appl., to appear.
19. K. V. FERNANDO AND B. N. PARLETT, Accurate singular values and differential qd algorithms, Numer. Math., 67 (1994), pp. 191-229.
20. G. GOLUB AND W. KAHAN, Calculating the singular values and pseudoinverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
21. G. H. GOLUB AND C. REINSCH, Singular value decomposition and least squares solutions, Numer. Math., 14 (1970), pp. 403-420.
22. W. GROPP, E. LUSK, AND A. SKJELLUM, Using MPI: Portable Parallel Programming with the Message Passing Interface, 2nd ed., Scientific and Engineering Computation Series, MIT Press, Cambridge, 1999.
23. B. GROSSER AND B. LANG, Efficient parallel reduction to bidiagonal form, Parallel Comput., 25 (1999), pp. 969-986.
24. 2) algorithm for the bidiagonal SVD, Linear Algebra Appl., 358 (2003), pp. 45-70.
25. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
26. G. HOWELL, C. FULTON, J. DEMMEL, S. J. HAMMARLING, AND K. MARMOL, Cache efficient bidiagonalization using BLAS 2.5 operators, Lapack Working Note 174, 2006.
27. C. L. LAWSON AND R. J. HANSON, Solving Least Squares Problems, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Englewood Cliffs, NJ, 1974.
28. R. RALHA, A new algorithm for singular value decompositions, in Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing, IEEE Press, Piscataway, NJ, 1994, pp. 240-244.
29. R. RALHA, One-sided reduction to bidiagonal form, Linear Algebra Appl., 358 (2003), pp. 219-238.
30. R. RALHA AND A. MACKIEWICZ, An efficient algorithm for the computation of singular values, in Proceedings of the III International Congress on Numerical Methods in Engineering, M. Doblaré, J. M. Correas, L. Gaverte, and M. Pastor, eds., SEMNI (Sociedad Española de Métodos Numéricos en Ingenieria), 1996, pp. 1371-1380.
31. H. D. SIMON AND H. ZHA, Low-rank matrix approximation using the Lanczos bidiagonalization process with applications, SIAM J. Sci. Comput., 21 (2000), pp. 2257-2274.
32. P. R. WILLEMS, B. LANG, AND C. VÖMEL, Computing the bidiagonal SVD using multiple relatively robust representations, Special Issue on Accurate Solution of Eigenvalue Problems, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 907-926.