Publications

Search
Export 896 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is S  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Stewart G.W.  1998.  Two Simple Residual Bounds for the Eigenvalues of Hermitian Matrices. UMIACS-TR-89-123
Stewart G.W.  1998.  Incremental Condition Calculation and Column Selection. UMIACS-TR-90-87
Stewart G.W.  1997.  On markov chains with sluggish transients. Communications in Statistics. Stochastic Models. 13(1):85-94.
Stewart G.W.  2003.  On the powers of a matrix with perturbations. Numerische Mathematik. 96(2):363-376.
Stewart G.W.  2004.  An Elsner-like perturbation theorem for generalized eigenvalues. Linear Algebra and its Applications. 390:1-5.
Stewart G.W.  1999.  The QLP Approximation to the Singular Value Decomposition. SIAM Journal on Scientific Computing. 20(4):1336-1348.
Stewart G.W.  1998.  Four algorithms for the efficient computation of truncated pivoted QR approximation to a sparse matrix. TR-98-12
Stewart J, Raybourn E, Bederson BB, Druin A.  1998.  When Two Hands Are Better Than One: Enhancing Collaboration Using Single Display Groupware. CHI’98. Extended Abstracts. :287-288.
Stewart G.W.  2003.  Memory leaks in derived types revisited. SIGPLAN Fortran Forum. 22(3):25-27.
Stewart G.W.  2006.  A note on generalized and hypergeneralized projectors. Linear Algebra and its Applications. 412(2–3):408-411.
Stewart G.W.  2001.  On the eigensystems of graded matrices. Numerische Mathematik. 90(2):349-370.
Stewart G.W.  1997.  On the weighting method for least squares problems with linear equality constraints. BIT Numerical Mathematics. 37(4):961-967.
Stewart G.W.  1998.  Basic decompositions. 1
Stewart G.W.  1998.  Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix. UMIACS-TR-98-12
Stewart G.W.  1998.  Implementing an Algorithm for Solving Block Hessenberg Systems. UMIACS-TR-94-70
Stewart G.W.  1995.  On the perturbation of Schur complement in positive semidefinite matrix. TR-95-38
Stewart G.W.  2000.  An Arnoldi--Schur Algorithm for Large Eigenproblems. UMIACS-TR-2000-21
Stewart G.W.  2006.  The Gram-Schmidt Algorithm and Its Variations. UMIACS-TR-2004-84
Stewart G.W.  2005.  Error Analysis of the Quasi-Gram–Schmidt Algorithm. SIAM Journal on Matrix Analysis and Applications. 27(2):493-506.
Stewart G.W.  2001.  Matrix Algorithms: Eigensystems.
Stewart G.W.  2000.  A Generalization of Saad's Theorem on Rayleigh-Ritz Approximations. UMIACS-TR-99-78
Stewart G.W.  1998.  On the adjugate matrix. Linear Algebra and its Applications. 283(1–3):151-164.
Stewart G.W.  1995.  On the stability of sequential updates and downdates. Signal Processing, IEEE Transactions on. 43(11):2642-2648.
Stewart G.W.  2001.  Backward Error Bounds for Approximate Krylov Subspaces. UMIACS-TR-2001-32
Stewart G.W.  1995.  Theory of the Combination of Observations Least Subject to Errors. SIAM, Philadelphia.[Translation of Gauss (1821, 1823, 1826).].

Pages