default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsmond G. Ng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Dong Min Roh, Esmond Ng, Chao Yang, Dean Lee, Pieter Maris, James P. Vary:
Accelerating Eigenvalue Computation for Nuclear Structure Calculations via Perturbative Corrections. CoRR abs/2407.08901 (2024)- [i11]M. Ozan Karsavuran, Esmond G. Ng, Barry W. Peyton, Jonathan L. Peyton:
Some new techniques to use in serial sparse Cholesky factorization algorithms. CoRR abs/2409.13090 (2024) - [i10]M. Ozan Karsavuran, Esmond G. Ng, Barry W. Peyton:
GPU Accelerated Sparse Cholesky Factorization. CoRR abs/2409.14009 (2024) - 2023
- [c16]Julian Bellavita
, Mathias Jacquelin, Esmond G. Ng, Dan Bonachea, Johnny Corbino, Paul H. Hargrove:
symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver. SC Workshops 2023: 1171-1184 - 2022
- [j38]Alice Gatti, Zhixiong Hu, Tess E. Smidt, Esmond G. Ng, Pieter Ghysels:
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks. J. Mach. Learn. Res. 23: 303:1-303:28 (2022) - [c15]Alice Gatti, Zhixiong Hu, Tess E. Smidt, Esmond G. Ng, Pieter Ghysels:
Deep Learning and Spectral Embedding for Graph Partitioning. PP 2022: 25-36 - 2021
- [j37]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes. SIAM J. Matrix Anal. Appl. 42(3): 1337-1364 (2021) - [i9]Alice Gatti, Zhixiong Hu, Pieter Ghysels, Esmond G. Ng, Tess E. Smidt:
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning. CoRR abs/2104.03546 (2021) - [i8]Alice Gatti, Zhixiong Hu, Tess E. Smidt, Esmond G. Ng, Pieter Ghysels:
Deep Learning and Spectral Embedding for Graph Partitioning. CoRR abs/2110.08614 (2021)
2010 – 2019
- 2018
- [j36]Meiyue Shao, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver. Comput. Phys. Commun. 222: 1-13 (2018) - [j35]Roel Van Beeumen, Osni Marques, Esmond G. Ng, Chao Yang, Zhaojun Bai, Lixin Ge, Oleksiy Kononenko, Zenghai Li, Cho-Kuen Ng, Liling Xiao:
Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation. J. Comput. Phys. 374: 1031-1043 (2018) - [c14]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast and effective reordering of columns within supernodes using partition refinement. CSC 2018: 76-86 - [i7]Gianina Alina Negoita, James P. Vary, Glenn R. Luecke, Pieter Maris, Andrey M. Shirokov, Ik Jae Shin, Youngman Kim, Esmond G. Ng, Chao Yang, Matthew Lockner, Gurpur M. Prabhu:
Deep Learning: Extrapolation Tool for Ab Initio Nuclear Theory. CoRR abs/1810.04009 (2018) - 2017
- [j34]Hasan Metin Aktulga, Md. Afibuzzaman, Samuel Williams, Aydin Buluç, Meiyue Shao, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations. IEEE Trans. Parallel Distributed Syst. 28(6): 1550-1563 (2017) - [c13]Ariful Azad, Mathias Jacquelin, Aydin Buluç, Esmond G. Ng:
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. IPDPS 2017: 22-31 - [i6]Roel Van Beeumen, David B. Williams-Young, Joseph M. Kasper, Chao Yang, Esmond G. Ng, Xiaosong Li:
A Model Order Reduction Algorithm for Estimating the Absorption Spectrum. CoRR abs/1704.05923 (2017) - 2016
- [j33]Jiri Brabec, Chao Yang, Evgeny Epifanovsky, Anna I. Krylov, Esmond Ng:
Reduced-cost sparsity-exploiting algorithm for solving coupled-cluster equations. J. Comput. Chem. 37(12): 1059-1067 (2016) - [i5]Mathias Jacquelin, Yili Zheng, Esmond Ng, Katherine A. Yelick:
An Asynchronous Task-based Fan-Both Sparse Cholesky Solver. CoRR abs/1608.00044 (2016) - [i4]Meiyue Shao, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Accelerating Nuclear Configuration Interaction Calculations through a Preconditioned Block Iterative Eigensolver. CoRR abs/1609.01689 (2016) - [i3]Ariful Azad, Mathias Jacquelin, Aydin Buluç, Esmond G. Ng:
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. CoRR abs/1610.08128 (2016) - 2015
- [r2]Erik Saule, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Ümit V. Çatalyürek:
An Out-of-Core Task-based Middleware for Data-Intensive Scientific Computing. Handbook on Data Centers 2015: 647-667 - 2014
- [j32]Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Improving the scalability of a symmetric iterative eigensolver for multi-core platforms. Concurr. Comput. Pract. Exp. 26(16): 2631-2651 (2014) - [j31]Hasan Metin Aktulga, Lin Lin, Christopher Haine, Esmond G. Ng, Chao Yang:
Parallel eigenvalue calculation based on multiple shift-invert Lanczos and contour integral based spectral projection method. Parallel Comput. 40(7): 195-212 (2014) - [j30]Robert Luce, Esmond G. Ng:
On the Minimum FLOPs Problem in the Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 35(1): 1-21 (2014) - 2013
- [j29]Scott Bogner, Aurel Bulgac, Joseph A. Carlson, Jonathan Engel, George L. Fann, Richard J. Furnstahl, Stefano Gandolfi, Gaute Hagen, Mihai Horoi, Calvin W. Johnson, Markus Kortelainen, Ewing L. Lusk, Pieter Maris, Hai Ah Nam, Petr Navratil, Witold Nazarewicz, Esmond G. Ng, Gustavo P. A. Nobre, W. Erich Ormand, Thomas Papenbrock, Junchen Pei, Steven C. Pieper, Sofia Quaglioni, Kenneth J. Roche, Jason Sarich, Nicolas Schunck, Masha Sosonkina, Jun Terasaki, Ian J. Thompson, James P. Vary, Stefan M. Wild:
Computational nuclear quantum many-body problem: The UNEDF project. Comput. Phys. Commun. 184(10): 2235-2250 (2013) - [j28]Stephen L. Cornford, Daniel F. Martin, Daniel T. Graves, Douglas F. Ranken, Anne M. Le Brocq, Rupert M. Gladstone, Antony J. Payne, Esmond G. Ng, William H. Lipscomb:
Adaptive mesh, finite volume modeling of marine ice sheets. J. Comput. Phys. 232(1): 529-549 (2013) - [i2]Robert Luce, Esmond G. Ng:
On the minimum FLOPs problem in the sparse Cholesky factorization. CoRR abs/1303.1754 (2013) - 2012
- [j27]Maciej Haranczyk, Piotr Urbaszek, Esmond G. Ng, Tomasz Puzyn:
Combinatorial × Computational × Cheminformatics (C3) Approach to Characterization of Congeneric Libraries of Organic Pollutants. J. Chem. Inf. Model. 52(11): 2902-2909 (2012) - [c12]Zheng Zhou, Erik Saule, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary, Ümit V. Çatalyürek:
An Out-of-Core Eigensolver on SSD-equipped Clusters. CLUSTER 2012: 248-256 - [c11]Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Topology-Aware Mappings for Large-Scale Eigenvalue Problems. Euro-Par 2012: 830-842 - [c10]Zheng Zhou, Erik Saule, Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary, Ümit V. Çatalyürek:
An Out-of-Core Dataflow Middleware to Reduce the Cost of Large Scale Iterative Solvers. ICPP Workshops 2012: 71-80 - 2011
- [c9]Olivier Coulaud, Kengo Nakajima, Esmond G. Ng, Mariano Vázquez:
Introduction. Euro-Par (2) 2011: 302 - [c8]Hasan Metin Aktulga, Chao Yang, Ümit V. Çatalyürek, Pieter Maris, James P. Vary, Esmond G. Ng:
On Reducing I/O Overheads in Large-Scale Invariant Subspace Projections. Euro-Par Workshops (1) 2011: 305-314 - [c7]Hasan Metin Aktulga, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
Large-scale parallel null space calculation for nuclear configuration interaction. HPCS 2011: 176-185 - [i1]Esmond G. Ng, Jason Sarich, Stefan M. Wild, Todd S. Munson, Hasan Metin Aktulga, Chao Yang, Pieter Maris, James P. Vary, Nicolas Schunck, M. G. Bertolli, Markus Kortelainen, Witold Nazarewicz, Thomas Papenbrock, M. V. Stoitsov:
Advancing Nuclear Physics Through TOPS Solvers and Tools. CoRR abs/1110.1708 (2011) - 2010
- [c6]Pieter Maris, Masha Sosonkina, James P. Vary, Esmond G. Ng, Chao Yang:
Scaling of ab-initio nuclear physics calculations on multicore computer architectures. ICCS 2010: 97-106
2000 – 2009
- 2009
- [j26]Haim Avron, Esmond Ng, Sivan Toledo:
Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems. SIAM J. Matrix Anal. Appl. 31(2): 674-693 (2009) - 2008
- [c5]Philip Sternberg, Esmond G. Ng, Chao Yang, Pieter Maris, James P. Vary, Masha Sosonkina, Hung Viet Le:
Accelerating configuration interaction calculations for nuclear structure. SC 2008: 15 - 2006
- [j25]Maurice Clint, Efstratios Gallopoulos, Esmond Ng, Jean Roman:
Parallel Matrix Algorithms and Applications (PMAA'04). Parallel Comput. 32(2): 113-114 (2006) - [j24]Esmond G. Ng:
Special Section On Preconditioning Techniques. SIAM J. Matrix Anal. Appl. 27(4): 997 (2006) - [j23]Ingyu Lee, Padma Raghavan, Esmond G. Ng:
Effective Preconditioning through Ordering Interleaved with Incomplete Factorization. SIAM J. Matrix Anal. Appl. 27(4): 1069-1088 (2006) - [j22]Patrick Amestoy, Xiaoye S. Li, Esmond G. Ng:
Diagonal Markowitz Scheme with Local Symmetrization. SIAM J. Matrix Anal. Appl. 29(1): 228-244 (2006) - [p1]Esmond G. Ng:
Parallel Sparse Solvers, Preconditioners, and Their Applications. Parallel Processing for Scientific Computing 2006: 163-178 - 2005
- [j21]Chao Yang, Weiguo Gao, Zhaojun Bai, Xiaoye S. Li, Lie-Quan Lee, Parry Husbands, Esmond G. Ng:
An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation. SIAM J. Sci. Comput. 27(3): 873-892 (2005) - 2004
- [j20]Esmond Ng, Wei-Pai Tang:
Editorial comments. Numer. Linear Algebra Appl. 11(8-9): 693 (2004) - [j19]Chao Yang, Esmond G. Ng, Pawel A. Penczek:
Matrix-free constructions of circulant and block circulant preconditioners. Numer. Linear Algebra Appl. 11(8-9): 773-793 (2004) - [j18]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 353-376 (2004) - [j17]Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng:
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3): 377-380 (2004) - [c4]Chao Yang, Weiguo Gao, Zhaojun Bai, Xiaoye S. Li, Lie-Quan Lee, Parry Husbands, Esmond G. Ng:
Algebraic Sub-structuring for Electromagnetic Applications. PARA 2004: 364-373 - 2003
- [j16]Esmond G. Ng, Wei-Pai Tang:
Editorial. Numer. Linear Algebra Appl. 10(5-6): 383 (2003) - [j15]Padma Raghavan, Keita Teranishi, Esmond G. Ng:
A latency tolerant hybrid sparse solver using incomplete Cholesky factorization. Numer. Linear Algebra Appl. 10(5-6): 541-560 (2003) - 2002
- [c3]Keita Teranishi, Padma Raghavan, Esmond G. Ng:
A new data-mapping scheme for latency-tolerant distributed sparse triangular solution. SC 2002: 50:1-50:11 - 2001
- [c2]Keita Teranishi, Padma Raghavan, Esmond G. Ng:
Scalable Preconditioning Using Incomplete Factors. PP 2001 - 2000
- [j14]Esmond G. Ng, Padma Raghavan:
Towards a Scalable Hybrid Sparse Solver. Concurr. Pract. Exp. 12(2-3): 53-68 (2000)
1990 – 1999
- 1999
- [j13]Esmond G. Ng, Daniel J. Pierce:
Introduction to the Special Section on Sparse and Structured Matrices and Their Applications. SIAM J. Matrix Anal. Appl. 20(4): 887 (1999) - [j12]Esmond G. Ng, Padma Raghavan:
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 20(4): 902-914 (1999) - [c1]Esmond G. Ng, Padma Raghavan:
Incomplete Cholesky Parallel Preconditioners with Selective Inversion. PP 1999 - [r1]Joel V. Brawley, Peter R. Turner, Barry W. Peyton, Esmond Ng, R. B. Bapat:
Linear Algebra. Handbook of Discrete and Combinatorial Mathematics 1999 - 1996
- [j11]Esmond G. Ng, Barry W. Peyton:
Some Results on Structure Prediction in Sparse QR Factorization. SIAM J. Matrix Anal. Appl. 17(2): 443-459 (1996) - 1994
- [j10]John R. Gilbert, Esmond G. Ng, Barry W. Peyton:
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 15(4): 1075-1091 (1994) - 1993
- [j9]Esmond G. Ng:
Supernodal Symbolic Cholesky Factorization on a Local-Memory Multiprocessor. Parallel Comput. 19(2): 153-162 (1993) - [j8]Joseph W. H. Liu, Esmond G. Ng, Barry W. Peyton:
On Finding Supernodes for Sparse Matrix Computations. SIAM J. Matrix Anal. Appl. 14(1): 242-252 (1993) - [j7]Esmond G. Ng, Barry W. Peyton:
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors. SIAM J. Sci. Comput. 14(4): 761-769 (1993) - [j6]Esmond G. Ng, Barry W. Peyton:
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers. SIAM J. Sci. Comput. 14(5): 1034-1056 (1993) - 1991
- [j5]Michael T. Heath, Esmond G. Ng, Barry W. Peyton:
Parallel Algorithms for Sparse Linear Systems. SIAM Rev. 33(3): 420-460 (1991) - [j4]Esmond Ng:
A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems. SIAM J. Sci. Comput. 12(5): 1173-1183 (1991)
1980 – 1989
- 1989
- [j3]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) - 1987
- [j2]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) - 1986
- [j1]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)
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-10-18 20:31 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:
