Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational”

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,693 records · Page 94

A performance spectrum for parallel computational frameworks that solve PDEs

Summary Important computational physics problems are often large‐scale in nature, and it is highly desirable to have robust and high performing computational frameworks that can quickly address these problems. However, it is no trivial task to determine whether a computational framework is performing efficiently or is scalable. The aim of this paper is to present various strategies for better understanding the performance of any parallel computational frameworks for solving PDEs. Important performance issues that negatively impact time‐to‐solution are discussed, and we propose a performance spectrum analysis that can enhance one's understanding of critical aforementioned performance issues. As proof of concept, we examine commonly used finite element simulation packages and software and apply the performance spectrum to quickly analyze the performance and scalability across various hardware platforms, software implementations, and numerical discretizations. It is shown that the proposed performance spectrum is a versatile performance model that is not only extendable to more complex PDEs such as hydrostatic ice sheet flow equations but also useful for understanding hardware performance in a massively parallel computing environment. Potential applications and future extensions of this work are also discussed.

Chang, J.↗

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

Security Assessment of an LBP16-Protocol-Based Computer Numerical Control Machine

Subtractive manufacturing systems, specifically, computer numerical control machines, have revolutionized the manufacturing industry. Computer numerical control machining is the preferred method for producing finished parts due to its efficiency, speed and suitability for high-volume production. Securing computer numerical control machines is a priority. Compromises or disruptions of these machines can result in significant downtime, loss of productivity and financial loss. This study examines the vulnerabilities and risks associated with computer numerical control machines, in particular, systems utilizing the LBP16 protocol for controller-machine communications. The study reveals that an adversary can execute cyber-physical attacks such as sabotage and denial of service. The potential security threats emphasize the importance of implementing robust security measures to mitigate the cyber risks to computer numerical control machines.

Forihat, Yahya [Virginia Commonwealth University, ↗

A Fast Algorithm for Computing Zigzag Representatives

Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with m insertions and deletions can be computed $O(m^ω)$ in time, where $ω < 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^3 n)$ time algorithm for this problem, where $n ≤ m$ is the size of the largest complex in the filtration.

Persistent homology↗

Accelerated screening of functional atomic impurities in halide perovskites using high-throughput computations and machine learning

The pressing need for novel materials that can serve rising demands in solar cell and optoelectronic technologies makes the nexus of halide perovskites, high-throughput computations, and machine learning, very promising. Ever increasing amounts of data on the structure, fundamental properties, and device performance of halide perovskites provide opportunities for learning chemical rules and design principles that make these materials attractive, and applying them across wide chemical spaces. In this work, we show that impurity properties of halide perovskites computed using density functional theory (DFT) can be combined with machine learning (ML) to deliver predictive models and quick identification of optoelectronically active impurity atoms. Our computation lead to the largest reported dataset of the formation energies and charge transition levels of Pb-site impurities in methylammonium lead halide (MAPbX 3 ) perovskites. Descriptors are defined to uniquely represent any impurity atom in any MAPbX 3 compound and mapped to the computed impurity properties using regression techniques such as Gaussian process regression, neural networks, and random forests. We use the best optimized predictive models to make predictions for hundreds of impurities across 9 MAPbX 3 compounds and create lists of dominating impurities, that is, impurities that can shift the equilibrium Fermi level in the perovskite as determined by native point defects. Finally, this accelerated screening powered by computations and machine learning can guide the identification of problematic impurities that may cause undesired recombination of charge carriers, as well as impurities that can be deliberately introduced to tune the perovskite conductivity and resulting photovoltaic absorption.

36 MATERIALS SCIENCE↗

Computational Simulation of an Additively Manufactured Marine Component

Early work in finite-element analysis of additive manufacturing (AM) components was not able to include distortion and residual stress of the entire build, yielding uncertainty in the computational model predictions. To address this, current versions of recently developed computational tools are being used to understand their role in validation at the Naval Surface Warfare Center, Carderock Division, for laser powder-bed fusion (L-PBF) AM. A 316L stainless steel L-PBF build containing multiple parts, which exhibited the same local part failure over multiple AM fabrication runs, was selected for computational analysis. Single-part simulations analyzed optimization of computational speed and prediction accuracy. Full-build simulations exposed the smallest re-coater tolerances early in part fabrication as a result of part shrinkage and subsequent cupping. This cupping was predicted to change the powder spreading and result in the non-consolidation of the support structures, which paralleled the failures seen in the physical builds. Part redesign of the conventionally produced part to align with AM fabrication requirements was recommended to alleviate the build failures. This project is part of a larger program focused on validation of the computational tools to determine best practices for insertion of AM simulation into the greater Naval enterprise.

36 MATERIALS SCIENCE↗

