Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical approximation & analysis”

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 OSTI2021

A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis

In this work, a butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the O(N log 2 N) construction cost of the HOD-BF-compressed system matrix and O(N log 1.5 N) inversion cost for the preconditioner, where N is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a H matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

42 ENGINEERING↗
DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Mathematical solutions in internal dose assessment: A comparison of Python-based differential equation solvers in biokinetic modeling

Abstract In biokinetic modeling systems employed for radiation protection, biological retention and excretion have been modeled as a series of discretized compartments representing the organs and tissues of the human body. Fractional retention and excretion in these organ and tissue systems have been mathematically governed by a series of coupled first-order ordinary differential equations (ODEs). The coupled ODE systems comprising the biokinetic models are usually stiff due to the severe difference between rapid and slow transfers between compartments. In this study, the capabilities of solving a complex coupled system of ODEs for biokinetic modeling were evaluated by comparing different Python programming language solvers and solving methods with the motivation of establishing a framework that enables multi-level analysis. The stability of the solvers was analyzed to select the best performers for solving the biokinetic problems. A Python-based linear algebraic method was also explored to examine how the numerical methods deviated from an analytical or semi-analytical method. Results demonstrated that customized implicit methods resulted in an enhanced stable solution for the inhaled 60 Co (Type M) and 131 I (Type F) exposure scenarios for the inhalation pathway of the International Commission on Radiological Protection (ICRP) Publication 130 Human Respiratory Tract Model (HRTM). The customized implementation of the Python-based implicit solvers resulted in approximately consistent solutions with the Python-based matrix exponential method ( expm ). The differences generally observed between the implicit solvers and expm are attributable to numerical precision and the order of numerical approximation of the numerical solvers. This study provides the first analysis of a list of Python ODE solvers and methods by comparing their usage for solving biokinetic models using the ICRP Publication 130 HRTM and provides a framework for the selection of the most appropriate ODE solvers and methods in Python language to implement for modeling the distribution of internal radioactivity.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

Measuring sub-surface spatially varying thermal conductivity of silicon implanted with krypton

The thermal properties of semiconductors following exposure to ion irradiation are of great interest for the cooling of electronic devices; however, gradients in composition and structure due to irradiation often make the measurement difficult. Furthermore, the nature of spatial variations in thermal resistances due to spatially varying ion irradiation damage is not well understood. In this work, we develop an advancement in the analysis of time-domain thermoreflectance to account for spatially varying thermal conductivity in a material resulting from a spatial distribution of defects. We then use this method to measure the near-surface (≲1 μm) thermal conductivity of silicon wafers irradiated with Kr + ions, which has an approximate Gaussian distribution centered 260 nm into the sample. Our numerical analysis presented here allows for the spatial gradient of thermal conductivity to be extracted via what is fundamentally a volumetric measurement technique. We validate our findings via transmission electron microscopy, which is able to confirm the spatial variation of the sub-surface silicon structure, and provide additional insight into the local structure resulting from the effects of ion bombardment. Thermal measurements found the ion stopping region to have a nearly 50x reduction in thermal conductivity as compared to pristine silicon, while TEM showed the region was not fully amorphized. Our results suggest this drastic reduction in silicon thermal conductivity is primarily driven by structural defects in crystalline regions along with boundary scattering between amorphous and crystalline regions, with a negligible contribution being due to implanted krypton ions themselves.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Learning continuous models for continuous physics

Abstract Dynamical systems that evolve continuously over time are ubiquitous throughout science and engineering. Machine learning (ML) provides data-driven approaches to model and predict the dynamics of such systems. A core issue with this approach is that ML models are typically trained on discrete data, using ML methodologies that are not aware of underlying continuity properties. This results in models that often do not capture any underlying continuous dynamics—either of the system of interest, or indeed of any related system. To address this challenge, we develop a convergence test based on numerical analysis theory. Our test verifies whether a model has learned a function that accurately approximates an underlying continuous dynamics. Models that fail this test fail to capture relevant dynamics, rendering them of limited utility for many scientific prediction tasks; while models that pass this test enable both better interpolation and better extrapolation in multiple ways. Our results illustrate how principled numerical analysis methods can be coupled with existing ML training/testing methodologies to validate models for science and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Resonant Raman in armchair graphene nanoribbons from first-principles

Resonant Raman spectra of armchair graphene nanoribbons (AGNRs) are computed using Density Functional Theory (DFT) and third-order perturbation theory. Results are benchmarked against available experimental data and compared to previously used theoretical approaches based on the Placzek approximation. Comparable agreement with experiments is found for both previously and presently used methods. In addition, a numerical analysis is carried out to provide a justification for the resonant modeling method based on the use of the frequency-dependent dielectric tensor in the Placzek approximation. Finally, this work also provides additional predictions and references for wide AGNRs that might be investigated with Raman scattering experiments in the future.

42 ENGINEERING↗
DOE OSTI2025

Interacting Dirac magnons in the van der Waals ferromagnet CrBr 3

We study the effects of magnon-magnon interactions in the two-dimensional van der Waals ferromagnet CrBr 3 focusing on its honeycomb lattice structure. Motivated by earlier theoretical predictions of temperature-induced spectral shifts and van Hove singularities in the magnon dispersion [S. S. Pershoguba et al., Phys. Rev. X 8, 011010 (2018)], we go beyond the commonly used thermal magnon approximation by applying second-order perturbation theory in a fully numerical framework. Our analysis uncovers significant deviations from previous analysis: in particular, the predicted singularities are absent, consistent with recent inelastic neutron scattering measurements [S. E. Nikitin et al ., Phys. Rev. Lett. 129, 127201 (2022)]. Moreover, we find that the temperature dependence of the renormalized magnon spectrum exhibits a distinct 𝑇 3 behavior for the optical magnon branch, while retaining 𝑇 2 behavior for the acoustic or down magnon band. This feature sheds light on the collective dynamics of Dirac magnons and their interactions. We further compare the honeycomb case with a triangular Bravais lattice, relevant for ferromagnetic monolayer MnBi 2 ⁢Te 4 , and show that both systems lack singular features while displaying quite distinct thermal trends.

Holstein-Primakoff method↗
DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗
DOE OSTI2024

Implementation and (Inverse Modified) Error Analysis for Implicitly Templated ODE-Nets

We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.

ODE-nets↗
DOE OSTI2021

Conservative numerical schemes with optimal dispersive wave relations: Part I. Derivation and analysis

An energy-conserving and an energy-and-enstrophy conserving numerical schemes are derived by approximating the Hamiltonian formulation of the inviscid shallow water flows based on the vorticity-divergence variables. These schemes also conserve the first-order moments such as mass and vorticity, as usual. The conservative properties of the schemes stem from the skew-symmetry and singularities of the Poisson brackets, which are carefully retained in the discrete approximations. Here, the schemes operate on unstructured orthogonal dual meshes, over bounded or unbounded domains, and they are also shown to possess the same optimal dispersive wave relations as those of the Z-grid scheme, which is a consequence of the use of the vorticity and divergence variables.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

A charged particle transport approximation for thick and thin plasmas

In this work, we will construct a simple method to be utilized in the interpretation of the properties of a thin plasma from a study of the transport of charged particles through it. We do so by first demonstrating how charged particle fluxes encode local plasma information in their spectra for sufficiently thick plasmas and then propose how to extend that analysis to the thin plasma limit where the extensive geometry cannot be neglected through arguments from scale separation. We provide a numerical treatment of the transport problem and demonstrate that it is in good agreement with the approximation we present. Finally, we utilize both the numerical solution and our novel approximation to study the impact of the extensive scale of the plasma on the yield and flux normalized high-energy neutron spectra resulting from the upscattering of charged fuel ions. Using this analysis, we show that (after controlling for fusion yield) for the same uniform densities and temperatures, larger plasmas have higher magnitude but softer reaction-in-flight (RIF) neutron spectra relative to smaller plasmas. This is because larger plasmas retain more knocked-on suprathermal ions within their bulk and can downscatter them to lower average energies, while smaller plasmas allow a larger fraction of high energy particles to “range out” of the system prior to substantial downscattering or inducing an RIF reaction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Computational capacity in hydrodynamic real-time hybrid simulation applied to simulate the dynamic response of floating offshore wind turbines

Real-time hybrid simulation (RTHS) mitigates similitude distortions in model-scale tests of floating offshore wind turbines (FOWTs) by coupling physical experiments with numerical models in real time. The coupling requires faster-than-real-time numerical computations to satisfy temporal similitude with the physical experiment, presenting a bottleneck for using more complex numerical models in RTHS. This paper presents a hydrodynamic-RTHS (hydro-RTHS) framework for FOWTs that simulates the hydrodynamics physically and the aerodynamics numerically with sensor feedback from the physical testing. The framework adapts the three-loop hardware architecture to leverage greater computational resources and mitigate strict temporal requirements, enabling more computationally demanding numerical analyses in hydro-RTHS. The three-loop hardware architecture integrates multiple machines, each dedicated to either numerical analysis or RTHS controls, with a rate-transition algorithm to synchronize the tasks executed across the different machine processors. Virtual and physical tests verified and validated the hydro-RTHS framework, respectively. The ”virtual” tests, which approximates the physical domain numerically, verified the RTHS framework with respect to a numerical full-scale complete FOWT model simulated in the open-source software, OpenFAST. The virtual tests were able to maintain comparable control signals while enabling greater computational resources for the numerical calculations. Real-world physical tests demonstrated that the hydro-RTHS framework computes aerodynamic forces similar to the complete OpenFAST model, validating the hydro-RTHS framework using the three-loop hardware architecture. Findings show that the hydro-RTHS framework with the three-loop hardware architecture is computationally efficient, with reserve capacity to simulate more complex problems due to the customized software, hardware, and rate-transition algorithm.

17 WIND ENERGY↗
DOE OSTI2023

Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model

The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression is also a core bottleneck in quantum algorithms, such as traversing an energy landscape in optimization, and adiabatic state preparation more generally. In this work, we demonstrate exponential acceleration of MQT through Floquet engineering with the application of a uniform, high frequency transverse drive field. Using the ferromagnetic phase of the transverse field Ising model in one and two dimensions as a prototypical example, we identify three phenomenological regimes as a function of drive strength. For weak drives, the system exhibits exponentially decaying tunneling rates but robust magnetic order; in the crossover regime at intermediate drive strength, we find polynomial decay of tunnelling alongside vanishing magnetic order; and at very strong drive strengths both the Rabi frequency and time-averaged magnetic order are approximately constant with increasing system size. We support these claims with extensive full wavefunction and tensor network numerical simulations, and theoretical analysis. An experimental test of these results presents a technologically important and novel scientific question accessible on NISQ-era quantum computers.

Grattan, George↗
DOE OSTI2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗
DOE OSTI2022

Droplet formation simulation using mixed finite elements

Droplet formation happens in finite time due to the surface tension force. The linear stability analysis is useful to estimate the size of a droplet but fails to approximate the shape of the droplet. This is due to a highly nonlinear flow description near the point where the first pinch-off happens. A one-dimensional axisymmetric mathematical model was first developed by Eggers and Dupont [“Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] using asymptotic analysis. This asymptotic approach to the Navier–Stokes equations leads to a universal scaling explaining the self-similar nature of the solution. Numerical models for the one-dimensional model were developed using the finite difference [Eggers and Dupont, “Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] and finite element method [Ambravaneswaran et al., “Drop formation from a capillary tube: Comparison of one-dimensional and two-dimensional analyses and occurrence of satellite drops,” Phys. Fluids 14, 2606–2621 (2002)]. The focus of this study is to provide a robust computational model for one-dimensional axisymmetric droplet formation using the Portable, Extensible Toolkit for Scientific Computation. The code is verified using the Method of Manufactured Solutions and validated using previous experimental studies done by Zhang and Basaran [“An experimental study of dynamics of drop formation,” Phys. Fluids 7, 1184–1203 (1995)]. The present model is used for simulating pendant drops of water, glycerol, and paraffin wax, with an aspiration of extending the application to simulate more complex pinch-off phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

An asymptotic-preserving 2D-2P relativistic Drift-Kinetic-Equation solver for runaway electron simulations in axisymmetric tokamaks

We propose an asymptotic-preserving (AP), uniformly convergent numerical scheme for the relativistic collisional Drift-Kinetic Equation (rDKE) to simulate runaway electrons in axisymmetric toroidal magnetic field geometries typical of tokamak devices. The approach is derived from an exact Green's function solution with numerical approximations of quantifiable impact, and results in a simple, two-step operator-split algorithm, consisting of a collisional Eulerian step, and a Lagrangian orbit-integration step with analytically prescribed kernels. The AP character of the approach is demonstrated by analysis of the dominant numerical errors, as well as by numerical experiments. We demonstrate the ability of the algorithm to provide accurate answers regardless of plasma collisionality on a circular axisymmetric tokamak geometry.

97 MATHEMATICS AND COMPUTING↗