Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Time step adaptivity”

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 163 records · Page 9

Neural Network for Principle of Least Action

The principle of least action is the cornerstone of classical mechanics, theory of relativity, quantum mechanics, and thermodynamics. Here, we describe how a neural network (NN) learns to find the trajectory for a Lennard-Jones (LJ) system that maintains balance in minimizing the Onsager–Machlup (OM) action and maintaining the energy conservation. The phase-space trajectory thus calculated is in excellent agreement with the corresponding results from the “ground-truth” molecular dynamics (MD) simulation. Furthermore, we show that the NN can easily find structural transformation pathways for LJ clusters, for example, the basin-hopping transformation of an LJ 38 from an incomplete Mackay icosahedron to a truncated face-centered cubic octahedron. Unlike MD, the NN computes atomic trajectories over the entire temporal domain in one fell swoop, and the NN time step is a factor of 20 larger than the MD time step. The NN approach to OM action is quite general and can be adapted to model morphometrics in a variety of applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-F-T-432: Magnetic Field Dose Effects for Various Radiation Beam Geometries for Patients Treated with Hypofractionated Partial Breast Irradiation

Purpose: Hypofractionated partial breast irradiation (HPBI) is being used at our clinic to treat inoperable breast cancer patients who have advanced disease. We are investigating how these patients could benefit from being treated in an MRI-linac, where real-time daily MRI tumor imaging and plan adaptation would be possible. As a first step, this study evaluates the dosimetric impact of the magnetic field for different radiation beam geometries on relevant OARs. Methods: Five patients previously treated using HPBI were selected. Six treatment plans were generated for each patient, evaluating three beam geometries (VMAT, IMRT, 3DCRT) with and without B{sub 0}=1.5 T. The Monaco TPS was used with the Elekta MRI-Linac beam model, where the magnetic field is orthogonal to the radiation beam. All plans were re-scaled to the same isocoverage with a prescription of 40Gy/5 to the PTV. Plans were evaluated for the effect of the magnetic field and beam modality on skin V{sub 3} {sub 0}, lung V{sub 2} {sub 0} and mean heart dose. Results: Averaged over all patients, skin V{sub 3} {sub 0}for 3DCRT was higher than VMAT and IMRT (by +22% and +21%, with B{sub 0}-ON). The magnetic field caused larger increases in skin V{sub 3} {sub 0}for 3DCRT (+8%) than VMAT (+3%) and IMRT (+4%) compared with B{sub 0}-OFF. With B{sub 0}-ON, 3DCRT had a markedly lower mean heart dose than VMAT (by 538cGy) and IMRT (by 562cGy); for lung V{sub 2} {sub 0}, 3DCRT had a marginally lower dose than VMAT (by −2.2%) and IMRT (also −2.2%). The magnetic field had minimal effect on the mean heart dose and lung V{sub 2} {sub 0} for all geometries. Conclusion: The decreased skin dose in VMAT and IMRT can potentially mitigate the effects of skin reactions for HPBI in an MRI-linac. This study illustrated that more beam angles may result in lower skin toxicity and better tumor conformality, with the trade-off of elevated heart and lung doses. We are receiving funding support from Elekta.

60 APPLIED LIFE SCIENCES↗

Numerical solution of the Euler equation for compressible inviscid fluids

An effort is made to develop a satisfactory numerical method for the calculation of steady solutions of the Euler equations for inviscid compressible gas flows. The intended application is the prediction of the aerodynamic properties of aircraft flying at transonic speeds. Particular consideration is given to the modification of the equations to improve convergence to a steady state; finite volume formulation; adaptive dissipation; schemes designed to improve the resolution of shock waves; hybrid multistage time stepping schemes; residual averaging; a multigrid scheme; and trials with Burgers' equation. Results clearly demonstrate that the convergence of a time-dependent hyperbolic system to a steady state can be substantially accelerated by the introduction of multiple grids.

Jameson, A.↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Adaptive scapula bone remodeling computational simulation: Relevance to regenerative medicine

