Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph Methods”

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.

At least 1,009 records · Page 56

Socioeconomic and particulate air pollution correlates of heart disease risk

Highlights: • Heart disease risk varies with age, sex, smoking, income, education, and particulate (PM2.5) air pollution. • How these risk factors interact is unclear. • We examine correlates of self-reported heart disease risk in a large data set. • Income is negatively associated with both PM2.5 exposure and heart disease risk. • Income is an important confounder of air pollution-heart disease associations. • Nonparametric methods can quantify associations and suggest causal interpretations. How does risk of heart disease depend on age, sex, smoking, income, education, marital status, and outdoor concentrations of fine particulate matter (PM2.5)? We join data available from the Centers for Disease Control and Prevention (CDC) Behavioral Risk Factor Surveillance (BRFSS) System for years 2008–2012 to US Environmental Protection Agency (EPA) data on county-specific concentrations of fine particulate matter (PM2.5) to quantify associations among these variables and to explore possible causal interpretations. Low income is identified as a direct cause of increased heart disease risk in this data set. The effect depends on age and sex: it is most pronounced for men under age 70 and for women under age 80. Income is significantly associated with all of the other variables examined and confounds the association between PM2.5 and heart disease risk. This association is significant in regression models that exclude income, but not in regression models that include it, both in the data set as a whole and in the subset of observations with PM2.5 < 15 μg/m{sup 3}. Causal directed acyclic graph (DAG) models and non-parametric model ensemble partial dependence plots confirm that higher incomes reduce heart disease risk, consistent with previous observations of socioeconomic gradients in health risks. They support interpretation of this as a robust causal relation apparent in non-parametric analyses, and hence independent of any specific parametric modeling assumptions.

54 ENVIRONMENTAL SCIENCES↗

Novel Results Visualization for Dynamic PSA and New Modeling Features in EMRALD

The Event Modeling Risk Assessment Linked Diagram (EMRALD) tool, developed at the Idaho National Laboratory (INL), was designed to simplify the creation of dynamic models and support various research projects. One of the primary goals of EMRALD was to provide visual methods for modeling. EMRALD consists of two main components: a web-based user interface for model development and a solve engine for running model simulations. Over time, it has evolved to meet the diverse needs of its users. Initially, EMRALD's results were simple text outputs with final key state percentages and uncertainty bounds. However, because EMRALD utilizes a three-phase discrete event simulation and tracks the paths of each simulation run leading to a key state, there is significant potential to analyze large sets of path results data, including state paths, events, and timing. Visualizing this data meaningfully posed a challenge. To address this, a novel time-based Sankey diagram was developed. EMRALD exports results data in a format that can be opened in this Sankey viewer, allowing users to visualize paths, occurrences, events, and probability data for the entire simulation run in a single diagram. Moreover, when EMRALD was first created, there were limited tools capable of meeting its graphical requirements, many of which are no longer supported. In 2024, a new web-based interface was developed using modern graphing tools, enabling additional modeling features. This paper discusses the new dynamic PSA results visualization capability and the enhanced modeling tools available in EMRALD.

97 - MATHEMATICS AND COMPUTING↗

Towards Effective Clustering Techniques for the Analysis of Electric Power Grids

Clustering is an important data analysis technique with numerous applications in the analysis of electric power grids. Standard clustering techniques are oblivious to the rich structural and dynamic information available for power grids. Therefore, by exploiting the inherent topological and electrical structure in the power grid data, we propose new methods for clustering with applications to model reduction, locational marginal pricing, phasor measurement unit (PMU or synchrophasor) placement, and power system protection. We focus our attention on model reduction for analysis based on time-series information from synchrophasor measurement devices, and spectral techniques for clustering. By comparing different clustering techniques on two instances of realistic power grids we show that the solutions are related and therefore one could leverage that relationship for a computational advantage. Thus, by contrasting different clustering techniques we make a case for exploiting structure inherent in the data with implications for several domains including power systems.

clustering, k-means, power grid, graphs↗

DeepCare: Improving Patient Care using Deep Learning on Electronic Health Records

Coordinating patient care using electronic health records (EHR) data presents an exciting but formidable opportunity in data extraction, analysis and modeling. Traditional methods use a manual feature driven approach to model patients with age, family history and symptoms to predict disease outcomes. We propose a novel approach to model patients based on their streaming electronic health records data combined with information from medical knowledge bases, which has been gained over years of medical research. Using a combination of representation learning and long short term memory (LSTM) networks we plan to model patient evolution over time, leading to more accurate and individualized predictive models for patient’s diseases. Our approach will be transformative in providing critical decision support for patient care, enabling accurate understanding and evolution of diseases in patients.

60 APPLIED LIFE SCIENCES↗

Online technique for detecting state of onboard fiber optic gyroscope

Although angle random walk (ARW) of fiber optic gyroscope (FOG) has been well modeled and identified before being integrated into the high-accuracy attitude control system of satellite, aging and unexpected failures can affect the performance of FOG after launch, resulting in the variation of ARW coefficient. Therefore, the ARW coefficient can be regarded as an indicator of “state of health” for FOG diagnosis in some sense. The Allan variance method can be used to estimate ARW coefficient of FOG, however, it requires a large amount of data to be stored. Moreover, the procedure of drawing slope lines for estimation is painful. To overcome the barriers, a weighted state-space model that directly models the ARW to obtain a nonlinear state-space model was established for FOG. Then, a neural extended-Kalman filter algorithm was implemented to estimate and track the variation of ARW in real time. The results of experiment show that the proposed approach is valid to detect the state of FOG. Moreover, the proposed technique effectively avoids the storage of data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Parallel kinetic Monte Carlo simulation framework incorporating accurate models of adsorbate lateral interactions

Ab initio kinetic Monte Carlo (KMC) simulations have been successfully applied for over two decades to elucidate the underlying physico-chemical phenomena on the surfaces of heterogeneous catalysts. These simulations necessitate detailed knowledge of the kinetics of elementary reactions constituting the reaction mechanism, and the energetics of the species participating in the chemistry. The information about the energetics is encoded in the formation energies of gas and surface-bound species, and the lateral interactions between adsorbates on the catalytic surface, which can be modeled at different levels of detail. The majority of previous works accounted for only pairwise-additive first nearest-neighbor interactions. More recently, cluster-expansion Hamiltonians incorporating long-range interactions and many-body terms have been used for detailed estimations of catalytic rate [C. Wu, D. J. Schmidt, C. Wolverton, and W. F. Schneider, J. Catal. 286, 88 (2012)]. In view of the increasing interest in accurate predictions of catalytic performance, there is a need for general-purpose KMC approaches incorporating detailed cluster expansion models for the adlayer energetics. We have addressed this need by building on the previously introduced graph-theoretical KMC framework, and we have developed Zacros, a FORTRAN2003 KMC package for simulating catalytic chemistries. To tackle the high computational cost in the presence of long-range interactions we introduce parallelization with OpenMP. We further benchmark our framework by simulating a KMC analogue of the NO oxidation system established by Schneider and co-workers [J. Catal. 286, 88 (2012)]. We show that taking into account only first nearest-neighbor interactions may lead to large errors in the prediction of the catalytic rate, whereas for accurate estimates thereof, one needs to include long-range terms in the cluster expansion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗

Eigenvector centrality for characterization of protein allosteric pathways

Determining the principal energy-transfer pathways responsible for allosteric communication in biomolecules remains challenging, partially due to the intrinsic complexity of the systems and the lack of effective characterization methods. In this work, we introduce the eigenvector centrality metric based on mutual information to elucidate allosteric mechanisms that regulate enzymatic activity. Moreover, we propose a strategy to characterize the range of correlations that underlie the allosteric processes. We use the V-type allosteric enzyme imidazole glycerol phosphate synthase (IGPS) to test the proposed methodology. The eigenvector centrality method identifies key amino acid residues of IGPS with high susceptibility to effector binding. The findings are validated by solution NMR measurements yielding important biological insights, including direct experimental evidence for interdomain motion, the central role played by helix h α 1 , and the short-range nature of correlations responsible for the allosteric mechanism. Beyond insights on IGPS allosteric pathways and the nature of residues that could be targeted by therapeutic drugs or site-directed mutagenesis, the reported findings demonstrate the eigenvector centrality analysis as a general cost-effective methodology to gain fundamental understanding of allosteric mechanisms at the molecular level.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a Smart Signal Detection Method for Cyclic Voltammetry via Artificial Neural Intelligence

The electrorefiner (ER) is the heart of pyroprocessing technology which is a high-temperature method for separating uranium from Used Nuclear Fuel (UNF). It is important to improve this technology with respect to nuclear materials detection and accountability. Artificial Neural Intelligence (ANI) is a novel data analysis and simulation method that can be applied to electrochemical data sets. This computational code, which has been performed using the commercial software MATLAB, can be trained to generalize adequate electrical current and potential simulated data sets for the unseen data with a high accuracy of prediction. For this purpose, a massive collection of cyclic voltammetry (CV) data sets by Hoover (2014), for 0.5, 1, 2.5, and 5 wt% of zirconium chloride in LiCl-KCl molten salt with different scan rates at 773 K has been considered. The computer is trained via ANI to predict the unseen data after providing suitable hidden layers and validation numbers. In addition, this work can trace the CV plot for a blind condition by interpolating between two simulated data set. The different hidden layers with various neurons (from 5 to 30) at several validation numbers (from 5 to 30) has been studied and the average percent error between experimental and theoretical data for 0.5 wt% with 200 and 450 mV/s has been calculated. Preliminary results demonstrate that if the number of hidden layers increases from one to three, the average error falls down from 44% to around 8%. The best condition which gives a minimum average percent error has been discovered and the simulated CV graph has been compared with the experimental data. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Fox Trails

1. This software utilizes python pandas to pull data from P6 databases or XER files. The software transforms the datasets into multiple main tables by joining, filtering, iteratively flattening hierarchical structured data, and pivoting datasets to give simple flat output tables. The activity table includes all of the information related to an activity including activity codes, global, EPS, and project codes, UDFs, and WBS information as separate columns. This includes the code id, code value and sequence number for all levels in hierarchical codes. The resource table is similar to the activity table and includes all of the information related to resources on activities including UPFs and resource codes. The resource time phased table takes the resource information and time phases it for the budget, forecast, late, and actual dates/units/costs that closely matches P6's user interface's values as it implements the resource curve and calendars. The wbs table contains the WBS structure broken out by levels and includes UDFs, codes, and notebook topics. The final P6 data table is the relationships table which simply contains the relationships. 2. When a user updates the tool with data (via giving it P6 project names with database username/password information or XER files) the system creates the data in #1, then creates a networkx graph with the activity data imbedded in the node data and the relationships added as edges. Each edge also has it's float calculated (working time distance between the predecessor and successor) and attached to the edge. Activities are also tagged as a potential start of a path based on their constraints, constraint dates, remaining start date, and activity status. When a user enters an activity ID into the UI, it runs a shortest path calculation on the network graph between each node tagged as potential start to the entered activity id based on the float tagged on the edge. Each path returned by the algorithm contains all of the nodes on the path in order, as well as the total float of the edges that make the path. This data is then collected and returned to the user in the form of a gantt chart with groupings for each path that includes the total float for each group. 3. Similar to 2, if the user passes through a reference dataset each activity set in the path is checked to see if it had a path in the reference dataset, if that path was the primary path between the start and end activities, and what has changed regarding logic and durations. These changes are color coded and summarized before sent to the user to be displayed by the UI for simple discovery. 4. Utilizing the data from #1, the user can submit desired grouping code(s) and filters to the system. The system will then pull the activities, resources, and relationships and create a gantt chart based on the groupings sent and filtered based on the filters sent. 5. The system will produce a gantt chart in a similar method to #4, but allows interactivity with the data. As the user interacts with the gantt chart, the software captures the changes and stores it with the user making the change so that project controls and implement those changes in P6.

Fox, Ben↗

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗

Bacterial diversity dynamics in microbial consortia selected for lignin utilization

Lignin is nature’s largest source of phenolic compounds. Its recalcitrance to enzymatic conversion is still a limiting step to increase the value of lignin. Although bacteria are able to degrade lignin in nature, most studies have focused on lignin degradation by fungi. To understand which bacteria are able to use lignin as the sole carbon source, natural selection over time was used to obtain enriched microbial consortia over a 12-week period. The source of microorganisms to establish these microbial consortia were commercial and backyard compost soils. Cultivation occurred at two different temperatures, 30°C and 37°C, in defined culture media containing either Kraft lignin or alkaline-extracted lignin as carbon source. iTag DNA sequencing of bacterial 16S rDNA gene was performed for each of the consortia at six timepoints (passages). The initial bacterial richness and diversity of backyard compost soil consortia was greater than that of commercial soil consortia, and both parameters decreased after the enrichment protocol, corroborating that selection was occurring. Bacterial consortia composition tended to stabilize from the fourth passage on. After the enrichment protocol, Firmicutes phylum bacteria were predominant when lignin extracted by alkaline method was used as a carbon source, whereas Proteobacteria were predominant when Kraft lignin was used. Bray-Curtis dissimilarity calculations at genus level, visualized using NMDS plots, showed that the type of lignin used as a carbon source contributed more to differentiate the bacterial consortia than the variable temperature. The main known bacterial genera selected to use lignin as a carbon source were Altererythrobacter , Aminobacter , Bacillus , Burkholderia , Lysinibacillus , Microvirga , Mycobacterium , Ochrobactrum , Paenibacillus , Pseudomonas , Pseudoxanthomonas , Rhizobiales and Sphingobium . These selected bacterial genera can be of particular interest for studying lignin degradation and utilization, as well as for lignin-related biotechnology applications.

59 BASIC BIOLOGICAL SCIENCES↗

Materials design of perovskite solid solutions for thermochemical applications

Perovskites are excellent candidate materials as oxygen carriers in thermochemical processes. Due to their versatile composition, it is possible to fine-tune the perovskite's properties. Here, we present a method for the rational design of AMO 3– δ perovskite solid solutions with two different species on the Msite in order to tune their redox behavior. To account for the different ionic radii of different transition metal species M, two distinct ions are used in a solid solution on the A site, allowing tolerance-factor adjusted materials design. Using this methodology, we can create stable perovskites over a large range of different compositions. Leveraging the infrastructure of Materials Project, we calculate redox enthalpies for the reduction of over 240 of these $(\text {A}^{\prime}_x\text {A}^{\prime\prime}_{1-x})(\text {M}^{\prime}_y\text {M}^{\prime\prime}_{1-y})$O 3 perovskites to their brownmillerite phases based on density functional theory (DFT). We compare this data to experimentally measured data on thermodynamics of 24 of these materials to verify our theoretical framework. An empirical model is formulated for predicting the enthalpy and entropy changes as a function of the perovskites non-stoichiometry δ , which can be used to simulate the equilibrium composition as a function of temperature and oxygen partial pressure and to create a perovskite search engine based on an energetic analysis of the redox cycles. The data has been added as a contribution to MPContribs, which now includes publicly available user-controlled interactive graphs based on our theoretical and experimental data.

36 MATERIALS SCIENCE↗

A graph-based network for predicting chemical reaction pathways in solid-state materials synthesis

Abstract Accelerated inorganic synthesis remains a significant challenge in the search for novel, functional materials. Many of the principles which enable “synthesis by design” in synthetic organic chemistry do not exist in solid-state chemistry, despite the availability of extensive computed/experimental thermochemistry data. In this work, we present a chemical reaction network model for solid-state synthesis constructed from available thermochemistry data and devise a computationally tractable approach for suggesting likely reaction pathways via the application of pathfinding algorithms and linear combination of lowest-cost paths in the network. We demonstrate initial success of the network in predicting complex reaction pathways comparable to those reported in the literature for YMnO 3 , Y 2 Mn 2 O 7 , Fe 2 SiS 4 , and YBa 2 Cu 3 O 6.5 . The reaction network presents opportunities for enabling reaction pathway prediction, rapid iteration between experimental/theoretical results, and ultimately, control of the synthesis of solid-state materials.

36 MATERIALS SCIENCE↗

ChemGraph as an agentic framework for computational chemistry workflows

Atomistic simulations are essential in chemistry and materials science but remain challenging to run due to the expert knowledge required for the setup, execution, and validation stages of these calculations. We present ChemGraph, an agentic framework powered by artificial intelligence and state-of-the-art simulation tools to streamline and automate computational chemistry and materials science workflows. ChemGraph leverages graph neural network-based foundation models for accurate yet computationally efficient calculations and large language models (LLMs) for natural language understanding, task planning, and scientific reasoning to provide an intuitive and interactive interface. We evaluate ChemGraph across 13 benchmark tasks and demonstrate that smaller LLMs (GPT-4o-mini, Claude-3.5-haiku, Qwen-2.5-14B) perform well on simple workflows, while more complex tasks benefit from using larger models. Importantly, we show that decomposing complex tasks into smaller subtasks through a multi-agent framework enables GPT-4o to reach perfect accuracy and smaller LLMs to match or exceed single-agent GPT-4o's performance in these benchmarks.

Computational chemistry↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗

Seamlessly joining length scales: From atomistic thermal graphs to anisotropic continuum conductivity

Thermal transport in complex solids is governed by local structure, defects, and anisotropy, yet most continuum models still rely on oversimplified and homogenized conductivities. Here, we bridge atomistic and continuum descriptions by building finite element (FE) models directly from the site-projected thermal conductivity (SPTC), an atomic-level decomposition of the Green–Kubo thermal conductivity. We introduce a toolkit, the “Simulator Collection for Atomic-to-Continuum Scales (SCACS)”, which uses a graph neural network to predict SPTC on large atomic structures, coarse-grains these fields into anisotropic conductivity tensors, and embeds them into the heat-flow FE equation with a customized, anisotropy-aware adaptive mesh refinement scheme. Applied to silicon nanostructures, the resulting FE models act as representative volume elements, reproduce bulk conductivities, and capture interfacial and defect-driven anisotropy while maintaining thermodynamic consistency. Additionally, SCACS predicts experimental conductance trends and fields. This work demonstrates a general route for transferring atomistic transport information into device-scale thermal simulations with physics-based approximations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