Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Domain reduction method”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Subsurface Trend Analysis domains for the northern Gulf of Mexico

Geologic domains for the northern Gulf of Mexico derived using the Subsurface Trend Analysis (STA) method. The domains were postulated using geologic province, lithologic, and structural information and validated using statistical methods. Publication detailing the STA method: Rose, K., Bauer, J.R., and Mark-Moser, M. (2020) Subsurface trend analysis, a multi-variate geospatial approach for subsurface evaluation and uncertainty reduction, Interpretation, vol. 8, issue 1 https://library.seg.org/doi/abs/10.1190/int-2019-0019.1 Detailed discussion of domain formation and analysis: Mark-Moser, M., Miller, R., Bauer, J., Rose, K., and C. Disenhof. 2018, Analysis of Subsurface Reservoir Properties Using a Novel Geospatial Approach, Offshore Gulf of Mexico. NETL-TRS-2018 https://edx.netl.doe.gov/dataset/detailed-analysis-of-geospatial-trends-of-hydrocarbon-accumulations-offshore-gulf-of-mexico

geology↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Parallel Time Integration for Constrained Optimization

The number of transistors in an average processor continues to increase, but individual clock speeds have plateaued. Those transistors are instead going into additional cores, increasing the number of different things that a processor can do at once and placing an emphasis on parallel computation. Many problems in scientific computing follow a time-evolution model, and it can be difficult to solve such problems in parallel across the temporal domain. The Multi-Grid Reduction In Time (MGRIT) algorithm, developed at Lawrence Livermore National Laboratory (LLNL), solves differential equations with a method designed specifically to take advantage of extreme numbers of processors by parallelizing across time. The Tri-diagonal MGRIT (TriMGRIT) algorithm, also developed at LLNL, is a generalization of MGRIT which enables parallel-in-time solving of a greater number of problems. Constrained optimization problems, in particular, may be solved in parallel using TriMGRIT. These consist of choosing a control function such that an objective functional is minimized, constrained by a differential-equation. We consider two such problems: applying torque to a pendulum to bring it to a gentle stop and moving a crowd of people from one distribution into another. We also perform some miscellaneous theoretical and practical research, including investigating the use of a line-search subroutine to refine intermediate TriMGRIT results and preliminary work on strategies for choosing operators for TriMGRIT to use.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

3D Frequency Domain Reflectometry Digital Twin of an Electrical Cable: A First Glance

Electrical cables within nuclear power plants (NPPs) are critical components required for power, control, and instrumentation systems which may be exposed to stressors, such as elevated temperatures and gamma radiation. Such stressors can lead to a reduction in the remaining useful life of electrical cables, jeopardizing the safety of NPP systems. To evaluate the effect of stressors on the degradation of electrical cables, electrical reflectometry methods are commonly employed. Frequency domain reflectometry (FDR) is a non-destructive electrical reflectometry method that uses transmission line theory to detect degradation or impedance changes within electrical cables. However, in most cases FDR is only applied to de-energized cables, limiting the application in NPPs as the cable system must be taken offline. In this work, we explore the development of an FDR digital twin to predict the degradation of an electrical cable exposed to elevated temperature, which is expected to reduce the need for offline FDR. A 3-conductor low-voltage electrical cable was selected for evaluation of the digital twin. The fully three-dimensional digital twin was developed in COMSOL using the RF module. A cable length of 30-m and frequency bandwidth of 400 MHz was selected to mimic real-world application of FDR. Over a 1-m region, the permittivity of the insulation was varied by up to 20% to model thermal degradation. The results demonstrate accurate detection of the insulation damage region, supporting further investigation of the FDR digital twin using real-world data and machine learning for predictive damage estimation or remaining lifetime.

Spencer, Mychal P.↗
DOE OSTI2022

Variance reduction techniques for Monte Carlo neutron noise simulations

