Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Primitive equations”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

21 records · Page 2

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

Electronic structure and exchange interactions in altermagnetic MnGeP 2 in the quasiparticle self-consistent G W approach

The quasiparticle self-consistent 𝐺⁡𝑊 method is used to study the electronic band structure, optical dielectric function, and exchange interactions in chalcopyrite, 𝐼⁢ ‾ 4 ⁢2⁢𝑑, structure MnGeP 2 . The material is found to be an antiferromagnetic semiconductor with a lowest direct gap of 2.44 eV at the Γ point and a lower indirect gap of 1.87 eV from Γ to 𝑀. The material is an altermagnet because the two magnetic atoms of opposite spin are related by a twofold rotation operation perpendicular to the main fourfold rotation inversion axis. The spin splittings along a low symmetry line like 𝑃⁢𝑁 is sizable while at k points on the diagonal mirror planes or on the twofold symmetry axes the spin splitting is zero. The exchange interactions are calculated using a linear response approach. The antiferromagnetic exchange interaction between nearest neighbors in the primitive unit cell is dominating and found to be slightly decreasing upon carrier doping but not sufficiently to change the interaction to become ferromagnetic. The bare (noninteracting) and interacting transverse spin susceptibilities, which provide interatomic site exchange interactions after averaging over the muffin-tin spheres, are calculated from the 𝐺⁡𝑊 band structure and wave functions. From these exchange interactions, the spin wave spectra are obtained along the high symmetry lines and the Néel temperature is calculated using the mean-field and Tyablikov estimations. The dielectric function and the optical absorption spectra are calculated including excitonic effects using the Bethe Salpeter equation. The exchange interactions around Mn Ge defect sites is also studied. While we find it can generate ferromagnetic interactions with neighboring spins, we did not find direct evidence of producing an overall ferromagnetic phase. First, if Mn antisites are introduced by exchanging Mn with a nearby Ge, the interactions stay largely antiferromagnetic. Second, when we add additional Mn, in other words in Mn-rich stoichiometry, the Mn Ge antisites produce a strong ferromagnetic interaction primarily with the Mn in the same basal plane but weaker ferromagnetic interaction with adjacent plane Mn. The interactions between regular lattice Mn stay antiferromagnetic as before and thus favor keeping the antiferromagnetic order along the [001] direction. Adding Mn antisites, however, does lead to a metallic band structure.

36 MATERIALS SCIENCE↗

Neuromorphic Computing is Turing-Complete

Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.

Date, Prasanna↗