Searcharxiv⌕ Search

arXiv subjects

Chao Yang

Publications and source records attributed to Chao Yang.

At least 379 records · Page 21Linked to original sources

Deep Learning: A Tool for Computational Nuclear Physics

In recent years, several successful applications of the Artificial Neural Networks (ANNs) have emerged in nuclear physics and high-energy physics, as well as in biology, chemistry, meteorology, and other fields of science. A major goal of nuclear theory is to predict nuclear structure and nuclear reactions from the underlying theory of the strong interactions, Quantum Chromodynamics (QCD). With access to powerful High Performance Computing (HPC) systems, several ab initio approaches, such as the No-Core Shell Model (NCSM), have been developed to calculate the properties of atomic nuclei. However, to accurately solve for the properties of atomic nuclei, one faces immense theoretical and computational challenges. The present study proposes a feed-forward ANN method for predicting the properties of atomic nuclei like ground state energy and ground state point proton root-mean-square (rms) radius based on NCSM results in computationally accessible basis spaces. The designed ANNs are sufficient to produce results for these two very different observables in 6Li from the ab initio NCSM results in small basis spaces that satisfy the theoretical physics condition: independence of basis space parameters in the limit of extremely large matrices. We also provide comparisons of the results from ANNs with established methods of estimating the results in the infinite matrix limit.

physics.comp-ph↗

Two-level Chebyshev filter based complementary subspace method: pushing the envelope of large-scale electronic structure calculations

We describe a novel iterative strategy for Kohn-Sham density functional theory calculations aimed at large systems (> 1000 electrons), applicable to metals and insulators alike. In lieu of explicit diagonalization of the Kohn-Sham Hamiltonian on every self-consistent field (SCF) iteration, we employ a two-level Chebyshev polynomial filter based complementary subspace strategy to: 1) compute a set of vectors that span the occupied subspace of the Hamiltonian; 2) reduce subspace diagonalization to just partially occupied states; and 3) obtain those states in an efficient, scalable manner via an inner Chebyshev-filter iteration. By reducing the necessary computation to just partially occupied states, and obtaining these through an inner Chebyshev iteration, our approach reduces the cost of large metallic calculations significantly, while eliminating subspace diagonalization for insulating systems altogether. We describe the implementation of the method within the framework of the Discontinuous Galerkin (DG) electronic structure method and show that this results in a computational scheme that can effectively tackle bulk and nano systems containing tens of thousands of electrons, with chemical accuracy, within a few minutes or less of wall clock time per SCF iteration on large-scale computing platforms. We anticipate that our method will be instrumental in pushing the envelope of large-scale ab initio molecular dynamics. As a demonstration of this, we simulate a bulk silicon system containing 8,000 atoms at finite temperature, and obtain an average SCF step wall time of 51 seconds on 34,560 processors; thus allowing us to carry out 1.0 ps of ab initio molecular dynamics in approximately 28 hours (of wall time).

physics.comp-ph↗

The effect of Si addition on the microstructure and tensile properties of casting Al-5.0Cu-0.6Mn-1.2Fe alloys

In this work, we studied the effect of Si on the microstructure and tensile properties of the as-cast Al-5.0Cu-0.6Mn-1.2Fe alloys which were produced by casting with or without applied pressure. The results show that the addition of Si can significantly influence the microstructure and tensile properties of the alloys. For the alloys produced without pressure, the addition of Si can promote the formation of Chinese script α-Fe, suppress the precipitation of plate-like Al3(FeMn) and Chinese script Al6(FeMn) and increase the volume percent of porosity, resulting in a remarkable decrease in the ultimate tensile strength (UTS) and yield strength (YS). For the alloys produced with a pressure of 75 MPa, the addition of Si can also promote the formation of fine Chinese script α-Fe and high number density Al2Cu (θ) phases, resulting in a slight increase in UTS and YS. The strength and elongation of the alloys increases with increasing applied pressure at the same Si level, which are attributed to the elimination of porosity, grain refinement strengthening and solid-solution strengthening. The alloy with addition of 1.1 % Si produced under the applied pressure of 75 MPa shows the best tensile properties, where the UTS, YS and elongation is 237 MPa, 140 MPa and 9.8%, respectively.

cond-mat.mtrl-sci↗

Accelerating Optical Absorption Spectra and Exciton Energy Computation for Nanosystems via Interpolative Separable Density Fitting

