Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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,513 records · Page 84

Solving Seismic Wave Equations on Variable Velocity Models With Fourier Neural Operator

Here, in the study of subsurface seismic imaging, solving the acoustic wave equation is a pivotal component in existing models. The advancement of deep learning (DL) enables solving partial differential equations (PDEs), including wave equations, by applying neural networks to identify the mapping between the inputs and the solution. This approach can be faster than traditional numerical methods when numerous instances are to be solved. Previous works that concentrate on solving the wave equation by neural networks consider either a single velocity model or multiple simple velocity models, which is restricted in practice. Instead, inspired by the idea of operator learning, this work leverages the Fourier neural operator (FNO) to effectively learn the frequency domain seismic wavefields under the context of variable velocity models. We also propose a new framework paralleled FNO (PFNO) for efficiently training the FNO-based solver given multiple source locations and frequencies. Numerical experiments demonstrate the high accuracy of both FNO and PFNO with complicated velocity models in the OpenFWI datasets. Furthermore, the cross-dataset generalization test verifies that PFNO adapts to out-of-distribution velocity models. Finally, PFNO admits higher computational efficiency on large-scale testing datasets than the traditional finite-difference method. The aforementioned advantages endow the FNO-based solver with the potential to build powerful models for research on seismic waves.

58 GEOSCIENCES↗

Intelligent System Partitioning for Agent-Based Security Constrained Optimal Power Flow

This project developed scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems as part of a larger series of competitions run by ARPA-E. These problems are important because the secure and reliable operation of the power grid, especially under increased uncertainty and variability, is growing increasingly challenging. The economic feasibility of the proposed methods developed by our team is quite low, considering it’s a purely software-based solution to operate power grids more efficiently. The technical effectiveness, as evidenced by our performance in the competition, balances heuristics and approximations to provide a tradeoff between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel Computation for Natural Convection in Cavities

Parallel computation for thermal convective flows in cavities with adiabatic horizontal boundaries and driven by differential heating of the two vertical end walls, is investigated using supercomputers. A parallel computation code has been implemented using a finite-difference method with a multigrid elliptic solver and a Dufort-Frankel scheme. The domain decomposition techniques are discussed in detail. The parallel code is numerically stable, computationally efficient, and portable to various parallel architectures which support either PVM or NX libraries for communications. Finally, numerical results for various Rayleigh numbers and Prandtl numbers are presented.

convection simulation parallel computation↗

Updated Chemical Kinetics and Sensitivity Analysis Code

An updated version of the General Chemical Kinetics and Sensitivity Analysis (LSENS) computer code has become available. A prior version of LSENS was described in "Program Helps to Determine Chemical-Reaction Mechanisms" (LEW-15758), NASA Tech Briefs, Vol. 19, No. 5 (May 1995), page 66. To recapitulate: LSENS solves complex, homogeneous, gas-phase, chemical-kinetics problems (e.g., combustion of fuels) that are represented by sets of many coupled, nonlinear, first-order ordinary differential equations. LSENS has been designed for flexibility, convenience, and computational efficiency. The present version of LSENS incorporates mathematical models for (1) a static system; (2) steady, one-dimensional inviscid flow; (3) reaction behind an incident shock wave, including boundary layer correction; (4) a perfectly stirred reactor; and (5) a perfectly stirred reactor followed by a plug-flow reactor. In addition, LSENS can compute equilibrium properties for the following assigned states: enthalpy and pressure, temperature and pressure, internal energy and volume, and temperature and volume. For static and one-dimensional-flow problems, including those behind an incident shock wave and following a perfectly stirred reactor calculation, LSENS can compute sensitivity coefficients of dependent variables and their derivatives, with respect to the initial values of dependent variables and/or the rate-coefficient parameters of the chemical reactions.

Radhakrishnan, Krishnan↗

Machine learning coarse grained models for water

