default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn G. Lewis
Person information
- affiliation: Boeing Computer Services, Mathematics and Engineering Analysis, Seattle, WA, USA
- affiliation: Stanford University, Stanford, CA, USA
Other persons with a similar name
- John Lewis — disambiguation page
- John A. Lewis
- John D. Lewis
- John E. Lewis
- John Joseph Lewis
- John M. Lewis
- John P. Lewis
![[0000-0002-6835-7263]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-6835-7263")
(aka: John Lewis 0001, John Peter Lewis, J. P. Lewis 0001) — Google, San Francisco, CA, USA (and 4 more) - John T. Lewis
- Lewis J. McGibbney (aka: Lewis John McGibbney)
- John-Lewis Zinia Zaukuu
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j11]Cleve Ashcraft, Roger G. Grimes, John G. Lewis:
Accurate Symmetric Indefinite Linear Equation Solvers. SIAM J. Matrix Anal. Appl. 20(2): 513-561 (1998)- 1997
- [j10]Daniel J. Pierce, John G. Lewis:
Sparse Multifrontal Rank Revealing QR Factorization. SIAM J. Matrix Anal. Appl. 18(1): 159-180 (1997) - 1994
- [j9]Roger G. Grimes, John G. Lewis, Horst D. Simon:
A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems. SIAM J. Matrix Anal. Appl. 15(1): 228-272 (1994) - 1993
- [c3]John G. Lewis, Robert A. van de Geijn:
Distributed memory matrix-vector multiplication and conjugate gradient algorithms. SC 1993: 484-492 - 1991
- [j8]David S. Dodson, Roger G. Grimes, John G. Lewis:
Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 17(2): 253-263 (1991) - [j7]David S. Dodson, Roger G. Grimes, John G. Lewis:
Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 17(2): 264-272 (1991)
1980 – 1989
- 1989
- [j6]Iain S. Duff, Roger G. Grimes, John G. Lewis:
Sparse matrix test problems. ACM Trans. Math. Softw. 15(1): 1-14 (1989) - 1987
- [c2]Charles E. Leiserson, John G. Lewis:
Orderings for Parallel Sparse Symmetric Factorization. PP 1987: 27-31 - 1986
- [c1]John G. Lewis, Horst D. Simon:
The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination. ICPP 1986: 366-368 - 1982
- [j5]John G. Lewis:
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms. ACM Trans. Math. Softw. 8(2): 180-189 (1982) - [j4]John G. Lewis:
Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices. ACM Trans. Math. Softw. 8(2): 190-194 (1982) - [j3]John G. Lewis:
Remark on "Algorithms 508 and 509: Matrix Bandwidth and Profile Reduction and A Hybrid Profile Reduction Algorith". ACM Trans. Math. Softw. 8(2): 221 (1982)
1970 – 1979
- 1979
- [j2]Tony F. Chan, John Gregg Lewis:
Computing Standard Deviations: Accuracy. Commun. ACM 22(9): 526-531 (1979) - 1977
- [b1]John G. Lewis:
Algorithms for sparse matrix eigenvalue problems. Stanford University, USA, 1977 - 1975
- [j1]John Gregg Lewis:
Certification of "Algorithm 349: Polygamma Functions with Arbitrary Precision". ACM Trans. Math. Softw. 1(4): 380-382 (1975)
Coauthor Index
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-07-04 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
