G. W. Stewart On the Structure of Nearly Uncoupled Markov Chains. [Citation Graph (0, 0)][DBLP] Computer Performance and Reliability, 1983, pp:287-302 [Conf]
G. W. Stewart Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:6, pp:365-367 [Journal]
G. W. Stewart Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:6, pp:369-371 [Journal]
G. W. Stewart Remark on algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:750- [Journal]
G. W. Stewart A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives. [Citation Graph (0, 0)][DBLP] J. ACM, 1967, v:14, n:1, pp:72-83 [Journal]
G. W. Stewart Communication and matrix computations on large message passing systems. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1990, v:16, n:1, pp:27-40 [Journal]
Zhaojun Bai, G. W. Stewart Algorithm 776: SRRIT: A Fortran Subroutine to Calculate the Dominant Invariant Subspace of N nonsymmetric Matrix. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 1997, v:23, n:4, pp:494-513 [Journal]
G. W. Stewart Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2]. [Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 1976, v:2, n:3, pp:275-280 [Journal]