Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “triangular network”

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.

60 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

FPGA Acceleration of GCN in Light of the Symmetry of Graph Adjacency Matrix

Graph Convolutional Neural Networks (GCNs) are widely used to process large-scale graph data. Different from deep neural networks (DNNs), GCNs are sparse, irregular, and unstructured, posing unique challenges to hardware acceleration with regular processing elements (PEs). In particular, the adjacency matrix of a GCN is extremely sparse, leading to frequent but irregular memory access, low spatial/temporal data locality and poor data reuse. Furthermore, a realistic graph usually consists of unstructured data (e.g., unbalanced distributions), creating significantly different processing times and imbalanced workload for each node in GCN acceleration. To overcome these challenges, we propose an end-to-end hardware-software co-design to accelerate GCNs on resource-constrained FPGAs with the features including: (1) A custom dataflow that leverages symmetry along the diagonal of the adjacency matrix to accelerate feature aggregation for undirected graphs. We utilize either the upper or the lower triangular matrix of the adjacency matrix to perform aggregation in GCN to improve data reuse. (2) Unified compute cores for both aggregation and transform phases, with full support to the symmetry-based dataflow. These cores can be dynamically reconfigured to the systolic mode for transformation or as individual accumulators for aggregation in GCN processing. (3) Preprocessing of the graph in software to rearrange the edges and features to match the custom dataflow. This step improves the regularity in memory access and data reuse in the aggregation phase. Moreover, we quantize the GCN precision from FP32 to INT8 to reduce the memory footprint without losing the inference accuracy. We implement our accelerator design in Intel Stratix10 MX FPGA board with HBM2, and demonstrate 1.3x-110.5x improvement in end-to-end GCN latency as compared to the state-of the-art FPGA implementations, on the graph datasets of Cora, Pubmed, Citeseer and Reddit.

Nair, Gopikrishnan R.↗
DOE OSTI2026

A data-driven approach to real-time vertical position estimation for NSTX-U vertical stability control

In this paper, a database of 77 996 plasma equilibrium reconstructions from 727 discharges during the initial operation of the NSTX-U spherical tokamak is analyzed to develop a statistically robust model of the plasma vertical position for real-time control. A variety of regression models are developed and tested, ranging in complexity from linear models to deep neural networks, and including input signals ranging from the four pairs of flux loops used historically on NSTX-U up to the full set of 389 real-time signals available to the plasma control system. A linear model based on 140 real-time magnetics signals is found to offer excellent accuracy, with a coefficient of determination R 2 = 0.906. The robustness of this model to limited training data, new operating scenarios, and signal errors is tested, and a procedure is demonstrated to tune the model parameters to optimize its robustness. A time-dependent plasma equilibrium solver, TokaMaker, is used to simulate vertical stability control in NSTX-U, demonstrating that it should be possible to iteratively tune the parameters of a linear vertical position model to stabilize both positive and negative triangularity plasmas in future experiments.

magnetic diagnostics↗
DOE OSTI2024

Magnetic properties of the double trillium lattice antiferromagnet KBaCr 2 ⁢(PO 4 ) 3

Trillium lattices formed by corner-shared triangular units are the platform for magnetic frustration in three dimensions. Herein, we report structural and magnetic properties of the Cr-based (S = 3/2) double trillium lattice material KBaCr 2 ⁢(PO 4 ) 3 studied by x-ray diffraction, dc and ac magnetization, heat capacity, thermal conductivity, and 31 P nuclear magnetic resonance (NMR) measurements complemented by density-functional band-structure calculations. Magnetization, heat capacity, and 31 P NMR measurements reveal the magnetic transition at T N⁢1 ≃ 12.5 K in zero field followed by another transition (T N⁢2 ) at low temperatures in weak applied fields. The 31 P spin-lattice relaxation rate in the ordered state follows the T 3 behavior indicative of the two-magnon Raman process. Finally, the spin lattice of KBaCr 2 ⁢(PO 4 ) 3 comprises two crystallographically nonequivalent ferromagnetic sublattices that are coupled antiferromagnetically, thus eliminating frustration in this trillium network and leading to weak ferromagnetism in the vicinity of T N⁢1 .

36 MATERIALS SCIENCE↗
NASA NTRS2002

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗
DOE OSTI2023

Solutions Are the Problem: Ordered Two-Dimensional Covalent Organic Framework Films by Chemical Vapor Deposition

Covalent organic frameworks (COFs) are a promising class of crystalline polymer networks that are useful due to their high porosity, versatile functionality, and tunable architecture. Conventional solution-based methods of producing COFs are marred by slow reactions that produce powders that are difficult to process into adaptable form factors for functional applications, and there is a need for facile and fast synthesis techniques for making crystalline and ordered covalent organic framework (COF) thin films. In this work, we report a chemical vapor deposition (CVD) approach utilizing co-evaporation of two monomers onto a heated substrate to produce highly crystalline, defect-free COF films and coatings with hydrazone, imine, and ketoenamine COF linkages. Further, this all-in-one synthesis technique produces highly crystalline, 40 nm–1 μm-thick COF films on Si/SiO2 substrates in less than 30 min. Crystallinity and alignment were proven by using a combination of grazing-incidence wide-angle X-ray scattering (GIWAXS) and transmission electron microscopy (TEM), and successful conversion of the monomers to produce the target COF was supported by Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), and UV–vis measurements. Additionally, we used atomic force microscopy (AFM) to investigate the growth mechanisms of these films, showing the coalescence of triangular crystallites into a smooth film. To show the wide applicability and scope of the CVD process, we also prepared crystalline ordered COF films with imine and ketoenamine linkages. These films show potential as high-quality size exclusion membranes, catalytic platforms, and organic transistors.

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

Machine-learning modeling of magnetization dynamics in quasi-equilibrium and driven metallic spin systems

Here, we present a perspective on recent progress in machine-learning (ML) force-field approaches for large-scale Landau–Lifshitz–Gilbert (LLG) simulations of metallic spin systems. Building on a generalization of the Behler–Parrinello (BP) architecture originally developed for quantum molecular dynamics, we develop scalable and transferable ML models that faithfully capture the complex, environment-dependent electron-mediated exchange fields characteristic of itinerant magnets. A central ingredient of this framework is the implementation of symmetry-aware magnetic descriptors based on group-theoretical bispectrum formalisms. Leveraging these ML force fields, LLG simulations faithfully reproduce hallmark non-collinear magnetic orders—such as the 120° and tetrahedral states—on the triangular lattice, and successfully capture the complex spin textures emerging in the mixed-phase states of a square-lattice double-exchange model under thermal quench. We further discuss a generalized potential theory that extends the BP formalism to incorporate both conservative and nonconservative electronic torques, thereby enabling ML models to learn nonequilibrium exchange fields from computationally demanding microscopic approaches such as nonequilibrium Green’s-function techniques. This extension yields quantitatively accurate predictions of voltage-driven domain-wall motion and establishes a foundation for quantum-accurate, multiscale modeling of nonequilibrium spin dynamics and spintronic functionalities.

Descriptors↗