Search NASA⌕ Search

Engineering topics

Yang, Chao

Publications and source records attributed to Yang, Chao.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Achieving performance portability in Gaussian basis set density functional theory on accelerator based architectures in NWChemEx

The numerical integration of the exchange–correlation (XC) potential is one of the primary computational bottlenecks in Gaussian basis set Kohn–Sham density functional theory (KS-DFT). To achieve optimal performance and accuracy, care must be taken in this numerical integration to preserve local sparsity as to allow for near linear weak scaling with system size. This leads to an integration scheme with several performance critical kernels which must be hand optimized for each architecture of interest. As the set of available accelerator hardware goes more diverse, a key challenge for developers of KS-DFT software is to maintain performance portability across a wide range of computational architectures. In this article, we examine a modular software design pattern which decouples the implementation details of performance critical kernels from the expression of high-level algorithmic workflows in a device-agnostic language such as C++; thus allowing for developers to target existing and emerging accelerator hardware within a single code base. We consider the efficacy of such a design pattern in the numerical integration of the XC potential by demonstrating its ability to achieve performance portability across a set of accelerator architectures which are representative of those on current and future U.S. Department of Energy Leadership Computing Facilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reinforcement Learning Configuration Interaction

Selected configuration interaction (sCI) methods exploit the sparsity of the full configuration interaction (FCI) wave function, yielding significant computational savings and wave function compression without sacrificing the accuracy. Despite recent advances in sCI methods, the selection of important determinants remains an open problem. Furthermore, we explore the possibility of utilizing reinforcement learning approaches to solve the sCI problem. By mapping the configuration interaction problem onto a sequential decision-making process, the agent learns on-the-fly which determinants to include and which to ignore, yielding a compressed wave function at near-FCI accuracy. This method, which we call reinforcement-learned configuration interaction, adds another weapon to the sCI arsenal and highlights how reinforcement learning approaches can potentially help solve challenging problems in electronic structure theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Selective and noncovalent targeting of RAS mutants for inhibition and degradation

Activating mutants of RAS are commonly found in human cancers, but to date selective targeting of RAS in the clinic has been limited to KRAS(G12C) through covalent inhibitors. Here, we report a monobody, termed 12VC1, that recognizes the active state of both KRAS(G12V) and KRAS(G12C) up to 400-times more tightly than wild-type KRAS. The crystal structures reveal that 12VC1 recognizes the mutations through a shallow pocket, and 12VC1 competes against RAS-effector interaction. When expressed intracellularly, 12VC1 potently inhibits ERK activation and the proliferation of RAS-driven cancer cell lines in vitro and in mouse xenograft models. 12VC1 fused to VHL selectively degrades the KRAS mutants and provides more extended suppression of mutant RAS activity than inhibition by 12VC1 alone. These results demonstrate the feasibility of selective targeting and degradation of KRAS mutants in the active state with noncovalent reagents and provide a starting point for designing noncovalent therapeutics against oncogenic RAS mutants.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Kohn-Sham Solver (KSSOLV) v2.0

KSSOLV is a MATLAB toolbox for solving Kohn-Sham density functional theory based electronic structure eigenvalue problems. It uses an object oriented features of MATLAB to represent atom, molecules, wavefunctions and Hamiltonians and their operations. It is designed to make it easier for users to prototype and test new algorithms for solving the Kohn-Sham problem. KSSOLV2.0 contains significant improvement over the original KSSOLV described in a paper published in ACM Transaction on Mathematical Software (attached). In addition to performing ground state calculation for small molecules, it can also perform geometry optimization for both molecules and solids. It uses standard pseudopotentials and implements local density approximation, generalized gradient approximation and hybrid functionals. Future releases will also include time-dependent DFT and post DFT calculations such as the GW quasi-particle energy calculation and Bethe-Salpeter equation solver for optical absorption.

Yang, Chao↗
DOE OSTI2021

A micromechanical hydro-mechanical-damage coupled model for layered rocks considering multi-scale structures

An anisotropic Hydro-Mechanical-Damage coupled model was established in the framework of thermodynamics for saturated layered rocks, which contain arbitrarily-distributed cracks of smaller scales and orientated bedding planes of much larger scales. Here, the proposed model considers the anisotropic damage growth and frictional sliding of cracks and shear sliding and dilatancy of bedding planes, as well as the interaction between cracks and bedding planes. Numerical implementation of the nonlinear coupled model was developed based on TOUGHREACT, which is a well-established simulator for multiphase fluid flow and reactive transport analysis. The proposed model was first validated with laboratory water injection test results on rock blocks, and then used to study the effects of injection rates, in situ stresses and bedding planes on fluid injection processes at the field scale, demonstrating the importance to consider the variation of multi-scale structures for better understanding the coupled Hydro-Mechanical responses in layered rocks.