We present an efficient way to solve the Bethe-Salpeter equation (BSE), a model for the computation of absorption spectra in molecules and solids that includes electron-hole excitations. Standard approaches to construct and diagonalize the Bethe-Salpeter Hamiltonian require at least $Ø(N_e^5)$ operations, where $N_e$ is proportional to the number of electrons in the system, limiting its application to small systems. Our approach is based on the interpolative separable density fitting (ISDF) technique to construct low rank approximations to the bare and screened exchange operators associated with the BSE Hamiltonian. This approach reduces the complexity of the Hamiltonian construction to $Ø(N_e^3)$ with a much smaller pre-constant. Here, we implement the ISDF method for the BSE calculations within the Tamm-Dancoff approximation (TDA) in the BerkeleyGW software package. We show that ISDF-based BSE calculations in molecules and solids reproduce accurate exciton energies and optical absorption spectra with significantly reduced computational cost.

physics.comp-ph↗

Computing the density of states for optical spectra by low-rank and QTT tensor approximation

In this paper, we introduce a new interpolation scheme to approximate the density of states (DOS) for a class of rank-structured matrices with application to the Tamm-Dancoff approximation (TDA) of the Bethe-Salpeter equation (BSE). The presented approach for approximating the DOS is based on two main techniques. First, we propose an economical method for calculating the traces of parametric matrix resolvents at interpolation points by taking advantage of the block-diagonal plus low-rank matrix structure described in [6, 3] for the BSE/TDA problem. Second, we show that a regularized or smoothed DOS discretized on a fine grid of size $N$ can be accurately represented by a low rank quantized tensor train (QTT) tensor that can be determined through a least squares fitting procedure. The latter provides good approximation properties for strictly oscillating DOS functions with multiple gaps, and requires asymptotically much fewer ($O(\log N)$) functional calls compared with the full grid size $N$. This approach allows us to overcome the computational difficulties of the traditional schemes by avoiding both the need of stochastic sampling and interpolation by problem independent functions like polynomials etc. Numerical tests indicate that the QTT approach yields accurate recovery of DOS associated with problems that contain relatively large spectral gaps. The QTT tensor rank only weakly depends on the size of a molecular system which paves the way for treating large-scale spectral problems.

math.NA↗

Microstructure and mechanical properties of Al-Cu alloy with 0.6%Fe produced with ultrasonic vibration and applied pressure

The combined effect of ultrasonic vibration (UT) and applied pressure (P) on microstructure and mechanical properties of Al-5.0Cu-0.6Mn-0.6Fe alloy were investigated. The best tensile properties produced by P+UT processing are UTS: 268MPa, YS: 192MPa, E.L.: 17.1%, respectively, which increasing by 64%, 59% and 307%, respectively, compare to the Non-treated alloy.

cond-mat.mtrl-sci↗

Effect of Si on Fe-rich intermetallic formation and mechanical properties of heattreated Al-Cu-Mn-Fe alloys

The effect of Si on Fe-rich intermetallics formation and mechanical properties of heat-treated squeeze cast Al-5.0Cu-0.6Mn-0.7Fe alloy was investigated. Our results show that increasing Si content promotes the formation of Al15(FeMn)3(SiCu)2 ($α$-Fe), and varying the morphology of T (Al20Cu3Mn2) where the size decreases and the amount increases. The major reason is that Si promotes heterogeneous nucleation of the intermetallics leading to finer precipitates. Si addition significantly enhances ultimate tensile strength and yield strength of the alloys. The strengthening effect is mainly owing to the dispersoid strengthening by increasing volume fraction of T phase and less harmful $α$-Fe with a compact structure, which make the cracks more difficult to initiate and propagation during tensile test. The squeeze cast Al-5.0Cu-0.6Mn-0.7Fe alloy with 1.1% Si shows significantly improved mechanical properties than the alloy without Si addition, which has tensile strength of 386 MPa, yield strength of 280 MPa and elongation of 8.6%.

cond-mat.mtrl-sci↗

Shape Inpainting using 3D Generative Adversarial Network and Recurrent Convolutional Networks

Recent advances in convolutional neural networks have shown promising results in 3D shape completion. But due to GPU memory limitations, these methods can only produce low-resolution outputs. To inpaint 3D models with semantic plausibility and contextual details, we introduce a hybrid framework that combines a 3D Encoder-Decoder Generative Adversarial Network (3D-ED-GAN) and a Long-term Recurrent Convolutional Network (LRCN). The 3D-ED-GAN is a 3D convolutional neural network trained with a generative adversarial paradigm to fill missing 3D data in low-resolution. LRCN adopts a recurrent neural network architecture to minimize GPU memory usage and incorporates an Encoder-Decoder pair into a Long Short-term Memory Network. By handling the 3D model as a sequence of 2D slices, LRCN transforms a coarse 3D shape into a more complete and higher resolution volume. While 3D-ED-GAN captures global contextual structure of the 3D shape, LRCN localizes the fine-grained details. Experimental results on both real-world and synthetic data show reconstructions from corrupted models result in complete and high-resolution 3D objects.