An accurate and computationally efficient molecular level description of mesoscopic behavior of ice-water systems remains a major challenge. Here, we introduce a set of machine-learned coarse-grained (CG) models (ML-BOP, ML-BOP dih , and ML-mW) that accurately describe the structure and thermodynamic anomalies of both water and ice at mesoscopic scales, all at two orders of magnitude cheaper computational cost than existing atomistic models. In a significant departure from conventional force-field fitting, we use a multilevel evolutionary strategy that trains CG models against not just energetics from first-principles and experiments but also temperature-dependent properties inferred from on-the-fly molecular dynamics (~ 10’s of milliseconds of overall trajectories). Our ML BOP models predict both the correct experimental melting point of ice and the temperature of maximum density of liquid water that remained elusive to-date. Our ML workflow navigates efficiently through the high-dimensional parameter space to even improve upon existing high-quality CG models (e.g. mW model).

42 ENGINEERING↗

Efficient Viscous Design of Realistic Aircraft Configurations

This paper addresses the use of the Constrained Direct Iterative Surface Curvature (CDISC) design method in the aircraft design process. A discussion of some of the requirements for practical use of CFD in the design process is followed by a description of different CFD design methods, along with their relative strengths and weaknesses. A detailed description of the CDISC design method highlights some of the aspects of the method that provide computational efficiency and portability, as well as the flow and geometry constraint capabilities. In addition, an efficient approach to multipoint design, the Weighted Averaging of Geometries (WAG) method, is described and illustrated using a couple of simple examples. The CDISC and WAG methods are then applied to a complex generic business jet geometry using an unstructured grid flow solver to demonstrate the multipoint and multicomponent design capabilities of these methods. Introduction

Campbell, Richard L.↗

Photocatalytic water splitting—The untamed dream: A review of recent advances

Here, photocatalytic water splitting using sunlight is a promising technology capable of providing high energy yield without pollutant byproducts. Herein, we review various aspects of this technology including chemical reactions, physiochemical conditions and photocatalyst types such as metal oxides, sulfides, nitrides, nanocomposites, and doped materials followed by recent advances in computational modeling of photoactive materials. As the best-known catalyst for photocatalytic hydrogen and oxygen evolution, TiO 2 is discussed in a separate section, along with its challenges such as the wide band gap, large overpotential for hydrogen evolution, and rapid recombination of produced electron-hole pairs. Various approaches are addressed to overcome these shortcomings, such as doping with different elements, heterojunction catalysts, noble metal deposition, and surface modification. Development of a photocatalytic corrosion resistant, visible light absorbing, defect-tuned material with small particle size is the key to complete the sunlight to hydrogen cycle efficiently. Computational studies have opened new avenues to understand and predict the electronic density of states and band structure of advanced materials and could pave the way for the rational design of efficient photocatalysts for water splitting. Future directions are focused on developing innovative junction architectures, novel synthesis methods and optimizing the existing active materials to enhance charge transfer, visible light absorption, reducing the gas evolution overpotential and maintaining chemical and physical stability

36 MATERIALS SCIENCE↗

Linking microscopic and macroscopic response in disordered solids

The modulus of a rigid network of harmonic springs depends on the sum of the energies in each of the bonds due to an applied distortion such as compression in the case of the bulk modulus or shear in the case of the shear modulus. Yet, the distortion need not be global. Here we introduce a local modulus, L i , associated with changing the equilibrium length of a single bond, i , in the network. We show that L i is useful for understanding many aspects of the mechanical response of the entire system. It allows an efficient computation of how the removal of any bond changes the global properties such as the bulk and shear moduli. Additionally, it allows a prediction of the distribution of these changes and clarifies why the changes of these two moduli due to removal of a bond are uncorrelated; these are the essential ingredients necessary for the efficient manipulation of network properties by bond removal.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Effect of Reaction Kinetics on Graphene-Edge Morphology and Composition

New simulations of graphene growth in flame environments are presented. The simulations employed a kinetic Monte Carlo (KMC) algorithm coupled to molecular mechanics (MM) geometry optimization to track individual graphenic species as they evolve. Focus was given to incorporation of five-member rings and resulting curvature and edge defects. The model code was re-written to be more computationally efficient enabling a larger set of simulations to be run, decreasing stochastic fluctuations in the averaged results. The model also included updated rate coefficients for graphene edge reactions recently published in the literature. Sensitivity analysis, enabled by the more efficient coding, confirmed the importance of the updated rates as well as providing further insight on key reactions controlling layer growth and morphology. The new KMC code was applied to simulate graphene-layer growth in the environments of laminar premixed flames. Finally, in these flame simulations, C-H ratios of evolving structures were computed and compared to those from experiment and from an alternate model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An alternative approach to the numerical simulation of steady inviscid flow