58 GEOSCIENCES↗
DOE OSTI2021

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗
DOE OSTI2020

On the Efficient Evaluation of the Exchange Correlation Potential on Graphics Processing Unit Clusters

The predominance of Kohn–Sham density functional theory (KS-DFT) for the theoretical treatment of large experimentally relevant systems in molecular chemistry and materials science relies primarily on the existence of efficient software implementations which are capable of leveraging the latest advances in modern high-performance computing (HPC). With recent trends in HPC leading toward increasing reliance on heterogeneous accelerator-based architectures such as graphics processing units (GPU), existing code bases must embrace these architectural advances to maintain the high levels of performance that have come to be expected for these methods. In this work, we purpose a three-level parallelism scheme for the distributed numerical integration of the exchange-correlation (XC) potential in the Gaussian basis set discretization of the Kohn–Sham equations on large computing clusters consisting of multiple GPUs per compute node. In addition, we purpose and demonstrate the efficacy of the use of batched kernels, including batched level-3 BLAS operations, in achieving high levels of performance on the GPU. We demonstrate the performance and scalability of the implementation of the purposed method in the NWChemEx software package by comparing to the existing scalable CPU XC integration in NWChem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

The Potential of Low Molecular Weight Heparin to Mitigate Cytokine Storm in Severe COVID‐19 Patients: A Retrospective Cohort Study

On March 11, 2020, the World Health Organization declared its assessment of coronavirus disease 2019 (COVID‐19) as a global pandemic. However, specific anti‐severe acute respiratory syndrome‐coronavirus 2 (SARS‐CoV‐2) drugs are still under development, and patients are managed by multiple complementary treatments. We performed a retrospective analysis to compare and evaluate the effect of low molecular weight heparin (LMWH) treatment on disease progression. For this purpose, the clinical records and laboratory indicators were extracted from electronic medical records of 42 patients with COVID‐19 (21 of whom were treated with LMWH, and 21 without LMWH) hospitalized (Union Hospital of Huazhong University of Science and Technology) from February 1 to March 15, 2020. Changes in the percentage of lymphocytes before and after LMWH treatment were significantly different from those in the control group ( P = 0.011). Likewise, changes in the levels of D‐dimer and fibrinogen degradation products in the LMWH group before and after treatment were significantly different from those in the control group ( P = 0.035). Remarkably, IL‐6 levels were significantly reduced after LMWH treatment ( P = 0.006), indicating that, besides other beneficial properties, LMWH may exert an anti‐inflammatory effect and attenuate in part the “cytokine storm” induced by the virus. Our results support the use of LMWH as a potential therapeutic drug for the treatment of COVID‐19, paving the way for a subsequent well‐controlled clinical study.

Shi, Chen↗
DOE OSTI2020

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗
DOE OSTI2020

Fiber-Shaped Fluidic Nanogenerator with High Power Density for Self-Powered Integrated Electronics

Flow-based hydrovoltaic nanogenerators have attracted particular attention as efficient and facile miniature energy-harvesting devices. However, they deliver relatively low output power density and limited power conversion efficiency owing to inefficient charge separation and poor charge accumulation. Here, we report the fabrication of high-performance, fiber-shaped fluidic nanogenerators (FFNGs) that use MoS 2 -encapsulated C fibers. The FFNGs deliver stable output voltages of 540 mV and an ultrahigh power density of 10.8 W m -2 . With experiments and density functional theory calculations, improvements in output performance can be attributed to smaller energy requirements for Na + cation adsorption, increased charge separation, and diffusion layer formations on the near surface. Moreover, self-powered, integrated devices achieve a maximum total power conversion-storage efficiency of ~11% and stable output voltage up to 3.1 V, which is applicable for use in consumer electronics devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Influence of point defects on the electronic and topological properties of monolayer WTe 2

In some topological insulators such as monolayers of WTe 2 or graphene with spin-orbit coupling, band inversion originates from chemical bonding and space group symmetry, in contrast to materials such as Bi 2 Se 3 , where the band inversion derives from relativistic effects in the atoms. In the former, band inversion is susceptible to changes of the chemical environment, e.g., by defects, while the latter are less affected by defects due to the larger energy scale associated with atomic relativistic effects. Motivated by recent experiments, we study the effect of Te vacancies and Te adatoms on the electronic properties of WTe 2 . We find that the Te vacancies have a formation energy of 2.21 eV, while the formation energy of the Te adatoms is much lower with 0.72 eV. Here, the vacancies strongly influence the band structure and we present evidence that band inversion is already reversed at the nominal composition of WTe 1.97 . In contrast, we show that the adatoms do not change the electronic structure in the vicinity of the Fermi level and thus the topological properties.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