FPGA-Accelerated Machine Learning Inference as a Service for Particle Physics Computing

Large-scale particle physics experiments face challenging demands for high-throughput computing resources both now and in the future. New heterogeneous computing paradigms on dedicated hardware with increased parallelization, such as Field Programmable Gate Arrays (FPGAs), offer exciting solutions with large potential gains. The growing applications of machine learning algorithms in particle physics for simulation, reconstruction, and analysis are naturally deployed on such platforms. We demonstrate that the acceleration of machine learning inference as a web service represents a heterogeneous computing solution for particle physics experiments that potentially requires minimal modification to the current computing model. As examples, we retrain the ResNet-50 convolutional neural network to demonstrate state-of-the-art performance for top quark jet tagging at the LHC and apply a ResNet-50 model with transfer learning for neutrino event classification. Using Project Brainwave by Microsoft to accelerate the ResNet-50 image classification model, we achieve average inference times of 60 (10) ms with our experimental physics software framework using Brainwave as a cloud (edge or on-premises) service, representing an improvement by a factor of approximately 30 (175) in model inference latency over traditional CPU inference in current experimental hardware. A single FPGA service accessed by many CPUs achieves a throughput of 600–700 inferences per second using an image batch of one, comparable to large batch-size GPU throughput and significantly better than small batch-size GPU throughput. Deployed as an edge or cloud service for the particle physics computing model, coprocessor accelerators can have a higher duty cycle and are potentially much more cost-effective.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

$χ$-$MeRA$: Computationally efficient adaptive mesh refinement of Monte Carlo mesh based tallies

Here, the reactor physics community is always focused on reducing the computational time and memory required for simulations. $χ$-$MeRA$, which stands for flux-based-($χ$)-Mesh tally Refinement Adaptively, was built to reduce the computational time and memory required to solve the neutronics side of a multiphysics problem when compared to traditional methods for mesh based tallies in Monte Carlo (MC) simulations. $χ$-$MeRA$ couples a MC code with an adaptive mesh refinement (AMR) algorithm to take advantage of the accuracy of a MC code and the efficiency of an AMR algorithm. Also developed within $χ$-$MeRA$ was a set of metrics to assess the effects of the refinement on various parameters in the simulation space. For a plutonium sphere, $χ$-$MeRA$ shows a reduction in memory usage and computation time when compared to a fully refined mesh by a factor of 14.7 and 6.7, respectively. When compared to an unstructured mesh, improvement of 1.3 and 4.8 was achieved for memory usage and computation time. The development of $χ$-$MeRA$ helps solve the neutronics side of a multiphysics problem in a faster, more computationally efficient manner than traditional methods, and the final mesh created contains accurate results that can be passed onto the next physics code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Considering computational speed vs. accuracy: Choosing appropriate mesoscale RVE boundary conditions

Modeling a material’s microstructure using continuum theories allows for inspection of the relationship between coarse scale and fine scale behaviors. Computational limits generally require selection of a sub-volume from a bulk sample in order to directly model the microstructure. Boundary conditions are applied to the sub-volume to mimic the excluded bulk material. Appropriate selection of boundary conditions helps effectively determine the appropriate spatial scale required of the sub-volume. Applicable boundary conditions include direct displacement, periodic, and uniform traction. While direct displacement and periodic boundary conditions are commonly used, uniform traction boundary conditions have seen limited use due to rigid body stability issues in simulations of compression or shear deformation. A new application of uniform traction boundary conditions was developed through linear constraint equations, similar to approaches employed by direct displacement and periodic boundary conditions, to quench rigid body motions with minimal interference of the relative deformation of the model. These boundary conditions were tested by compressing several synthetically generated periodic microstructures using the finite element method. Evaluating the effective stiffness along the compression axis, the direct displacement boundary condition produced the stiffest response, whereas the uniform traction boundary condition produced the most compliant. Periodic boundary conditions produced the same response for all volumes analyzed and both the direct displacement and uniform traction boundary conditions trended toward the periodic response as the domain volume increased. Computational performance was also evaluated for each boundary condition using implicit and explicit solvers. Direct displacement boundary conditions presented the lowest computational cost of all of the boundary conditions followed by periodic then uniform traction. The computational expense of periodic and uniform traction boundary conditions limited the viable spatial scale and mesh resolutions able to be simulated. Selection of appropriate boundary conditions for specific uses need to be a balance between allowable computational expense and accuracy of the method. Techniques for evaluating which boundary conditions to use are discussed.

42 ENGINEERING↗

Deformation accommodating periodic computational domain for a uniform velocity gradient