Shoulder arthroplasty success has been attributed to many factors including, bone quality, soft tissue balancing, surgeon experience, and implant design. Improved long-term success is primarily limited by glenoid implant loosening. Prosthesis design examines materials and shape and determines whether the design should withstand a lifetime of use. Finite element (FE) analyses have been extensively used to study stresses and strains produced in implants and bone. However, these static analyses only measure a moment in time and not the adaptive response to the altered environment produced by the therapeutic intervention. Computational analyses that integrate remodeling rules predict how bone will respond over time. Recent work has shown that subject-specific two- and three dimensional adaptive bone remodeling models are feasible and valid. Feasibility and validation were achieved computationally, simulating bone remodeling using an intact human scapula, initially resetting the scapular bone material properties to be uniform, numerically simulating sequential loading, and comparing the bone remodeling simulation results to the actual scapula’s material properties. Three-dimensional scapula FE bone model was created using volumetric computed tomography images. Muscle and joint load and boundary conditions were applied based on values reported in the literature. Internal bone remodeling was based on element strain-energy density. Initially, all bone elements were assigned a homogeneous density. All loads were applied for 10 iterations. After every iteration, each bone element’s remodeling stimulus was compared to its corresponding reference stimulus and its material properties modified. The simulation achieved convergence. At the end of the simulation the predicted and actual specimen bone apparent density were plotted and compared. Location of high and low predicted bone density was comparable to the actual specimen. High predicted bone density was greater than actual specimen. Low predicted bone density was lower than actual specimen. Differences were probably due to applied muscle and joint reaction loads, boundary conditions, and values of constants used. Work is underway to study this. Nonetheless, the results demonstrate three dimensional bone remodeling simulation validity and potential. Such adaptive predictions take physiological bone remodeling simulations one step closer to reality. Computational analyses are needed that integrate biological remodeling rules and predict how bone will respond over time. We expect the combination of computational static stress analyses together with adaptive bone remodeling simulations to become effective tools for regenerative medicine research.

60 APPLIED LIFE SCIENCES↗

TH-A-19A-09: Towards Sub-Second Proton Dose Calculation On GPU

Purpose: To achieve sub-second dose calculation for clinically relevant proton therapy treatment plans. Rapid dose calculation is a key component of adaptive radiotherapy, necessary to take advantage of the better dose conformity offered by hadron therapy. Methods: To speed up proton dose calculation, the pencil beam algorithm (PBA; clinical standard) was parallelised and implemented to run on a graphics processing unit (GPU). The implementation constitutes the first PBA to run all steps on GPU, and each part of the algorithm was carefully adapted for efficiency. Monte Carlo (MC) simulations obtained using Fluka of individual beams of energies representative of the clinical range impinging on simple geometries were used to tune the PBA. For benchmarking, a typical skull base case with a spot scanning plan consisting of a total of 8872 spots divided between two beam directions of 49 energy layers each was provided by CNAO (Pavia, Italy). The calculations were carried out on an Nvidia Geforce GTX680 desktop GPU with 1536 cores running at 1006 MHz. Results: The PBA reproduced within ±3% of maximum dose results obtained from MC simulations for a range of pencil beams impinging on a water tank. Additional analysis of more complex slab geometries is currently under way to fine-tune the algorithm. Full calculation of the clinical test case took 0.9 seconds in total, with the majority of the time spent in the kernel superposition step. Conclusion: The PBA lends itself well to implementation on many-core systems such as GPUs. Using the presented implementation and current hardware, sub-second dose calculation for a clinical proton therapy plan was achieved, opening the door for adaptive treatment. The successful parallelisation of all steps of the calculation indicates that further speedups can be expected with new hardware, brightening the prospects for real-time dose calculation. This work was funded by ENTERVISION, European Commission FP7 grant 264552.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗

Porting Adaptive Ensemble Molecular Dynamics Workflows to the Summit Supercomputer

Molecular dynamics (MD) simulations must take very small (femtosecond) integration steps in simulation-time to avoid numerical errors. Efficient use of parallel programming models and accelerators in state-of-the art MD programs now is pushing Moore’s limit for time-per-MD step. As a result, directly simulating timescales beyond milliseconds will not be attainable directly, even at exascale. However, concepts from statistical physics can be used to combine many parallel simulations to provide information about longer timescales and to adequately sample the simulation space, while preserving details about the dynamics of the system. Implementing such an approach requires a workflow program that allows adaptable steering of task assignments based on extensive statistical analysis of intermediate results. Here we report the implementation of such an adaptable workflow program to drive simulations on the Summit IBM Power System AC922, a pre-exascale supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). We compare to experiences on Titan, Summit’s predecessor, report the performance of the workflow and its components, and describe the porting process. We find that using a workflow program managed by a Mongo database can provide the fault tolerance, scalable performance, task dispatch rate, and reconfigurability required for robust and portable implementation of ensemble simulations such as are used in enhanced-sampling molecular dynamics. This type of workflow generator can also be used to provide adaptive steering of ensemble simulations for other applications in addition to MD.