cs.CV↗

Strong Edge Magnetism and Tunable Energy Gaps in Zigzag Graphene Quantum Dots with High Stability

Graphene is a nonmagnetic semimetal and cannot be directly used as electronic or spintronic devices. We demonstrate that graphene quantum dots (GQDs) can exhibit strong edge magnetism and tunable energy gaps due to the presence of localized edge states. By using large-scale first principle density functional theory (DFT) calculations and detailed analysis based on model Hamiltonians, we can show that the zigzag edge states in GQDs become much stronger and more localized as the system size increases. The enhanced edge states induce strong electron-electron interactions along the edges of GQDs, ultimately resulting in a magnetic phase transition from nonmagnetic to intra-edge ferromagnetic and inter-edge antiferromagnetic, when the diameter is larger than 4.5 nm. Our analysis shows that the inter-edge superexchange interaction of antiferromagnetic states between two nearest-neighbor zigzag edges in GQDs is much stronger than that exists between two parallel zigzag edges in GQDs and graphene nanoribbons. Furthermore, such strong and localized edge states also induce GQDs semiconducting with tunable energy gaps, mainly controlled by adjusting the system size. Our results show that the quantum confinement effect, inter-edge superexchange (antiferromagnetic), and intra-edge direct exchange (ferromagnetic) interactions are crucial for the electronic and magnetic properties of zigzag GQDs at the nanoscale.

cond-mat.mtrl-sci↗

Dynamical topological invariant after a quantum quench

We show how to define a dynamical topological invariant for general one-dimensional topological systems after a quantum quench. Focusing on two-band topological insulators, we demonstrate that the reduced momentum-time manifold can be viewed as a series of submanifold $S^2$, and thus we are able to define a dynamical topological invariant on each of the sphere. We also unveil the intrinsic relation between the dynamical topological invariant and the difference of topological invariant of the initial and final static Hamiltonian. By considering some concrete examples, we illustrate the calculation of the dynamical topological invariant and its geometrical meaning explicitly.

cond-mat.str-el↗

Accelerating Nuclear Configuration Interaction Calculations through a Preconditioned Block Iterative Eigensolver

We describe a number of recently developed techniques for improving the performance of large-scale nuclear configuration interaction calculations on high performance parallel computers. We show the benefit of using a preconditioned block iterative method to replace the Lanczos algorithm that has traditionally been used to perform this type of computation. The rapid convergence of the block iterative method is achieved by a proper choice of starting guesses of the eigenvectors and the construction of an effective preconditioner. These acceleration techniques take advantage of special structure of the nuclear configuration interaction problem which we discuss in detail. The use of a block method also allows us to improve the concurrency of the computation, and take advantage of the memory hierarchy of modern microprocessors to increase the arithmetic intensity of the computation relative to data movement. We also discuss implementation details that are critical to achieving high performance on massively parallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to three times faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

math.NA↗

A structure preserving Lanczos algorithm for computing the optical absorption spectrum

We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe--Salpeter equation without Tamm--Dancoff approximation. The new algorithm is based on a structure preserving Lanczos procedure, which exploits the special block structure of Bethe--Salpeter Hamiltonian matrices. A recently developed technique of generalized averaged Gauss quadrature is incorporated to accelerate the convergence. We also establish the connection between our structure preserving Lanczos procedure with several existing Lanczos procedures developed in different contexts. Numerical examples are presented to demonstrate the effectiveness of our Lanczos algorithm.

math.NA↗

A Semi-smooth Newton Method for Solving Semidefinite Programs in Electronic Structure Calculations

The ground state energy of a many-electron system can be approximated by an variational approach in which the total energy of the system is minimized with respect to one and two-body reduced density matrices (RDM) instead of many-electron wavefunctions. This problem can be formulated as a semidefinite programming problem. Due the large size of the problem, the well-known interior point method can only be used to tackle problems with a few atoms. First-order methods such as the the alternating direction method of multipliers (ADMM) have much lower computational cost per iteration. However, their convergence can be slow, especially for obtaining highly accurate approximations. In this paper, we present a practical and efficient second-order semi-smooth Newton type method for solving the SDP formulation of the energy minimization problem. We discuss a number of techniques that can be used to improve the computational efficiency of the method and achieve global convergence. Extensive numerical experiments show that our approach is competitive to the state-of-the-art methods in terms of both accuracy and speed.

math.OC↗

A Model Order Reduction Algorithm for Estimating the Absorption Spectrum

The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator's eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comes at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. We present a novel, adaptive solution based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-Ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. Based on a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.

cs.CE↗

Projected Commutator DIIS Method for Accelerating Hybrid Functional Electronic Structure Calculations