A numerical procedure for the efficient simulation of steady inviscid flow is described and its utility demonstrated. Application of the surrogate equation technique allows the formulation of stable, fully conservative, type dependent finite difference equations for use in obtaining numerical solutions to systems of first order partial differential equations, such as the steady state Euler equations or their various approximations. Computational results are presented for the full Euler equations and for the transonic disturbance equations. For the latter case, a computational efficiency greater than that obtained by means of the standard perturbation potential approach is indicated.

Johnson, G. M.↗

UDU/T/ covariance factorization for Kalman filtering

There has been strong motivation to produce numerically stable formulations of the Kalman filter algorithms because it has long been known that the original discrete-time Kalman formulas are numerically unreliable. Numerical instability can be avoided by propagating certain factors of the estimate error covariance matrix rather than the covariance matrix itself. This paper documents filter algorithms that correspond to the covariance factorization P = UDU(T), where U is a unit upper triangular matrix and D is diagonal. Emphasis is on computational efficiency and numerical stability, since these properties are of key importance in real-time filter applications. The history of square-root and U-D covariance filters is reviewed. Simple examples are given to illustrate the numerical inadequacy of the Kalman covariance filter algorithms; these examples show how factorization techniques can give improved computational reliability.

Thornton, C. L.↗

Implicit unsteady transonic airfoil calculations at supersonic freestreams

The computer code LTRAN2 has been extended to compute unsteady transonic flows about oscillating airfoils with supersonic freestreams. The LTRAN2 code uses an alternating direction implicit (ADI) algorithm to solve the two-dimensional, nonlinear, low-frequency, transonic small-disturbance (LF-TSD) equation. The modified code, LTRAN2-SS, includes a 'high-frequency' option. Steady solutions are checked against those computed by the steady TSD code, TSFOIL; unsteady computations of the linear LF-TSD equation are compared with known linear theory solutions; and new unsteady nonlinear solutions are presented. These cases include standard AGARD test cases for the NLR 7301, MBB-A3, and DO Al supercritical airfoils, as well as several NACA airfoils. The modified code enables aerodynamicists to quickly and efficiently compute transonic flows for both subsonic and supersonic freestreams, and thus resolve flutter boundaries through the full extent of the transonic dip phenomenon.

Chow, L. J.↗

A diagonal algorithm for the method of pseudocompressibility

The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

Rogers, S. E.↗

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗

Ray Tracing Techniques for the Characterization of Lunar Communication Architectures

This paper provides an overview of the computational techniques used to characterize the viability of different lunar architectures and their ability to provide communication services to the lunar surface. This analysis was done with modern ray tracing techniques that allow for the computations to be done on Graphics Processing Unit (GPU) clusters for a high level of parallelism and severe reduction in computation time. The ray tracing computations were done with the GPU platform Compute Unified Device Architecture (CUDA) provided by NVIDIA which utilizes general-purpose computing on graphics processing units (GPGPU). This new method provides the advantage of being able to characterize a much larger portion of the lunar surface due to its computational efficiency as well as providing a more accurate representation of elevation angle limits instead of the typical and often inaccurate elevation angle mask. The Lunar surface can now be characterized with metrics such as contact time, outage time, and received data rate. With these metrics, different proposed Lunar architectures can be rapidly evaluated. This reduction in computation time not only leads to more accurate results but allows these results to be obtained in a time frame that allows for the complete characterization of the trade space. It is expected that these different architecture comparisons will lead to a conclusive determination of the optimal Lunar architecture and will allow for future Lunar missions to operate as close to real time as possible. In addition, this computation method can be used to recreate visibility figures generated by previous methods but with an increased level of accuracy.

Thomas Montano↗

Status of the TOUGH-FLAC simulator and recent applications related to coupled fluid flow and crustal deformations

