Ming Gu

Primary Research Area: 
Applied Mathematics
Research Interests: 
Numerical linear algebra, Scientific computing
Contact Information
861 Evans Hall
mgu [at] math [dot] berkeley [dot] edu
+1 (510) 642-3145
Selected Publications: 
  1. Chandrasekaran, Shiv and Gu, Ming and Xia, Jianlin and Zhu, Jiang (2008). A fast QR algorithm for companion matrices. In Recent advances in matrix and operator theory Oper. Theory Adv. Appl. 179 111-143 Birkhäuser Basel. [MR] [GS?]
  2. Nie, Jiawang and Demmel, James and Gu, Ming (2008). Global minimization of rational functions and the nearest GCDs. J. Global Optim. 40 No.4, 697-718. [MR] [GS?]
  3. Chandrasekaran, S. and Gu, M. and Sun, X. and Xia, J. and Zhu, J. (2007). A superfast algorithm for Toeplitz systems of linear equations. SIAM J. Matrix Anal. Appl. 29 No.4, 1247-1266. [MR] [GS?]
  4. Chandrasekaran, S. and Dewilde, P. and Gu, M. and Lyons, W. and Pals, T. (2006/07). A fast solver for HSS representations via sparse matrices. SIAM J. Matrix Anal. Appl. 29 No.1, 67-81 (electronic). [MR] [GS?]
  5. Chandrasekaran, S. and Gu, M. and Pals, T. (2006). A fast ULV decomposition solver for hierarchically semiseparable representations. SIAM J. Matrix Anal. Appl. 28 No.3, 603-622 (electronic). [MR] [GS?]
  6. J. XIA, S. Chandrasekaran, M. Gu, and X.S. Li (2009). Superfast multifrontal method for large structured linear systems of equations. SIAM J. Matrix Anal. Appl. 31, No.3,  1382–1411.
  7. M. Gu (2013). Subspace iteration randomization and singular value problems. Submitted to SISC.