![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
G. W. Stewart
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j53]G. W. Stewart:
A Canonical CS Representation of a Pair of Subspaces. SIAM J. Matrix Anal. Appl. 37(2): 539-549 (2016) - 2015
- [j52]Nicola Guglielmi
, Michael L. Overton, G. W. Stewart:
An Efficient Algorithm for Computing the Generalized Null Space Decomposition. SIAM J. Matrix Anal. Appl. 36(1): 38-54 (2015) - 2013
- [j51]Michael O. Lam
, Jeffrey K. Hollingsworth, G. W. Stewart:
Dynamic floating-point cancellation detection. Parallel Comput. 39(3): 146-155 (2013) - 2011
- [j50]G. W. Stewart:
On the Numerical Analysis of Oblique Projectors. SIAM J. Matrix Anal. Appl. 32(1): 309-348 (2011)
2000 – 2009
- 2009
- [j49]G. W. Stewart:
On the Semidefinite B-Arnoldi Method. SIAM J. Matrix Anal. Appl. 31(3): 1458-1468 (2009) - 2008
- [j48]G. W. Stewart:
Block Gram--Schmidt Orthogonalization. SIAM J. Sci. Comput. 31(1): 761-775 (2008) - [j47]Che-Rung Lee, G. W. Stewart:
Algorithm 879: EIGENTEST - a test matrix generator for large-scale eigenproblems. ACM Trans. Math. Softw. 35(1): 7:1-7:11 (2008) - 2007
- [p1]G. W. Stewart:
Commentary. Milestones in Matrix Computation 2007: 457-466 - 2005
- [j46]G. W. Stewart:
Error Analysis of the Quasi-Gram-Schmidt Algorithm. SIAM J. Matrix Anal. Appl. 27(2): 493-506 (2005) - [j45]Michael W. Berry
, Shakhina A. Pulatova, G. W. Stewart:
Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices. ACM Trans. Math. Softw. 31(2): 252-269 (2005) - 2003
- [j44]G. W. Stewart:
On the powers of a matrix with perturbations. Numerische Mathematik 96(2): 363-376 (2003) - 2002
- [j43]G. W. Stewart:
A Krylov-Schur Algorithm for Large Eigenproblems. SIAM J. Matrix Anal. Appl. 23(3): 601-614 (2002) - [j42]G. W. Stewart:
Addendum to "A Krylov-Schur Algorithm for Large Eigenproblems". SIAM J. Matrix Anal. Appl. 24(2): 599-601 (2002) - [j41]G. W. Stewart:
Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods. SIAM J. Sci. Comput. 24(1): 201-207 (2002) - 2001
- [j40]Zhongxiao Jia, G. W. Stewart:
An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70(234): 637-647 (2001) - [j39]G. W. Stewart:
On the eigensystems of graded matrices. Numerische Mathematik 90(2): 349-370 (2001) - 2000
- [j38]G. W. Stewart:
The decompositional approach to matrix computation. Comput. Sci. Eng. 2(1): 50-59 (2000) - [j37]Misha E. Kilmer, G. W. Stewart:
Iterative Regularization and MINRES. SIAM J. Matrix Anal. Appl. 21(2): 613-628 (2000)
1990 – 1999
- 1999
- [j36]G. W. Stewart:
Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix. Numerische Mathematik 83(2): 313-323 (1999) - [j35]G. W. Stewart:
The QLP Approximation to the Singular Value Decomposition. SIAM J. Sci. Comput. 20(4): 1336-1348 (1999) - 1998
- [j34]Ronald F. Boisvert, Jack J. Dongarra, Roldan Pozo, Karin A. Remington, G. W. Stewart:
Developing numerical libraries in Java. Concurr. Pract. Exp. 10(11-13): 1117-1129 (1998) - [j33]Michael Stewart, G. W. Stewart:
On Hyperbolic Triangularization: Stability and Pivoting. SIAM J. Matrix Anal. Appl. 19(4): 847-860 (1998) - [i1]Ronald F. Boisvert, Jack J. Dongarra, Roldan Pozo, Karin A. Remington, G. W. Stewart:
Developing numerical libraries in Java. CoRR cs.MS/9809009 (1998) - 1997
- [j32]Xiao-Wen Chang, Christopher C. Paige, G. W. Stewart:
Perturbation Analyses for the QR Factorization. SIAM J. Matrix Anal. Appl. 18(3): 775-791 (1997) - [j31]Zhaojun Bai, G. W. Stewart:
Algorithm 776: SRRIT: A Fortran Subroutine to Calculate the Dominant Invariant Subspace of N nonsymmetric Matrix. ACM Trans. Math. Softw. 23(4): 494-513 (1997) - 1996
- [j30]Urs von Matt, G. W. Stewart:
Rounding errors in solving block Hessenberg systems. Math. Comput. 65(213): 115-135 (1996) - 1995
- [j29]G. W. Stewart:
On the solution of block Hessenberg systems. Numer. Linear Algebra Appl. 2(3): 287-296 (1995) - [j28]G. W. Stewart:
On the stability of sequential updates and downdates. IEEE Trans. Signal Process. 43(11): 2642-2648 (1995) - 1994
- [j27]G. W. Stewart:
Updating URV Decompositions in Parallel. Parallel Comput. 20(2): 151-172 (1994) - [j26]K. J. Ray Liu, Dianne P. O'Leary, G. W. Stewart, Yuan-Jye Jason Wu:
URV ESPRIT for tracking time-varying signals. IEEE Trans. Signal Process. 42(12): 3441-3448 (1994) - 1993
- [j25]G. W. Stewart:
Updating a Rank-Revealing ULV Decomposition. SIAM J. Matrix Anal. Appl. 14(2): 494-499 (1993) - [j24]G. W. Stewart:
On the Perturbation of LU, Cholesky, and QR Factorizations. SIAM J. Matrix Anal. Appl. 14(4): 1141-1145 (1993) - [j23]G. W. Stewart:
Topics in Matrix Analysis (Roger A. Horn and Charles R. Johnson). SIAM Rev. 35(1): 168-169 (1993) - [j22]G. W. Stewart:
On the Early History of the Singular Value Decomposition. SIAM Rev. 35(4): 551-566 (1993) - [j21]Alan Edelman, G. W. Stewart:
Scaling for orthogonality. IEEE Trans. Signal Process. 41(4): 1676-1677 (1993) - [c5]K. J. Ray Liu, Dianne P. O'Leary, G. W. Stewart, Yuan-Jye Jason Wu:
An adaptive ESPRIT based on URV decomposition. ICASSP (4) 1993: 37-40 - 1992
- [j20]G. W. Stewart:
An updating algorithm for subspace tracking. IEEE Trans. Signal Process. 40(6): 1535-1541 (1992) - [c4]M. F. Griffin, E. C. Boman, G. W. Stewart:
Minimum-norm updating with the rank-revealing URV decomposition. ICASSP 1992: 293-296 - 1991
- [c3]G. Adams, M. F. Griffin, G. W. Stewart:
Direction-of-arrival estimation using the rank-revealing URV decomposition. ICASSP 1991: 1385-1388 - 1990
- [j19]G. W. Stewart:
Communication and matrix computations on large message passing systems. Parallel Comput. 16(1): 27-40 (1990) - [j18]G. W. Stewart:
Stochastic Perturbation Theory. SIAM Rev. 32(4): 579-610 (1990)
1980 – 1989
- 1988
- [j17]Duncan A. Buell
, David A. Carlson, Yuan-Chieh Chow, Karel Culík, Narsingh Deo, Raphael A. Finkel, Elias N. Houstis, Elaine M. Jacob Son, Zvi M. Kedem, Janusz S. Kowalik, Philip Kuekes, Joanne L. Martin, George A. Michael, Neil S. Ostlund, Jerry Potter, D. K. Pradhan, Michael J. Quinn, G. W. Stewart, Quentin F. Stout
, Layne T. Watson, Jon Webb:
Parallel algorithms and architectures report of a workshop. J. Supercomput. 1(3): 301-325 (1988) - 1987
- [j16]G. W. Stewart:
A parallel implementation of the QR-algorithm. Parallel Comput. 5(1-2): 187-196 (1987) - [j15]Dianne P. O'Leary, G. W. Stewart:
From Determinacy to Systaltic Arrays. IEEE Trans. Computers 36(11): 1355-1359 (1987) - 1986
- [j14]G. W. Stewart:
Corrigendum: "A Note on Complex Division". ACM Trans. Math. Softw. 12(3): 285 (1986) - 1985
- [j13]Dianne P. O'Leary, G. W. Stewart:
Data-Flow Algorithms for Parallel Matrix Computations. Commun. ACM 28(8): 840-853 (1985) - [j12]Philip E. Gill, Walter Murray, Michael A. Saunders, G. W. Stewart, Margaret H. Wright:
Properties of a representation of a basis for the null space. Math. Program. 33(2): 172-186 (1985) - [j11]G. W. Stewart:
A Note on Complex Division. ACM Trans. Math. Softw. 11(3): 238-241 (1985) - 1983
- [j10]G. W. Stewart:
Computable Error Bounds for Aggregated Markov Chains. J. ACM 30(2): 271-285 (1983) - [c2]G. W. Stewart:
On the Structure of Nearly Uncoupled Markov Chains. Computer Performance and Reliability 1983: 287-302 - 1981
- [j9]G. W. Stewart:
Constrained definite Hessians tend to be well conditioned. Math. Program. 21(1): 235-238 (1981)
1970 – 1979
- 1976
- [j8]G. W. Stewart:
Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2]. ACM Trans. Math. Softw. 2(3): 275-280 (1976) - 1974
- [j7]M. M. Blevins, G. W. Stewart:
Calculating the Eigenvectors of Diagonally Dominant Matrices. J. ACM 21(2): 261-271 (1974) - [c1]G. W. Stewart:
The Numerical Treatment of Large Eigenvalue Problems. IFIP Congress 1974: 666-672 - 1972
- [j6]Richard H. Bartels, G. W. Stewart:
Solution of the Matrix Equation AX+XB=C [F4] (Algorithm 432). Commun. ACM 15(9): 820-826 (1972) - 1970
- [j5]G. W. Stewart:
Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices. Commun. ACM 13(6): 365-367 (1970) - [j4]G. W. Stewart:
Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. Commun. ACM 13(6): 369-371 (1970) - [j3]G. W. Stewart:
Remark on algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. Commun. ACM 13(12): 750 (1970)
1960 – 1969
- 1968
- [j2]G. W. Stewart, Dale W. Lick:
Numerical Analysis: Numerical solution of a thin plate heat transfer problem. Commun. ACM 11(9): 639-640 (1968) - 1967
- [j1]G. W. Stewart:
A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives. J. ACM 14(1): 72-83 (1967)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint