Esmond G. Ng

Orcid: 0000-0002-4535-6348

According to our database1, Esmond G. Ng authored at least 62 papers between 1986 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

2022
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks.
J. Mach. Learn. Res., 2022

Deep Learning and Spectral Embedding for Graph Partitioning.
Proceedings of the 2022 SIAM Conference on Parallel Processing for Scientific Computing, 2022

2021
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes.
SIAM J. Matrix Anal. Appl., 2021

Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning.
CoRR, 2021

2018
Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation.
J. Comput. Phys., 2018

Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver.
Comput. Phys. Commun., 2018

Deep Learning: Extrapolation Tool for Ab Initio Nuclear Theory.
CoRR, 2018

Fast and effective reordering of columns within supernodes using partition refinement.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

2017
A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations.
IEEE Trans. Parallel Distributed Syst., 2017

A Model Order Reduction Algorithm for Estimating the Absorption Spectrum.
CoRR, 2017

The Reverse Cuthill-McKee Algorithm in Distributed-Memory.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016
Reduced-cost sparsity-exploiting algorithm for solving coupled-cluster equations.
J. Comput. Chem., 2016

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver.
CoRR, 2016

2015
An Out-of-Core Task-based Middleware for Data-Intensive Scientific Computing.
Proceedings of the Handbook on Data Centers, 2015

2014
On the Minimum FLOPs Problem in the Sparse Cholesky Factorization.
SIAM J. Matrix Anal. Appl., 2014

Parallel eigenvalue calculation based on multiple shift-invert Lanczos and contour integral based spectral projection method.
Parallel Comput., 2014

Improving the scalability of a symmetric iterative eigensolver for multi-core platforms.
Concurr. Comput. Pract. Exp., 2014

2013
Adaptive mesh, finite volume modeling of marine ice sheets.
J. Comput. Phys., 2013

Computational nuclear quantum many-body problem: The UNEDF project.
Comput. Phys. Commun., 2013

2012
Combinatorial × Computational × Cheminformatics (C<sup>3</sup>) Approach to Characterization of Congeneric Libraries of Organic Pollutants.
J. Chem. Inf. Model., 2012

An Out-of-Core Dataflow Middleware to Reduce the Cost of Large Scale Iterative Solvers.
Proceedings of the 41st International Conference on Parallel Processing Workshops, 2012

Topology-Aware Mappings for Large-Scale Eigenvalue Problems.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

An Out-of-Core Eigensolver on SSD-equipped Clusters.
Proceedings of the 2012 IEEE International Conference on Cluster Computing, 2012

2011
Advancing Nuclear Physics Through TOPS Solvers and Tools
CoRR, 2011

Large-scale parallel null space calculation for nuclear configuration interaction.
Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

Introduction.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

On Reducing I/O Overheads in Large-Scale Invariant Subspace Projections.
Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2011

2010
Scaling of ab-initio nuclear physics calculations on multicore computer architectures.
Proceedings of the International Conference on Computational Science, 2010

2009
Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems.
SIAM J. Matrix Anal. Appl., 2009

2008
Accelerating configuration interaction calculations for nuclear structure.
Proceedings of the ACM/IEEE Conference on High Performance Computing, 2008

2006
Special Section On Preconditioning Techniques.
SIAM J. Matrix Anal. Appl., 2006

Effective Preconditioning through Ordering Interleaved with Incomplete Factorization.
SIAM J. Matrix Anal. Appl., 2006

Diagonal Markowitz Scheme with Local Symmetrization.
SIAM J. Matrix Anal. Appl., 2006

Parallel Matrix Algorithms and Applications (PMAA'04).
Parallel Comput., 2006

Parallel Sparse Solvers, Preconditioners, and Their Applications.
Proceedings of the Parallel Processing for Scientific Computing, 2006

2005
An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation.
SIAM J. Sci. Comput., 2005

2004
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw., 2004

A column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw., 2004

Matrix-free constructions of circulant and block circulant preconditioners.
Numer. Linear Algebra Appl., 2004

Editorial comments.
Numer. Linear Algebra Appl., 2004

Algebraic Sub-structuring for Electromagnetic Applications.
Proceedings of the Applied Parallel Computing, 2004

2003
A latency tolerant hybrid sparse solver using incomplete Cholesky factorization.
Numer. Linear Algebra Appl., 2003

Editorial.
Numer. Linear Algebra Appl., 2003

2002
A new data-mapping scheme for latency-tolerant distributed sparse triangular solution.
Proceedings of the 2002 ACM/IEEE conference on Supercomputing, 2002

2001
Scalable Preconditioning Using Incomplete Factors.
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001

2000
Towards a Scalable Hybrid Sparse Solver.
Concurr. Pract. Exp., 2000

1999
Linear Algebra.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization.
SIAM J. Matrix Anal. Appl., 1999

Introduction to the Special Section on Sparse and Structured Matrices and Their Applications.
SIAM J. Matrix Anal. Appl., 1999

Incomplete Cholesky Parallel Preconditioners with Selective Inversion.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1996
Some Results on Structure Prediction in Sparse QR Factorization.
SIAM J. Matrix Anal. Appl., 1996

1994
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization.
SIAM J. Matrix Anal. Appl., October, 1994

1993
On Finding Supernodes for Sparse Matrix Computations.
SIAM J. Matrix Anal. Appl., January, 1993

Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers.
SIAM J. Sci. Comput., 1993

A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors.
SIAM J. Sci. Comput., 1993

Supernodal Symbolic Cholesky Factorization on a Local-Memory Multiprocessor.
Parallel Comput., 1993

1991
A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems.
SIAM J. Sci. Comput., 1991

Parallel Algorithms for Sparse Linear Systems.
SIAM Rev., 1991

1989
Communication results for parallel sparse Cholesky factorization on a hypercube.
Parallel Comput., 1989

1987
Symbolic Cholesky factorization on a local-memory multiprocessor.
Parallel Comput., 1987

1986
Solution of sparse positive definite systems on a shared-memory multiprocessor.
Int. J. Parallel Program., 1986


  Loading...