Ossyra, John R.↗

Adaptive statistical pattern classifiers for remotely sensed data

A technique for the adaptive estimation of nonstationary statistics necessary for Bayesian classification is developed. The basic approach to the adaptive estimation procedure consists of two steps: (1) an optimal stochastic approximation of the parameters of interest and (2) a projection of the parameters in time or position. A divergence criterion is developed to monitor algorithm performance. Comparative results of adaptive and nonadaptive classifier tests are presented for simulated four dimensional spectral scan data.

Gonzalez, R. C.↗

An adaptive finite element method for high speed flows

The solution of the equations of compressible high speed flow, on unstructured triangular grids in 2D and tetrahedral grids in 3D, is considered. Solution methods based upon both Taylor-Galerkin and Runge-Kutta time-stepping techniques are presented and the incorporation of the ideas of flux corrected transport (FCT) is discussed. These methods are combined with an adaptive mesh regeneration procedure and are employed in the solution of several examples, consisting of Euler flows in both 2D and 3D and Navier-Stokes flows in 2D.

Peraire, J.↗

Modified sparse regularization for electrical impedance tomography

Electrical impedance tomography (EIT) aims to estimate the electrical properties at the interior of an object from current-voltage measurements on its boundary. It has been widely investigated due to its advantages of low cost, non-radiation, non-invasiveness, and high speed. Image reconstruction of EIT is a nonlinear and ill-posed inverse problem. Therefore, regularization techniques like Tikhonov regularization are used to solve the inverse problem. A sparse regularization based on L{sub 1} norm exhibits superiority in preserving boundary information at sharp changes or discontinuous areas in the image. However, the limitation of sparse regularization lies in the time consumption for solving the problem. In order to further improve the calculation speed of sparse regularization, a modified method based on separable approximation algorithm is proposed by using adaptive step-size and preconditioning technique. Both simulation and experimental results show the effectiveness of the proposed method in improving the image quality and real-time performance in the presence of different noise intensities and conductivity contrasts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Time-warping invariant quantum recurrent neural networks via quantum-classical adaptive gating

Adaptive gating plays a key role in temporal data processing via classical recurrent neural networks (RNNs), as it facilitates retention of past information necessary to predict the future, providing a mechanism that preserves invariance to time warping transformations. This paper builds on quantum RNNs (QRNNs), a dynamic model with quantum memory, to introduce a novel class of temporal data processing quantum models that preserve invariance to time-warping transformations of the (classical) input-output sequences. The model, referred to as time warping-invariant QRNN (TWI-QRNN), augments a QRNN with a quantum–classical adaptive gating mechanism that chooses whether to apply a parameterized unitary transformation at each time step as a function of the past samples of the input sequence via a classical recurrent model. The TWI-QRNN model class is derived from first principles, and its capacity to successfully implement time-warping transformations is experimentally demonstrated on examples with classical or quantum dynamics.

97 MATHEMATICS AND COMPUTING↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

Temporal resolution criterion for correctly simulating relativistic electron motion in a high-intensity laser field

Particle-in-cell codes are now standard tools for studying ultra-intense laser-plasma interactions. Motivated by direct laser acceleration of electrons in sub-critical plasmas, we examine temporal resolution requirements that must be satisfied to accurately calculate electron dynamics in strong laser fields. Using the motion of a single electron in a perfect plane electromagnetic wave as a test problem, we show surprising deterioration of the numerical accuracy with increasing wave amplitude a{sub 0} for a given time-step. We go on to show analytically that the time-step must be significantly less than λ/ca{sub 0} to achieve good accuracy. We thus propose adaptive electron sub-cycling as an efficient remedy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive state estimation for control of flexible structures

This paper proposes a new approach of obtaining adaptive state estimation of a system in the presence of unknown system disturbances and measurement noise. In the beginning, a non-optimal Kalman filter with arbitrary initial guess for the process and measurement noises is implemented. At the same time, an adaptive transversal predictor (ATP) based on the recursive least-squares (RLS) algorithm is used to yield optimal one- to p- step-ahead output predictions using the previous input/output data. Referring to these optimal predictions the Kalman filter gain is updated and the performance of the state estimation is thus improved. If forgetting factor is implemented in the recursive least-squares algorithm, this method is also capable of dealing with the situation when the noise statistics are slowly time-varying. This feature makes this new approach especially suitable for the control of flexible structures. A numerical example demonstrates the feasibility of this real time adaptive state estimation method.

Chen, Chung-Wen↗

Fully implicit particle-in-cell algorithms for kinetic simulation of plasmas [Slides]

We have demonstrated, for the first time, a fully implicit, fully nonlinear electrostatic PIC formulation that features: (1) Exact charge conservation (via a novel particle mover strategy). (2) Exact energy conservation (no particle self-heating or self-cooling). (3) Adaptive particle orbit integrator to control errors in momentum conservation. The approach has been shown to be free of CFL and finite-grid numerical instabilities. As a result, the method is able to take time steps many times larger than explicit, and resolutions many times coarser. Central to our implementation is the concept of particle enslavement. We have generalized formulation to use spatial adaptivity via mapped coordinates. he method has much potential for efficiency gains vs. explicit in long-time-scale applications, with the CPU speedup scaling as $(kΛ_D)-^{(d+1)}/N_{FE}$. Minimize the number of nonlinear function evaluations $N_{FE}$ for given $Δt$, $Δx \Rightarrow$ preconditioning! We have formulated and implemented a very efficient moment-based preconditioner. We have ported the algorithm to GPU architectures. We have generalized the algorithm to non-radiative electromagnetic regimes (Darwin model), where, in addition to charge and energy, we also conserve canonical momenta.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DNS of Hydrodynamic Instabilities of Laminar H2/O2/N2 Flames at Elevated Pressure

The atypical combustion properties of hydrogen have long provided an interest for hydrogen-enriched combustion, emphasized in recent years by increasingly stringent emission regulations. Significant work has been focused on the small hydrocarbon(C1-C3)/hydrogen blends, but much less is known about the effect of hydrogen on heavier hydrocarbon combustion, of interest for the aviation and automotive industry. In this work, we perform direct numerical simulations (DNS) of spherically expanding laminar n-dodecane/H2 flames in a constant-volume vessel at elevated pressure and a range of hydrogen seeding levels. A low Mach number model is used to represent the gas and flame dynamics allowing for a temporally varying, spatially homogeneous pressure field, while also enabling numerical evolution of the system numerically at time step sizes governed by the advective CFL limit rather than acoustic processes. We use an adaptive mesh refinement (AMR) approach to tackle the large separation of scales associated with high pressure premixed flame surfaces propagating in a laboratory-scale closed domain. We incorporate detailed chemistry and transport models for the reacting flow and focus the analysis on the effects of the pressure rise on the flame propagation characteristics and morphology as the hydrogen content is increased. The presence of fast diffusive H2 and the pressure rise results in dramatic thinning of the flame and the potential onset of hydrodyanmic and theromdiffusive instabilities. We assess the potential role of these instabilities on the ability to accurately measure laminar burning speed experimentally based on the mean flame surface propagation speed.

high pressure↗

Robust, multidimensional mesh motion based on Monge-Kantorovich equidistribution

Mesh-motion (r-refinement) grid adaptivity schemes are attractive due to their potential to minimize the numerical error for a prescribed number of degrees of freedom. However, a key roadblock to a widespread deployment of this class of techniques has been the formulation of robust, reliable mesh-motion governing principles, which (1) guarantee a solution in multiple dimensions (2D and 3D), (2) avoid grid tangling (or folding of the mesh, whereby edges of a grid cell cross somewhere in the domain), and (3) can be solved effectively and efficiently. In this study, we formulate such a mesh-motion governing principle, based on volume equidistribution via Monge-Kantorovich optimization (MK). In earlier publications [1] and [2], the advantages of this approach with regard to these points have been demonstrated for the time-independent case. In this study, we demonstrate that Monge-Kantorovich equidistribution can in fact be used effectively in a time-stepping context, and delivers an elegant solution to the otherwise pervasive problem of grid tangling in mesh-motion approaches, without resorting to ad hoc time-dependent terms (as in moving-mesh PDEs, or MMPDEs [3] and [4]). We explore two distinct r-refinement implementations of MK: the direct method, where the current mesh relates to an initial, unchanging mesh, and the sequential method, where the current mesh is related to the previous one in time. We demonstrate that the direct approach is superior with regard to mesh distortion and robustness. The properties of the approach are illustrated with a hyperbolic PDE, the advection of a passive scalar, in 2D and 3D. Velocity flow fields with and without flow shear are considered. Three-dimensional grid, time-step, and nonlinear tolerance convergence studies are presented which demonstrate the optimality of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