The small fluctuations of the neutron flux caused by small perturbations of the macroscopic cross-sections take the name of neutron noise. Advanced Monte Carlo methods have been recently proposed in order to solve the neutron noise equations in the frequency domain, which allows establishing reference solutions to validate faster but approximate deterministic solvers. Due to the presence of particles carrying two statistical weights (for the real and imaginary components of the noise field), both of which may be positive or negative, Monte-Carlo simulations of neutron noise pose distinct challenges in terms of variance reduction. In this work we investigate two variance-reduction techniques, namely branchless collisions and weight cancellation, and probe their effectiveness for a benchmark con- figuration concerning the noise field induced by a pin with oscillating cross sections in a fuel assembly.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Revisiting Power Systems Time-Domain Simulation Methods and Models

The changing nature of power systems dynamics is challenging present practices related to modeling and study of system-level dynamic behavior. While developing new techniques and models to handle the new modeling requirements, it is also critical to review some of the terminology used to describe existing simulation approaches and the embedded assumptions. This article provides a first-principles review of the simplifications and transformations commonly used in the formulation of time-domain simulation models. It introduces a taxonomy and classification of time-domain simulation models depending on their frequency bandwidth, network representation, and software availability. Furthermore, it focuses on the fundamental aspects of averaging techniques, and model reduction approaches that result in modeling choices, and discusses the associated challenges and opportunities of applying these methods in systems with large shares of Inverter Based Resources (IBRs). The article concludes with an illustrative simulation that compares the trajectories of an IBR-dominated system.

behavioral sciences↗
DOE OSTI2024

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An assessment of the utility of multirate time integration for the modeling of laser powder bed fusion

Finite element simulation of the laser powder bed fusion process is made challenging by the inherently multiscale nature of the process. When using the typical global time stepping techniques, slowly-evolving regions of the domain receive the same numerical treatment as the regions with the highest temperature rates. The current work details the implementation and evaluation of an implicit multirate method which is able to advance different regions of the domain with distinct time steps, depending on their current solution rate. Previous work indicates that this representation of the temporal scales of the problem can lead to significant reductions in wall clock run time, and it is shown herein that multirate time integration, when used with a uniform process-scale mesh, can result in speedups of approximately 19, 42, and 87 times, for domains with edge lengths of approximately 1 mm, 2 mm, and 5 mm, respectively. When used in conjunction with $\ h$-refinement (limited to two levels of refinement), the resulting speedups (taken relative to the uniform mesh) are around 28, 85, and 665 times. The method is demonstrated to converge as indicated by the literature, and its use with an AM-Bench domain is demonstrated.

42 ENGINEERING↗
DOE OSTI2023

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dimensionality reduction

This chapter presents an introduction to some of the key dimensionality reduction methods currently used in data science. The intended audience is pure mathematicians. The chapter puts special emphasis on connecting the fundamental ideas in dimensionality reduction to a diverse set of mathematical domains, including geometry, dynamical systems, representation theory, and category theory.

dimension reduction, geometry, dynamical systems, ↗
DOE OSTI2024

3D Multiresolution Velocity Model Fusion with Probability Graphical Models

ABSTRACT The variability in spatial resolution of seismic velocity models obtained via tomographic methodologies is attributed to many factors, including inversion strategies, ray-path coverage, and data integrity. Integration of such models, with distinct resolutions, is crucial during the refinement of community models, thereby enhancing the precision of ground-motion simulations. Toward this goal, we introduce the probability graphical model (PGM), combining velocity models with heterogeneous resolutions and nonuniform data point distributions. The PGM integrates data relations across varying resolution subdomains, enhancing detail within low-resolution (LR) domains by utilizing information and prior knowledge from high-resolution (HR) subdomains through a maximum posterior problem. Assessment of efficacy, utilizing both 2D and 3D velocity models—consisting of synthetic checkerboard models and a fault-zone model from Ridgecrest, California—demonstrates noteworthy improvements in accuracy, compared to state-of-the-art fusion techniques. Specifically, we find reductions of 30% and 44% in computed travel-time residuals for 2D and 3D models, respectively, as compared to conventional smoothing techniques. Unlike conventional methods, the PGM’s adaptive weight selection facilitates preserving and learning details from complex, nonuniform HR models and applies the enhancements to the LR background domain.

Geochemistry & Geophysics↗
DOE OSTI2020

Uncovering interpretable relationships in high-dimensional scientific data through function preserving projections

Abstract In many fields of science and engineering, we frequently encounter experiments or simulations datasets that describe the behavior of complex systems and uncovering human interpretable patterns between their inputs and outputs via exploratory data analysis is essential for building intuition and facilitating discovery. Often, we resort to 2D embeddings for examining these high-dimensional relationships (e.g. dimensionality reduction). However, most existing embedding methods treat the dimensions as coordinates for samples in a high-dimensional space, which fail to capture the potential functional relationships, and the few methods that do take function into consideration either only focus on linear patterns or produce non-linear embeddings that are hard to interpret. To address these challenges, we proposed function preserving projections (FPP), which construct 2D linear embeddings optimized to reveal interpretable yet potentially non-linear patterns between the domain and the range of a high-dimensional function. The intuition here is that humans are good at understanding potentially non-linear patterns in 2D but unable to interpret non-linear mapping from high-dimensional space to 2D. Therefore, we should restrict the projection to linear but not the pattern we are seeking. Using FPP on real-world datasets, one can obtain fundamentally new insights about high-dimensional relationships in extremely large datasets that could not be processed with existing dimension reduction methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine learning in materials research: Developments over the last decade and challenges for the future

The number of studies that apply machine learning (ML) to materials science has been growing at a rate of approximately 1.67 times per year over the past decade. In this review, I examine this growth in various contexts. First, I present an analysis of the most commonly used tools (software, databases, materials science methods, and ML methods) used within papers that apply ML to materials science. The analysis demonstrates that despite the growth of deep learning techniques, the use of classical machine learning is still dominant as a whole. It also demonstrates how new research can effectively build upon past research, particular in the domain of ML models trained on density functional theory calculation data. Next, I present the progression of best scores as a function of time on the matbench materials science benchmark for formation enthalpy prediction. In particular, a dramatic improvement of 7 times reduction in error is obtained when progressing from feature-based methods that use conventional ML (random forest, support vector regression, etc.) to the use of graph neural network techniques. Finally, I provide views on future challenges and opportunities, focusing on data size and complexity, extrapolation, interpretation, access, and relevance.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Pore-scale simulation of drying in porous media using a hybrid lattice Boltzmann: pore network model

In this work, a hybrid method coupling a pseudo-potential lattice Boltzmann model (LBM) and a pore network model (PNM) to simulate drying in porous media is proposed. Based on the watershed method, the porous medium is firstly decomposed into pore regions. According to the liquid–vapor phase distribution at a given time, the pore regions are further divided into four pore types, namely two-phase pores where a liquid–vapor interface exists, buffer pores next to the two-phase pores, single-liquid and single-vapor phase pores. The pseudo-potential LBM is used in the two-phase and buffer pores to simulate liquid drying and track the movement of the interfaces, while the single-phase PNM simulations are conducted in the buffer and single-phase pores to simulate vapor or liquid flow. LBM and PNM are coupled in the buffer pores through exchange of boundary information. The hybrid method is applied to simulate liquid drying in a porous medium. The whole-domain LBM simulation is considered as the reference solution to validate the hybrid method. Liquid saturation variation during the drying process and detailed phase and pressure distributions obtained by the two methods match quite well, demonstrating the accuracy of the hybrid method. For the specific case studied, the hybrid method saves more than 60% computational time compared to the whole-domain LBM simulation. In addition, the speedup of the hybrid method becomes more significant for a larger computational domain. In summary, the hybrid method developed in this work combines the accuracy of LBM and the efficiency of PNM to simulate drying in porous media at pore scale and can lead to significant reduction of computation time, thus allowing the pore-scale consideration of drying in larger porous systems.