Many multiscale methods for granular materials use periodic computational domains to consider particle scale interactions and then calculate the stress to drive the continuum scale calculations. For problems involving large material deformations, the computation domain often needs to be reinitialized because of the distortion, causing the loss of the history information of the system. This work introduces an algorithm to accommodate a large deformation of the material while maintaining the computational domain cuboid to avoid the domain reinitialization during the computation. The algorithm uses a rotating frame of reference, in which the velocity gradient can be represented by an upper triangular matrix. The deformation caused by the upper triangular matrix is treated by the image system implied in the periodicity to maintain the computational domain cuboid. The effect from the rotation of the reference frame is considered using the inertial forces. Finally, simulations of simple and pure shear motions are carried out to illustrate the algorithm.

42 ENGINEERING↗

Enabling end-to-end secure federated learning in biomedical research on heterogeneous computing environments with APPFLx

Facilitating large-scale, cross-institutional collaboration in biomedical machine learning (ML) projects requires a trustworthy and resilient federated learning (FL) environment to ensure that sensitive information such as protected health information is kept confidential. Specifically designed for this purpose, this work introduces APPFLx - a low-code, easy-to-use FL framework that enables easy setup, configuration, and running of FL experiments. APPFLx removes administrative boundaries of research organizations and healthcare systems while providing secure end-to-end communication, privacy-preserving functionality, and identity management. Furthermore, it is completely agnostic to the underlying computational infrastructure of participating clients, allowing an instantaneous deployment of this framework into existing computing infrastructures. Experimentally, the utility of APPFLx is demonstrated in two case studies: (1) predicting participant age from electrocardiogram (ECG) waveforms, and (2) detecting COVID-19 disease from chest radiographs. Here, ML models were securely trained across heterogeneous computing resources, including a combination of on-premise high-performance computing and cloud computing facilities. By securely unlocking data from multiple sources for training without directly sharing it, these FL models enhance generalizability and performance compared to centralized training models while ensuring data remains protected. In conclusion, APPFLx demonstrated itself as an easy-to-use framework for accelerating biomedical studies across organizations and healthcare systems on large datasets while maintaining the protection of private medical data.

Biomedical Research↗

Oak Ridge Computing Academy: An HPC cluster deployment and management pilot

The High Performance Computing Technologies (HPCT) course is a hands-on High Performance Computing (HPC) cluster deployment and management training program offered as part of the International School for Advanced Studies (SISSA) and the International Center for Theoretical Physics (ICTP) Master in High Performance Computing (MHPC) specialization. Here, this training program introduces students to key concepts in cluster configuration. which include networking, software stack provisioning, job scheduling, and monitoring. The publicly available course materials feature several examples and underlying methods that are broadly applicable to cluster deployment and management. This paper discusses the design of a new workforce development program at the Oak Ridge National Laboratory that is based on HPCT, the Oak Ridge Computing Academy (ORCA). The ORCA pilot program was hosted by the Oak Ridge Leadership Computing Facility (OLCF) in Summer 2025. As a part of this discussion, HPCT and ORCA course contents and infrastructure are outlined, ORCA participant experiences are detailed, and potential opportunities for improvement are discussed.

Education↗

On computing the evolution of temperature for materials under dynamic loading

Modeling and simulation of the dynamic response of materials is important to many applications including the development of armor systems, understanding the safety of explosives, and assessing the crashworthiness of vehicles. Within such applications it is often critical to accurately compute the evolution of the temperature because it is a state variable that affects the kinetics of competing active processes within the material (e.g., dislocation motion, phase transformation, decomposition). Depending on the selection of an independent state variable, e.g. temperature or entropy, the approach for computing temperature is well understood based on the thermodynamic framework attributed to Coleman and Noll. However, different computational codes used for modeling the dynamic response of materials adopt different independent state variables. In this work, two thermodynamically consistent strategies for computing the temperature of a coupled thermodynamic state are compared and implemented into two different Lagrangian computational codes. The equivalence of these two approaches is established through the numerical solutions of several test problems. Finally, the implication of various approximations made to each of these approaches within the literature are assessed in the context of uniaxial stress conditions (split Hopkinson pressure bar experiments) and uniaxial strain conditions (plate impact experiments). Here, it is shown that the temperature rate or energy partition approaches are equivalent when implemented in their complete forms, but that several common simplifying assumptions, that are warranted in the case of uniaxial stress, lead to significant errors in the resulting Hugoniot state for plate impact.

36 MATERIALS SCIENCE↗

Computational chemistry for NH 3 synthesis, hydrotreating, and NO x reduction: Three topics of special interest to Haldor Topsøe