The commutator direct inversion of the iterative subspace (commutator DIIS or C-DIIS) method developed by Pulay is an efficient and the most widely used scheme in quantum chemistry to accelerate the convergence of self consistent field (SCF) iterations in Hartree-Fock theory and Kohn-Sham density functional theory. The C-DIIS method requires the explicit storage of the density matrix, the Fock matrix and the commutator matrix. Hence the method can only be used for systems with a relatively small basis set, such as the Gaussian basis set. We develop a new method that enables the C-DIIS method to be efficiently employed in electronic structure calculations with a large basis set such as planewaves for the first time. The key ingredient is the projection of both the density matrix and the commutator matrix to an auxiliary matrix called the gauge-fixing matrix. The resulting projected commutator-DIIS method (PC-DIIS) only operates on matrices of the same dimension as the that consists of Kohn-Sham orbitals. The cost of the method is comparable to that of standard charge mixing schemes used in large basis set calculations. The PC-DIIS method is gauge-invariant, which guarantees that its performance is invariant with respect to any unitary transformation of the Kohn-Sham orbitals. We demonstrate that the PC-DIIS method can be viewed as an extension of an iterative eigensolver for nonlinear problems. We use the PC-DIIS method for accelerating Kohn-Sham density functional theory calculations with hybrid exchange-correlation functionals, and demonstrate its superior performance compared to the commonly used nested two-level SCF iteration procedure.

physics.comp-ph↗

PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case

This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse non- symmetric matrices. We assume a general sparse matrix A has been decomposed as PAQ = LU on a distributed memory parallel machine, where L, U are lower and upper triangular matrices, and P, Q are permutation matrices, respectively. The PSelInv method computes selected elements of A-1. The selection is confined by the sparsity pattern of the matrix AT . Our algorithm does not assume any symmetry properties of A, and our parallel implementation is memory efficient, in the sense that the computed elements of A-T overwrites the sparse matrix L+U in situ. PSelInv involves a large number of collective data communication activities within different processor groups of various sizes. In order to minimize idle time and improve load balancing, tree-based asynchronous communication is used to coordinate all such collective communication. Numerical results demonstrate that PSelInv can scale efficiently to 6,400 cores for a variety of matrices.

cs.MS↗

Interpolative Separable Density Fitting Decomposition for Accelerating Hybrid Density Functional Calculations With Applications to Defects in Silicon

We present a new efficient way to perform hybrid density functional theory (DFT) based electronic structure calculation. The new method uses an interpolative separable density fitting (ISDF) procedure to construct a set of numerical auxiliary basis vectors and a compact approximation of the matrix consisting of products of occupied orbitals represented in a large basis set such as the planewave basis. Such an approximation allows us to reduce the number of Poisson solves from $\Or(N_{e}^2)$ to $\Or(N_{e})$ when we apply the exchange operator to occupied orbitals in an iterative method for solving the Kohn-Sham equations, where $N_{e}$ is the number of electrons in the system to be studied. We show that the ISDF procedure can be carried out in $\Or(N_{e}^3)$ operations, with a much smaller pre-constant compared to methods used in existing approaches. When combined with the recently developed adaptively compressed exchange (ACE) operator formalism, which reduces the number of times the exchange operator needs to be updated, the resulting ACE-ISDF method significantly reduces the computational cost \REV{associated with the exchange operator} by nearly two orders of magnitude compared to existing approaches for a large silicon system with $1000$ atoms. We demonstrate that the ACE-ISDF method can produce accurate energies and forces for insulating and metallic systems, and that it is possible to obtain converged hybrid functional calculation results for a 1000-atom bulk silicon within 10 minutes on 2000 computational cores. We also show that ACE-ISDF can scale to 8192 computational cores for a 4096-atom bulk silicon system. We use the ACE-ISDF method to geometrically optimize a 1000-atom silicon system with a vacancy defect using the HSE06 functional and computes its electronic structure.

physics.comp-ph↗

Testing the Einstein's equivalence principle with polarized gamma-ray bursts

The Einstein's equivalence principle can be tested by using parameterized post-Newtonian parameters, of which the parameter $γ$ has been constrained by comparing the arrival times of photons with different energies. It has been constrained by a variety of astronomical transient events, such as gamma-ray bursts (GRBs), fast radio bursts as well as pulses of pulsars, with the most stringent constraint of $Δγ\lesssim 10^{-15}$. In this letter, we consider the arrival times of lights with different circular polarization. For a linearly polarized light, it is the combination of two circularly polarized lights. If the arrival time difference between the two circularly polarized lights is too large, their combination may lose the linear polarization. We constrain the value of $Δγ_{\rm p} < 1.6 \times 10^{-27}$ by the measurement of the polarization of GRB 110721A, which is the most stringent constraint ever achieved.

astro-ph.HE↗