This paper presents recent advancement in and applications of TOUGH-FLAC, a simulator for multiphase fluid flow and geomechanics. The TOUGH-FLAC simulator links the TOUGH family multiphase fluid and heat transport codes with the commercial FLAC{sup 3D} geomechanical simulator. The most significant new TOUGH-FLAC development in the past few years is a revised architecture, enabling a more rigorous and tight coupling procedure with improved computational efficiency. The applications presented in this paper are related to modeling of crustal deformations caused by deep underground fluid movements and pressure changes as a result of both industrial activities (the In Salah CO{sub 2} Storage Project and the Geysers Geothermal Field) and natural events (the 1960s Matsushiro Earthquake Swarm). Finally, the paper provides some perspectives on the future of TOUGH-FLAC in light of its applicability to practical problems and the need for high-performance computing capabilities for field-scale problems, such as industrial-scale CO{sub 2} storage and enhanced geothermal systems. It is concluded that despite some limitations to fully adapting a commercial code such as FLAC{sup 3D} for some specialized research and computational needs, TOUGH-FLAC is likely to remain a pragmatic simulation approach, with an increasing number of users in both academia and industry.

54 ENVIRONMENTAL SCIENCES↗

Automatic identification and quantification of dense microcracks in high-performance fiber-reinforced cementitious composites through deep learning-based computer vision

Highlights: • A method is presented to detect, locate, quantify, and visualize dense microcracks in HPFRCC. • Quantification of dense microcracks is realized using deep learning method for the first time. • The presented method uses deep learning models that are trained using a realistic dataset size. • The presented method has a high computation efficiency for identifying and quantifying cracks. • The presented method provides crack width with errors up to 50 μm and a R{sup 2} value of 0.984. High-performance fiber-reinforced cementitious composites (HPFRCCs) feature high mechanical strengths, crack resistance, and durability. Under excessive loading, HPFRCCs demonstrate dense microcracks that are difficult to identify using existing methods. This study presents a computer vision method for identification, quantification, and visualization of microcracks in HPFRCCs based on deep learning. The presented method integrates multiple deep learning models and computer vision techniques in a hierarchical architecture. The crack pattern (e.g., number, width, and spacing of cracks) are automatically determined from pictures without human intervention. This study shows that the presented method achieves an accuracy of 0.992 for crack detection and an accuracy finer than 50 μm (R{sup 2} > 0.984) for quantification of crack width when deep learning models are trained using only 200 pictures of HPFRCCs and 200 pictures of conventional concrete with incorporation of data augmentation. The presented method is expected to be also applicable to other materials featuring complex cracks.

36 MATERIALS SCIENCE↗

Hijacking a rapid and scalable metagenomic method reveals subgenome dynamics and evolution in polyploid plants

Premise: The genomes of polyploid plants archive the evolutionary events leading to their present forms. However, plant polyploid genomes present numerous hurdles to the genome comparison algorithms for classification of polyploid types and exploring genome dynamics. Methods: Here, the problem of intra- and inter-genome comparison for examining polyploid genomes is reframed as a metagenomic problem, enabling the use of the rapid and scalable MinHashing approach. To determine how types of polyploidy are described by this metagenomic approach, plant genomes were examined from across the polyploid spectrum for both k-mer composition and frequency with a range of k-mer sizes. In this approach, no subgenome-specific k-mers are identified; rather, whole-chromosome k-mer subspaces were utilized. Results: Given chromosome-scale genome assemblies with sufficient subgenome-specific repetitive element content, literature-verified subgenomic and genomic evolutionary relationships were revealed, including distinguishing auto- from allopolyploidy and putative progenitor genome assignment. The sequences responsible were the rapidly evolving landscape of transposable elements. An investigation into the MinHashing parameters revealed that the downsampled k-mer space (genomic signatures) produced excellent approximations of sequence similarity. Furthermore, the clustering approach used for comparison of the genomic signatures is scrutinized to ensure applicability of the metagenomics-based method. Discussion: The easily implementable and highly computationally efficient MinHashing-based sequence comparison strategy enables comparative subgenomics and genomics for large and complex polyploid plant genomes. Such comparisons provide evidence for polyploidy-type subgenomic assignments. In cases where subgenome-specific repeat signal may not be adequate given a chromosomes' global k-mer profile, alternative methods that are more specific but more computationally complex outperform this approach.

59 BASIC BIOLOGICAL SCIENCES↗