Computational chemistry, especially density functional theory, has experienced a remarkable growth in terms of application over the last few decades. This is attributed to the improvements in theory and computing infrastructure that enable the analysis of systems of unprecedented size and detail at an affordable computational expense. In this perspective, we discuss recent progress and current challenges facing electronic structure theory in the context of heterogeneous catalysis. We specifically focus on the impact of computational chemistry in elucidating and designing catalytic systems in three topics of interest to Haldor Topsøe – ammonia, synthesis, hydrotreating, and NO x reduction. Furthermore, we then discuss the common tools and concepts in computational catalysis that underline these topics and provide a perspective on the challenges and future directions of research in this area of catalysis research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical Verification of Equilibrium Thermodynamic Computations in Nuclear Fuel Performance Codes

There is an increasing desire to integrate thermodynamic computations directly into multi-physics nuclear fuel performance and safety codes. These computations provide, among other matters, boundary conditions in heat and mass transport modules in predicting fuel behaviour. Precision must be maintained in computations involving fission and activation products with very low concentrations which may nonetheless have significant radiological consequences. Also, there is the concern about the propagation of numerical errors in multi-physics codes. A method to numerically verify equilibrium thermodynamic computations is therefore necessary to satisfy rigorous quality assurance standards of the nuclear industry without significantly impeding computational performance. A technique is presented that can be applied to systems of any number of phases and system components. The technique is reliable and comprehensive in ensuring that all conceivable equilibrium constants have been satisfied without having to formulate each one of a potentially very large number.

Piro, Markus↗

Computation of conventional and alternative jet fuel sensitivity to lean blowout

Large Eddy Simulations (LES) are performed to compute the sensitivity of a conventional (A-2) and an alternate bio-jet (C-1) fuel to Lean Blowout (LBO). A realistic aviation gas turbine engine combustor configuration is considered. Reliable experimental LBO data and OH* chemiluminescence data for the conventional and alternate jet fuel in the combustor configuration have recently become available. The present work utilizes a highly automated, on-the-fly meshing strategy, along with adaptive mesh refinement, to demonstrate the feasibility of capturing the realistic combustion processes. A Lagrangian framework, with initial conditions specified using measurements of spray statistics, is used to model the fuel spray. Newly developed compact reaction mechanisms based on fuel surrogates are validated for the A-2 and the C-1 fuels. The compact reaction mechanisms are implemented using a detailed finite rate chemistry solver. Spray statistics computed by the present LES simulations compare well with available measurements at stable flame conditions near the lean blowout limit. The computed shape of the stable flame as represented by line integrated OH concentrations compares well with the experimental OH* chemiluminescence data. Lean blowout is reached by gradually decreasing the fuel flow rate in the computations, similar to that in the experiments. The results of the LES simulations effectively capture the fuel composition effects and estimate the sensitivity of the LBO limits to the fuel type. The computed trends in LBO limits agree within engineering accuracy with the experimental results for conventional and alternative aviation fuels. The methodology for predicting the fuel composition effects on the lean blowout limits in a fully resolved realistic, complex combustor is established for the first time.

Adaptive mesh refinement↗

Probing the structure of complex solids using a distributed computing approach-Applications in zeolite science

We demonstrate the viability of distributed computing techniques employing idle desktop computers in investigating complex structural problems in solids. Through the use of a combined Monte Carlo and energy minimisation method, we show how a large parameter space can be effectively scanned. By controlling the generation and running of different configurations through a database engine, we are able to not only analyse the data 'on the fly' but also direct the running of jobs and the algorithms for generating further structures. As an exemplar case, we probe the distribution of Al and extra-framework cations in the structure of the zeolite Mordenite. We compare our computed unit cells with experiment and find that whilst there is excellent correlation between computed and experimentally derived unit cell volumes, cation positioning and short-range Al ordering (i.e. near neighbour environment), there remains some discrepancy in the distribution of Al throughout the framework. We also show that stability-structure correlations only become apparent once a sufficiently large sample is used. - Graphical Abstract: Aluminium distributions in zeolites are determined using e-science methods. Highlights: > Use of e-science methods to search configurationally space. > Automated control of space searching. > Identify key structural features conveying stability. > Improved correlation of computed structures with experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fluid learning: Mimicking brain computing with neuromorphic nanofluidic devices

Relentlessly rising energy demands in computing call for rethinking hardware paradigms with energy efficiency in mind. Nature’s example—the brain—raises the question: How can these natural computers achieve remarkable feats with minimal energy compared to supercomputers? Neuromorphic computing mimics the brain’s principles, but current neuromorphic concepts using electronic components face scalability and their own power consumption challenges. A potentially revolutionary approach is emerging: computing with ion transport in water through nanochannels. This field offers energy-efficient possibilities by imitating brain-like information processing with different types of ions as carriers. Finally, the goal is to converge advanced nanoscale architectures with brain-inspired efficiency, heralding a new era of computing.

77 NANOSCIENCE AND NANOTECHNOLOGY↗