default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan George
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j30]Alan George, Khakim D. Ikramov:
Gaussian elimination is stable for the inverse of a diagonally dominant matrix. Math. Comput. 73(246): 653-657 (2004)- 2002
- [j29]Alan George, Khakim D. Ikramov, Andrey B. Kucherov:
On the growth factor in Gaussian elimination for generalized Higham matrices. Numer. Linear Algebra Appl. 9(2): 107-114 (2002) - 2001
- [j28]Alan George, Wei-Pai Tang, Ya Dan Wu:
Multilevel One-Way Dissection Factorization. SIAM J. Matrix Anal. Appl. 22(3): 752-771 (2001) - 2000
- [j27]Alan George, Khakim D. Ikramov:
On the Condition of Symmetric Quasi-Definite Matrices. SIAM J. Matrix Anal. Appl. 21(3): 970-977 (2000) - [j26]Alan George, Khakim D. Ikramov, Andrey B. Kucherov:
Some Properties of Symmetric Quasi-Definite Matrices. SIAM J. Matrix Anal. Appl. 21(4): 1318-1323 (2000) - [j25]Alan George, Lan Chieh Huang, Wei-Pai Tang, Ya Dan Wu:
Numerical Simulation of Unsteady Incompressible Flow (\em Re \protect\boldmath $\leq$ 9500) on the Curvilinear Half-Staggered Mesh. SIAM J. Sci. Comput. 21(6): 2331-2351 (2000)
1990 – 1999
- 1999
- [j24]Alan George, Joseph W. H. Liu:
An Object-Oriented Approach to the Design of a User Interface for a Sparse Matrix Package. SIAM J. Matrix Anal. Appl. 20(4): 953-969 (1999) - 1997
- [j23]Alan George, Khakim D. Ikramov:
Addendum: Is The Polar Decomposition Finitely Computable? SIAM J. Matrix Anal. Appl. 18(1): 264 (1997) - [j22]Alan George, Alex Pothen
:
An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems. SIAM J. Matrix Anal. Appl. 18(3): 706-732 (1997) - 1996
- [j21]Alan George, Khakim D. Ikramov:
Is the Polar Decomposition Finitely Computable? SIAM J. Matrix Anal. Appl. 17(2): 348-354 (1996) - [j20]Alan George, Khakim D. Ikramov, W.-P. Tang, V. N. Tchugunov:
On Doubly Symmetric Tridiagonal Forms for Complex Matrices and Tridiagonal Inverse Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 17(3): 680-690 (1996) - 1995
- [j19]Alan George, Khakim D. Ikramov, A. N. Krivoshapova, W.-P. Tang:
A Finite Procedure for the Tridiagonalization of a General Matrix. SIAM J. Matrix Anal. Appl. 16(2): 377-387 (1995) - [j18]Alan George, Khakim D. Ikramov, E. V. Matushkina, W.-P. Tang:
On a QR-Like Algorithm for Some Structured Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 16(4): 1107-1126 (1995) - 1993
- [j17]Philip Edmonds, Eleanor Chu, Alan George:
Dynamic Programming on a Shared-Memory Multiprocessor. Parallel Comput. 19(1): 9-22 (1993) - [j16]Eleanor Chu, Alan George, Darcy Quesnel:
Parallel Matrix Inversion on a Subcube-Grid. Parallel Comput. 19(3): 243-256 (1993) - [j15]Eleanor Chu, Alan George:
Parallel Algorithms and Subcube Embedding on a Hypercube. SIAM J. Sci. Comput. 14(1): 81-94 (1993) - 1992
- [j14]Eleanor Chu, Alan George:
A balanced submatrix merging algorithm for multiprocessor architectures. Parallel Comput. 18(1): 1-10 (1992) - 1990
- [j13]Eleanor Chu, Alan George:
QR Factorization of a Dense Matrix on a Hypercube Multiprocessor. SIAM J. Sci. Comput. 11(5): 990-1028 (1990)
1980 – 1989
- 1989
- [j12]Alan George, Joseph W. H. Liu, Esmond G. Ng:
Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Comput. 10(3): 287-298 (1989) - [j11]Eleanor Chu, Alan George:
QR factorization of a dense matrix on a shared-memory multiprocessor. Parallel Comput. 11(1): 55-71 (1989) - [j10]Alan George, Joseph W. H. Liu:
The Evolution of the Minimum Degree Ordering Algorithm. SIAM Rev. 31(1): 1-19 (1989) - 1987
- [j9]Eleanor Chu, Alan George:
Gaussian elimination with partial pivoting and load balancing on a multiprocessor. Parallel Comput. 5(1-2): 65-74 (1987) - [j8]Alan George, Michael T. Heath, Esmond G. Ng, Joseph W. H. Liu:
Symbolic Cholesky factorization on a local-memory multiprocessor. Parallel Comput. 5(1-2): 85-95 (1987) - [c2]Eleanor Chu, Alan George:
Parallel QR Factorization on a Hypercube Multiprocessor-Abstract. PP 1987: 8 - 1986
- [j7]Alan George, Michael T. Heath, Joseph W. H. Liu, Esmond G. Ng:
Solution of sparse positive definite systems on a shared-memory multiprocessor. Int. J. Parallel Program. 15(4): 309-325 (1986) - 1980
- [j6]W. M. Chan, Alan George:
A Linear Time Implementation of the Reverse Cuthill-McKee Algorithm. BIT 20(1): 8-14 (1980) - [j5]Alan George, Joseph W. H. Liu:
An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices. SIAM J. Comput. 9(3): 583-593 (1980) - [j4]Alan George, Joseph W. H. Liu:
A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs. ACM Trans. Math. Softw. 6(3): 337-358 (1980)
1970 – 1979
- 1979
- [j3]Alan George, Joseph W. H. Liu:
The Design of a User Interface for a Sparse Matrix Package. ACM Trans. Math. Softw. 5(2): 139-162 (1979) - [j2]Alan George, Joseph W. H. Liu:
An Implementation of a Pseudoperipheral Node Finder. ACM Trans. Math. Softw. 5(3): 284-295 (1979) - 1976
- [j1]Victor Barwell, Alan George:
A Comparison of Algorithms for Solving Symmetric Indefinite Systems of Linear Equations. ACM Trans. Math. Softw. 2(3): 242-251 (1976) - 1972
- [c1]Alan George:
An efficient band-oriented scheme for solving n by n grid problems. AFIPS Fall Joint Computing Conference (2) 1972: 1317-1320
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 22:21 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:
