Optimizing halley's iteration for computing the matrix polar decomposition

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 5, 2010, Pages 2700-2720

  Nakatsukasa, Yuji ^a   Bai, Zhaojun ^b   Gygi, François ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California Davis   (United States)

Author keywords

Halley's iteration; Inverse free iterations; Newton's iteration; Numerical stability; Polar decomposition; QR decomposition

Indexed keywords

HALLEY'S ITERATION; INVERSE FREE ITERATIONS; NEWTON'S ITERATION; NUMERICAL STABILITIES; POLAR DECOMPOSITIONS; Q R DECOMPOSITION;

ITERATIVE METHODS; NUMBER THEORY;

MATRIX ALGEBRA;

EID: 79251504591     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/090774999     Document Type: Article

References (29)

1. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. T. A. Arias, M. C. Payne, and J. D. Joannopoulos, Ab initio molecular-dynamics techniques extended to large-length-scale systems, Phys. Rev. B, 45 (1992), pp. 1538-1549.
3. G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing Communication in Linear Algebra, Technical report UCB/EECS-2009-62, Electrical Engineering and Computer Science, University of California, Berkeley, CA, 2009; also available as LAPACK Working Note 218.
4. R. Byers and H. Xu, A new scaling for Newton's iteration for the polar decomposition and its backward stability, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 822-843.
5. R. Byers and H. Xu, unpublished, 2001.
6. A. K. Cline, C. B. Moler, G. W. Stewart, and J. H. Wilkinson, An estimate for the condition number of a matrix, SIAM J. Numer. Anal., 16 (1979), pp. 368-375.
7. S. Crudge, The QR factorization and its applications, Master's thesis, University of Manchester, 1998.
8. J. Demmel, L. Grigori, M. Hoemmen, and J. Langou, Communication-avoiding parallel and sequential QR factorization, Technical report UCB/EECS-2008-74, Electrical Engineering and Computer Science, University of California, Berkeley, CA, 2008.
9. J.-L. Fattebert and F. Gygi, Linear scaling first-principles molecular dynamics with controlled accuracy, Comput. Phys. Comm., 162 (2004), pp. 24-36.
10. W. Gander, On Halley's iteration method, Amer. Math. Monthly, 92 (1985), pp. 131-134.
11. W. Gander, Algorithms for the polar decomposition, SIAM J. Sci. Comput., 11 (1990), pp. 1102-1115.
12. S. L. Graham, M. Snir, and C. A. Patterson, eds., Getting up to Speed, The Future of Supercomputing, The National Academies Press, Washington, DC, 2005.
13. F. Gygi, Architecture of Qbox: A scalable first-principles molecular dynamics code, IBM J. Res. Dev., 52 (2008), pp. 137-144.
14. F Gygi, E. W. Draeger, M. Schulz, B. R. de Supinski, J. A. Gunnels, V. Austel, J. C. Sexton, F. Franchetti, S. Kral, C. W. Ueberhuber, and J. Lorenz, Large-scale electronic structure calculations of high-Z metals on the Bluegene/L platform, in Proceedings of the 2006 ACM/IEEE Conference on Supercomputing, ACM, 2006.
15. B. Hadri, H. Ltaief, E. Agullo, and J. Dongarra, Tall and Skinny QR Matrix Factorization Using Tile Algorithms on Multicore Architectures, Technical report UT-CS-09-645, University of Tennessee, Knoxville, TN, 2009; also available as LAPACK Working Note 222.
16. W. W. Hager, Condition estimates, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 311-316.
17. D. J. Higham, Condition numbers and their condition numbers, Linear Algebra Appl., 214 (1995), pp. 193-213.
18. N. J. Higham, Computing the polar decomposition - with applications, SIAMJ.Matrix Anal. Appl., 7 (1986), pp. 1160-1174.
19. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
20. N. J. Higham, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, 2008.
21. N. J. Higham and P. Papadimitriou, A parallel algorithm for computing the polar decomposition, Parallel Comput., 20 (1994), pp. 1161-1173.
22. C. Kenney and A. J. Laub, On scaling Newton's method for polar decomposition and the matrix sign function, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 688-706.
23. A. Kiełbasiński and K. Ziȩtak, Numerical behaviour of Higham's scaled method for polar decomposition, Numer. Algorithms, 32 (2003), pp. 105-140.
24. A. Kiełbasiński and K. Ziȩtak, Note on "A new scaling for Newton's iteration for the polar decomposition and its backward stability" by R. Byers and H. Xu, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1538-1539.
25. B. Laszkiewicz and K. Ziȩtak, Approximation of matrices and a family of Gander methods for polar decomposition, BIT, 46 (2006), pp. 345-366.
26. J. Nie, private communication, 2009.
27. F. Song, A. YarKhan, and J. Dongarra, Dynamic Task Scheduling for Linear Algebra Algorithms on Distributed-Memory Multicore Systems, in Proceedings of the Conference on High Performance Computing, Networking, Storage and Analysis, ACM, 2009; also available as LAPACK Working Note 221.
28. J. F. Sturm, Using SeDuMi 1.02, A MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11-12 (1999), pp. 625-653.
29. Z. Zhang, H. Zha, and W. Ying, Fast parallelizable methods for the Hermitian eigenvalue problem, J. Comput. Math., 25 (2007), pp. 583-594.