36 MATERIALS SCIENCE↗
DOE OSTI2020

SnowPac : a multiscale cubic B-spline wavelet compressor for astronomical images

ABSTRACT As more advanced and complex survey telescopes are developed, the size and scale of data being captured grows at increasing rates. Across various domains, data compression through wavelets has enabled the reduction of data size and increase in computation efficiency. In this paper, we provide qualitative and quantitative tests of a new wavelet-based image compression method compared against the current standard for astronomical images. The analysis is improved by making use of state-of-the-art object detection systems to accurately measure the impact of the compression. We find that a combination of lossy wavelet-based methods, efficient quantization, and lossless dictionary compressors can preserve up to 98 per cent of astronomical objects at a 10:1 compression ratio. This significant reduction in file size also preserves astronomical object properties better than existing methods. These methods help further reduce future workloads for image-heavy processing pipelines.

Pulido, Jesus↗
DOE OSTI2021

Performance Results for Sensor Assignment Problem as Solved on a Multi-Node Cluster

An earlier report described a procedure for optimal sensor set selection and its implementation on a computational cluster. This new and innovative capability was developed to facilitate a reduction in operations staffing levels to improve plant economics. By automating surveillance and maintenance tasks through early detection of degrading sensors and equipment, staff can be more efficiently deployed. The method uses automated reasoning and domain knowledge in the form of the conservation equations to infer from plant measurements the state of equipment health. Inclusion of domain knowledge addresses the problem that exists with pure data-driven methods that there are no rigorous guidelines for determining what constitutes an adequate sensor set. Formalizing the procedure for sensor set selection as we have done results in a more reliable and explainable diagnosis of plant equipment health. Importantly, from the standpoint of the plant owner, personnel are provided with an early and explicit diagnosis of an equipment problem. That in principle automates the process and eliminates having to send personnel into the plant to find the cause as typically occurs when a data-driven method detects an anomaly. In this report we describe first results obtained using a computational cluster to solve the sensor set selection problem as framed above. The case described addresses the problem of equipment health monitoring in the high-pressure (HP) feedwater system of a pressurized light water reactor as seen through the eyes of our collaborating utility partner. Maintenance of this system can amount to millions of dollars per year if equipment health issues go undiagnosed and lead to loss of function. On examining the potential that is inherent in the installed sensor set for diagnosing equipment health degradation, it was found that greater fault resolution capability can be achieved using a sensor set that is 20 percent fewer in number. The take-away is that compared to the installed sensor set there exists a more strategic assignment of sensors that will furnish better health monitoring capability and with fewer sensors. Where the problem defies solution by manual inspection, as is the case here, one can be found by an algorithm. The solution was obtained in four hours using 30 computational cores. The HP feedwater problem as posed above illustrates the added value of approaching the sensor selection problem as one amenable to algorithmic solution. This problem is of interest to advanced reactor designers and to utilities that are setting up remote monitoring and diagnostic centers.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Decision Science for Machine Learning (DeSciML)

The increasing use of machine learning (ML) models to support high-consequence decision making drives a need to increase the rigor of ML-based decision making. Critical problems ranging from climate change to nonproliferation monitoring rely on machine learning for aspects of their analyses. Likewise, future technologies, such as incorporation of data-driven methods into the stockpile surveillance and predictive failure analysis for weapons components, will all rely on decision-making that incorporates the output of machine learning models. In this project, our main focus was the development of decision scientific methods that combine uncertainty estimates for machine learning predictions, with a domain-specific model of error costs. Other focus areas include uncertainty measurement in ML predictions, designing decision rules using multiobjecive optimization, the value of uncertainty reduction, and decision-tailored uncertainty quantification for probability estimates. By laying foundations for rigorous decision making based on the predictions of machine learning models, these approaches are directly relevant to every national security mission that applies, or will apply, machine learning to data, most of which entail some decision context.

97 MATHEMATICS AND COMPUTING↗