Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ADVECTION”

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,657 records · Page 92

Fluid dynamics analysis of a gas attenuator for X-ray FELs under high-repetition-rate operation

Newtonian fluid dynamics simulations were performed using the Navier–Stokes–Fourier formulations to elucidate the short time-scale (µs and longer) evolution of the density and temperature distributions in an argon-gas-filled attenuator for an X-ray free-electron laser under high-repetition-rate operation. Both hydrodynamic motions of the gas molecules and thermal conductions were included in a finite-volume calculation. It was found that the hydrodynamic wave motions play the primary role in creating a density depression (also known as a filament) by advectively transporting gas particles away from the X-ray laser–gas interaction region, where large pressure and temperature gradients have been built upon the initial energy deposition via X-ray photoelectric absorption and subsequent thermalization. Concurrent outward heat conduction tends to reduce the pressure in the filament core region, generating a counter gas flow to backfill the filament, but on an initially slower time scale. If the inter-pulse separation is sufficiently short so the filament cannot recover, the depth of the filament progressively increases as the trailing pulses remove additional gas particles. Since the rate of hydrodynamic removal decreases while the rate of heat conduction back flow increases as time elapses, the two competing mechanisms ultimately reach a dynamic balance, establishing a repeating pattern for each pulse cycle. Finally, by performing simulations at higher repetition rates but lower per pulse energies while maintaining a constant time-averaged power, the amplitude of the hydrodynamic motion per pulse becomes smaller, and the evolution of the temperature and density distributions approach asymptotically towards, as expected, those calculated for a continuous-wave input of the equivalent power.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wassersplines for Neural Vector Field-Controlled Animation

Much of computer-generated animation is created by manipulating meshes with rigs. While this approach works well for animating articulated objects like animals, it has limited flexibility for animating less structured free-form objects. Here we introduce Wassersplines, a novel trajectory inference method for animating unstructured densities based on recent advances in continuous normalizing flows and optimal transport. The key idea is to train a neurally-parameterized velocity field that represents the motion between keyframes. Trajectories are then computed by advecting keyframes through the velocity field. We solve an additional Wasserstein barycenter interpolation problem to guarantee strict adherence to keyframes. Our tool can stylize trajectories through a variety of PDE-based regularizers to create different visual effects. We demonstrate our tool on various keyframe interpolation problems to produce temporally-coherent animations without meshing or rigging.

97 MATHEMATICS AND COMPUTING↗

Local Equilibrium and Retardation Revisited

We present that in modeling solute transport with mobile-immobile mass transfer (MIMT), it is common to use an advection-dispersion equation (ADE) with a retardation factor, or retarded ADE. This is commonly referred to as making the local equilibrium assumption (LEA). Assuming local equilibrium, Eulerian textbook treatments derive the retarded ADE, ostensibly exactly. However, other authors have presented rigorous mathematical derivations of the dispersive effect of MIMT, applicable even in the case of arbitrarily fast mass transfer. We resolve the apparent contradiction between these seemingly exact derivations by adopting a Lagrangian point of view. We show that local equilibrium constrains the expected time immobile, whereas the retarded ADE actually embeds a stronger, nonphysical, constraint: that all particles spend the same amount of every time increment immobile. Eulerian derivations of the retarded ADE thus silently commit the gambler's fallacy, leading them to ignore dispersion due to mass transfer that is correctly modeled by other approaches. We then present a particle tracking simulation illustrating how poor an approximation the retarded ADE may be, even when mobile and immobile plumes are continually near local equilibrium. Finally, we note that classic “LEA” (actually, retarded ADE validity) criteria test for insignificance of MIMT-driven dispersion relative to hydrodynamic dispersion, rather than for local equilibrium.

58 GEOSCIENCES↗

A Microsoft Excel Program for Two-Well Tracer Test Data Analysis

Two-well tracer tests are often conducted to investigate subsurface solute transport in the field. Analyzing breakthrough curves in the extraction and monitoring wells using numerical methods is nontrivial due to highly nonuniform flow conditions. We extended, and implemented analytical solutions for the convection-dispersion equation for an injection-extraction well-duplet in a homogeneous confined aquifer under steady state conditions. Functions were provided to calculate the concentrations in the extraction and monitoring wells at any location due to a step or pulse injection. Type curves for a step injection were compared with those calculated by numerically integrating the solution for a pulse injection. The results from the two approaches are similar when the dispersivity is small. As the dispersivity increases, the latter was found to be more accurate but requires more computing time. The code was verified by comparing the results with published type curves and applied to analyze data from the literature. It can be used as a first approximation for two-well tracer test data analysis, and to check accuracy of numerical solutions. The code and example files are publically-available.

54 ENVIRONMENTAL SCIENCES↗

A Reduced-Boundary-Function Method for Convective Heat Transfer with Axial Heat Conduction and Viscous Dissipation

We introduce a method of solution for the convective heat transfer under forced laminar flow that is confined by two parallel plates with a distance of 2a or by a circular tube with a radius of a. The advection-conduction equation is first mapped onto the boundary. The original problem of solving the unknown field is reduced to seek the solutions of T at the boundary (r=a or r=0, r is the distance from the centerline shown in Fig. 1), i.e. the boundary functions and/or . In this manner, the original problem is significantly simplified by reducing the problem dimensionality from 3 to 2. The unknown field can be eventually solved in terms of these boundary functions. The method is applied to the convective heat transfer with uniform wall temperature boundary condition and with heat exchange between flowing fluids and its surroundings that is relevant to the geothermal applications. Analytical solutions are presented and validated for the steady state problem using the proposed method.

Heat Transport, Convective, Conduction, Multi-scal↗

Subsampling-based compression and flow visualization

As computational capabilities increasingly outpace disk speeds on leading supercomputers, scientists will, in turn, be increasingly unable to save their simulation data at its native resolution. One solution to this problem is to compress these data sets as they are generated and visualize the compressed results afterwards. We explore this approach, specifically subsampling velocity data and the resulting errors for particle advection-based flow visualization. We compare three techniques: random selection of subsamples, selection at regular locations corresponding to multi-resolution reduction, and introduce a novel technique for informed selection of subsamples. Furthermore, we explore an adaptive system which exchanges the subsampling budget over parallel tasks, to ensure that subsampling occurs at the highest rate in the areas that need it most. We perform supercomputing runs to measure the effectiveness of the selection and adaptation techniques. Overall, we find that adaptation is very effective, and, among selection techniques, our informed selection provides the most accurate results, followed by the multi-resolution selection, and with the worst accuracy coming from random subsamples.

Agranovsky, Alexy↗

MO-FG-BRA-01: Development of An Image-Guided Dosimetric Planning System for Injectable Brachytherapy Using ELP Nanoparticles

Purpose: To develop, validate, and evaluate a methodology for determining dosimetry for intratumoral injections of elastin-like-polypeptide (ELP) brachytherapy nanoparticles. These organic-polymer-based nanoparticles are injectable, biodegradable, and genetically tunable. We present a genetically encoded polymer-solution, composed of novel radiolabeled-ELP nanoparticles that are custom-designed to self-assemble into a local source upon intratumoral injection. Our preliminary results of a small animal study demonstrate 100% tumor response, effective radionuclide retention-rates, strong in vivo stability, and no polymer-induced toxicities. While our approach is therefore highly promising for improved brachytherapy, the current workflow lacks a dosimetry framework. Methods: We are developing a robust software framework that provides image-guided dosimetric-planning capabilities for ELP brachytherapy. The user graphically places ELP injection sites within a µCT-planning-image, and independently defines each injection volume, concentration, and radioisotope to be used. The resulting internal dosimetry is then pre-determined by first modeling post-injection ELP advection-diffusion, and then calculating the resulting dose distribution based on a point- dose-kernel-convolution algorithm. We have experimentally measured ELP steady-state concentrations via µSPECT acquisition, and validated our dose calculation algorithm against Monte Carlo simulations of several radioactivity distributions. Finally, we have investigated potential advantages and limitations of various ELP injection parameters. Results: The µSPECT results demonstrated inhomogeneous steady-state distributions of ELP in tissue, and Monte Carlo radioactivity distributions were designed accordingly. Our algorithm yielded a root-mean-square-error of less than 2% for each distribution tested (average root-mean-square-error was 0.73%). Dose-Volume-Histogram analysis of five different plans showed how strategic injection placement, and an injection volume-tapering technique, could be used to achieve D95% target coverage. Conclusion: We have preliminarily developed a novel planning framework for ELP brachytherapy. Its dosimetry accuracy has been validated against Monte Carlo, and we have started to investigate the potential advantages of injection-based planning. This system, once fully developed, will serve as the technical foundation for our novel approach.

60 APPLIED LIFE SCIENCES↗

The dynamic atmospheric and aeolian environment of Jezero crater, Mars

Despite the importance of sand and dust to Mars geomorphology, weather, and exploration, the processes that move sand and that raise dust to maintain Mars’ ubiquitous dust haze and to produce dust storms have not been well quantified in situ, with missions lacking either the necessary sensors or a sufficiently active aeolian environment. Perseverance rover’s novel environmental sensors and Jezero crater’s dusty environment remedy this. In Perseverance’s first 216 sols, four convective vortices raised dust locally, while, on average, four passed the rover daily, over 25% of which were significantly dusty (“dust devils”). More rarely, dust lifting by nonvortex wind gusts was produced by daytime convection cells advected over the crater by strong regional daytime upslope winds, which also control aeolian surface features. One such event covered 10 times more area than the largest dust devil, suggesting that dust devils and wind gusts could raise equal amounts of dust under nonstorm conditions.

79 ASTRONOMY AND ASTROPHYSICS↗

Humic Acid-Oxidizing, Nitrate-Reducing Bacteria in Agricultural Soils

This study demonstrates the prevalence, phylogenetic diversity, and physiology of nitrate-reducing microorganisms capable of utilizing reduced humic acids (HA) as electron donors in agricultural soils. Most probable number (MPN) enumeration of agricultural soils revealed large populations (10 4 to 10 6 cells g -1 soil) of microorganisms capable of reducing nitrate while oxidizing the reduced HA analog 2,6-anthrahydroquinone disulfonate (AH 2 DS) to its corresponding quinone. Nitrate-dependent HA-oxidizing organisms isolated from agricultural soils were phylogenetically diverse and included members of the Alphaproteobacteria, Betaproteobacteria, and Gammaproteobacteria. Advective up-flow columns inoculated with corn plot soil and amended with reduced HA and nitrate supported both HA oxidation and enhanced nitrate reduction relative to no-donor or oxidized HA controls. The additional electron donating capacity of reduced HA could reasonably be attributed to the oxidation of reduced functional groups. Subsequent 16S rRNA gene-based high-density oligonucleotide microarray (PhyloChip) indicated that reduced HA columns supported the development of a bacterial community enriched with members of the Acidobacteria, Firmicutes, and Betaproteobacteria relative to the no-donor control and initial inoculum. This study identifies a previously unrecognized role for HA in stimulating denitrification processes in saturated soil systems. Furthermore, this study indicates that reduced humic acids impact soil geochemistry and the indigenous bacterial community composition.

59 BASIC BIOLOGICAL SCIENCES↗

Field-theoretic technique for irreversible reaction processes

The single-species annihilation reaction A + A → O/ is studied in the presence of random advecting field. In order to determine possible infrared behaviour of the system all stable fixed points are presented to two-loop approximation in double (∈, Δ) expansion with the corresponding regions of stability. The main result of this paper is the calculation of all the renormalization constants and the decay exponent to the second-order precision as well as calculation of scaling function the mean particle number to the first order. Effects of random sources and sinks on reaction kinetics in the master-equation description have been investigated in the framework of a field-theoretic model, obtained by the “second quantization” a la Doi of the corresponding master equation. It has been demonstrated that random sources and sinks have a significant effect on the asymptotic behaviour of the model and two universality classes for their description have been identified by the scaling analysis. Results: are compared with the Langevin-equation description of the same process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CDF Solutions of Buckley-Leverett Equation with Uncertain Parameters

The Buckley-Leverett (nonlinear advection) equation is often used to describe two-phase flow in porous media. We develop a new probabilistic method to quantify parametric uncertainty in the Buckley-Leverett model. Our approach is based on the concept of fine-grained cumulative density function (CDF) and provides a full statistical description of the system states. Hence, it enables one to obtain not only average system response but also the probability of rare events, which is critical for risk assessment. We obtain a closed-form, semi-analytical solution and test it against the results from Monte Carlo simulations.

Wang, Peng↗

Two-Level Convergence Theory for Multigrid Reduction in Time (MGRIT)

Here we develop a two-grid convergence theory for the parallel-in-time scheme known as multigrid reduction in time (MGRIT), as it is implemented in the open-source package [XBraid: Parallel Multigrid in Time, http://llnl.gov/casc/xbraid]. MGRIT is a scalable and multilevel approach to parallel-in-time simulations that nonintrusively uses existing time-stepping schemes, and in a specific two-level setting it is equivalent to the widely known parareal algorithm. The goal of this paper is twofold. First, we present a two-level MGRIT convergence analysis for linear problems where the spatial discretization matrix can be diagonalized, and then apply this analysis to our two basic model problems, the heat equation and the advection equation. One important assumption is that the coarse and fine time-grid propagators can be diagaonalized by the same set of eigenvectors, which is often the case when the same spatial discretization operator is used on the coarse and fine time grids. In many cases, the MGRIT algorithm is guaranteed to converge, and we demonstrate numerically that the theoretically predicted convergence rates are sharp in practice for our model problems. Second, we explore how the convergence of MGRIT compares to the stability of the chosen time-stepping scheme. In particular, we demonstrate that a stable time-stepping scheme does not necessarily imply convergence of MGRIT, although MGRIT with FCF-relaxation always converges for the diffusion dominated problems considered here.

97 MATHEMATICS AND COMPUTING↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Optimal Experimental Design for Inverse Problems in the Presence of Observation Correlations

Optimal experimental design (OED) is the general formalism of sensor placement and decisions on the data collection strategy for engineered or natural experiments. This problem is prevalent in many critical fields such as battery design, numerical weather prediction, geosciences, environmental and urban studies. State-of-the-art computational methods for experimental design do not accommodate correlation structure in observational errors produced by many expensive-to-operate devices such as X-ray machines, radars, and satellites. Discarding evident data correlations leads to biased results, higher expenses, and waste of valuable resources. We present a general formulation of the OED formalism for model-constrained large-scale Bayesian linear inverse problems, where measurement errors are generally correlated. The proposed approach utilizes the Hadamard product of matrices to formulate the weighted-likelihood, and is valid for both finite as well as infinite-dimensional Bayesian inverse problems. Extensive numerical experiments are carried out for empirical verification of the proposed approach using an advection-diffusion model, where the objective is to optimally place a small set of sensors, under a limited budget, to predict the concentration of a contaminant in a closed and bounded domain.

Correlated observations↗

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