Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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,423 records · Page 79

Planning The Route Of A Robotic Land Vehicle

Algorithm enables experimental robotic land vehicle to follow automatically route computed on basis of terrain-height-map data. Computer executing algorithm merges coarser global topographical data with finer local topographical data obtained through stereoscopic video system as vehicle moves along, then smoothes merged elevation map, interpolates map to evenly-horizontally-spaced grid points, and differentiates map to produce data on slopes and roughness for use in calculations of traversability and optimum route(s). Distance traveled minimized to extent possible consistent with avoidance of obstacles.

Gennery, Donald B.↗

Efficient Sequential Attitude Estimation from Vector Observations

This paper presents a computationally efficient, sequential method for attitude matrix estimation using gyro and vector measurements. The method is based on a recently introduced, minimal-parameter third-order method for solving the orthogonal matrix differential equation in R(sup n). In the three-dimensional case, these third-order attitude parameters can be interpreted as temporal-integrals of the body-frame angular velocity components. A nonlinear algorithm is developed, which uses this minimal set of three parameters to estimate the nine-parameter direction-cosine matrix. Having an extremely simple kinematic equation, these parameters render the resulting estimator highly computationally efficient. An orthogonalization procedure, incorporated into the measurement processing stage, enhances the accuracy and stability of the resulting algorithm, yet retains reasonable simplicity. The performance of the estimator is demonstrated via a Monte Carlo simulation study.

Oshman, Yaakov↗

Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are demonstrated in a physically realistic Brownian coagulation case. The computational accuracy is validated with benchmark solution of discrete-sectional method. The simulation results show that the comprehensive approach can attain very favorable improvement in cost without sacrificing computational accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An effective numerical algorithm for intra-granular fission gas release during non-equilibrium trapping and resolution

Both fission gas release and gaseous swelling in nuclear fuel are driven by the transport of fission gas from within the fuel grains to grain boundaries (intra-granular fission gas release). The process involves gas atom diffusion in conjunction with trapping in and resolution from intra-granular bubbles, and is described mathematically by a system of two partial differential equations (PDE). Following Speight, under the assumption of equilibrium between trapping and resolution (quasi-stationary approximation) the system can be reduced to a single diffusion equation with an effective diffusion coefficient. Numerical solutions used in engineering fuel performance calculations invariably rely on this simplification. First, we investigate the validity of the quasi-stationary approximation compared to the solution of the general system of PDEs. Results demonstrate that the approximation is valid under most conditions of practical interest, but is inadequate to model intra-granular fission gas release during rapid transients to relatively high temperatures such as postulated reactivity initiated accidents (RIA). Then, we develop a novel numerical algorithm for the solution of the general problem in time-varying conditions. We verify the PolyPole-2 algorithm against a reference finite difference solution for a large number of randomly generated operation histories including prototypical RIA transients. Results demonstrate that PolyPole-2 captures the solution of the general PDE system with a high accuracy and a low computational cost. As a result, the PolyPole-2 algorithm overcomes the quasi-stationary approximation and the concept of an effective diffusion coefficient for the solution of the intra-granular fission gas release problem in nuclear fuel analysis.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Algebraic Stabilization of Explicit Numerical Integration for Extremely Stiff Reaction Networks

In contrast to the prevailing view in the literature, it is shown that even extremely stiff sets of ordinary differential equations may be solved efficiently by explicit methods if limiting algebraic solutions are used to stabilize the numerical integration. The stabilizing algebra differs essentially for systems well removed from equilibrium and those near equilibrium. Explicit asymptotic and quasi-steady-state methods that are appropriate when the system is only weakly equilibrated are examined first. These methods are then extended to the case of close approach to equilibrium through a new implementation of partial equilibrium approximations. Using stringent tests with astrophysical thermonuclear networks, evidence is provided that these methods can deal with the stiffest networks, even in the approach to equilibrium, with accuracy and integration timestepping comparable to that of implicit methods. Because explicit methods can execute a timestep faster and scale more favorably with network size than implicit algorithms, our results suggest that algebraically stabilized explicit methods might enable integration of larger reaction networks coupled to fluid dynamics than has been feasible previously for a variety of disciplines.

differential equations↗

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗

Stochastic finite difference lattice Boltzmann method for steady incompressible viscous flows

With the advent of state-of-the-art computers and their rapid availability, the time is ripe for the development of efficient uncertainty quantification (UQ) methods to reduce the complexity of numerical models used to simulate complicated systems with incomplete knowledge and data. The spectral stochastic finite element method (SSFEM) which is one of the widely used UQ methods, regards uncertainty as generating a new dimension and the solution as dependent on this dimension. A convergent expansion along the new dimension is then sought in terms of the polynomial chaos system, and the coefficients in this representation are determined through a Galerkin approach. This approach provides an accurate representation even when only a small number of terms are used in the spectral expansion; consequently, saving in computational resource can be realized compared to the Monte Carlo (MC) scheme. Recent development of a finite difference lattice Boltzmann method (FDLBM) that provides a convenient algorithm for setting the boundary condition allows the flow of Newtonian and non-Newtonian fluids, with and without external body forces to be simulated with ease. Also, the inherent compressibility effect in the conventional lattice Boltzmann method, which might produce significant errors in some incompressible flow simulations, is eliminated. As such, the FDLBM together with an efficient UQ method can be used to treat incompressible flows with built in uncertainty, such as blood flow in stenosed arteries. The objective of this paper is to develop a stochastic numerical solver for steady incompressible viscous flows by combining the FDLBM with a SSFEM. Validation against MC solutions of channel/Couette, driven cavity, and sudden expansion flows are carried out.

97 MATHEMATICS AND COMPUTING↗

Machine learning methods for probabilistic locked-mode predictors in tokamak plasmas

A rotating tokamak plasma can interact resonantly with the external helical magnetic perturbations, also known as error fields. This can lead to locking and then to disruptions. We leverage machine learning (ML) methods to predict the locking events. We use a coupled third-order nonlinear ordinary differential equation model to represent the interaction of the magnetic perturbation and the plasma rotation with the error field. This model is sufficient to describe qualitatively the locking and unlocking bifurcations. Here, we explore using ML algorithms with the simulation data and experimental data, focusing on the methods that can be used with sparse datasets. These methods lead to the possibility of the avoidance of locking in real-time operations. We describe the operational space in terms of two control parameters: the magnitude of the error field and the rotation frequency associated with the momentum source that maintains the plasma rotation. The outcomes are quan- tified by order parameters that completely characterize the state, whether locked or unlocked. We use unsupervised ML methods to classify locked/unlocked states and note the usefulness of a certain normalization of the order parameters. Three supervised ML classifiers are used in suite to estimate the probability of locking in the region of control parameter space with hysteresis, i.e., the set of control parameters for which both locked and unlocked states can exist. The results show that a neural network gives the best estimate of the locking probability. An analogy of the present locking model with the van der Waals equation of state is also provided.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Evaluation of antifouling surfaces using a method that employs mussel larvae settlement quantified by machine learning

Antifouling coating development requires extensive performance testing. Coatings that prevent aquatic larval settlement are of interest because many forms of macrofouling begin at the larval stage. However, field testing can be time consuming and poorly controlled. Herein is reported a screening tool, Settlement of Larvae Assay using Mussels (SLAM), for down-selecting materials prior to field testing. The method entails using a dense concentration of mussel larvae that are allowed to settle on submerged test surfaces. Settled larvae are then quantified to provide a measure of antifouling performance. The SLAM test differentiated coatings with only slight differences in formulation. To enable efficient quantification of dense larvae settlement, an automated counting method was developed that combines two analyses: a color thresholding identifies larvae clumps, and a machine learning algorithm identifies non-clumped larvae. Finally, this automated ‘hybrid’ approach rapidly quantifies settled larvae as effectively as manual counting but in a fraction of the time.

Mytilus↗

Algebraic Multigrid Preconditioners for Multiphase Flow in Porous Media

Multiphase flow is a critical process in a wide range of applications, including carbon sequestration, contaminant remediation, and groundwater management. Typically, this process is modeled by a nonlinear system of partial differential equations derived by considering the mass conservation of each phase (e.g., oil, water), along with constitutive laws for the relationship of phase velocity to phase pressure. In this study, we develop and study efficient solution algorithms for solving the algebraic systems of equations derived from a fully coupled and time-implicit treatment of models of multiphase flow. We explore the performance of several preconditioners based on algebraic multigrid (AMG) for solving the linearized problem, including “black-box” AMG applied directly to the system, a new version of constrained pressure residual multigrid (CPR-AMG) preconditioning, and a new preconditioner derived using an approximate Schur complement arising from the block factorization of the Jacobian. Finally, we show that the new methods are the most robust with respect to problem character, as determined by varying effects of capillary pressures, and we show that the block factorization preconditioner both is efficient and scales optimally with problem size.

97 MATHEMATICS AND COMPUTING↗

NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training

This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.

Lu, Binghang (ORCID:0009000160016632)↗

An analytic solution for the orbital perturbations of the Venus Radar Mapper due to gravitational harmonics

Hill's variational equations are solved analytically for the orbital perturbations of a spacecraft nominally in an elliptic orbit around a non-spherical body. The rotation of the central planet about its spin-axis is not considered in the analysis. The perturbations are restricted to the planetary gravitational harmonics only. An extremely simple algorithm is derived to transform the spherical harmonic potentials to the orbital coordinate system, and the resulting accelerations are shown to be simply trigonometric functions of the true anomaly. With the principal matrix solution for the differential equations of the adjoint system given in closed form, the orthogonality of the trigonometric functions makes it possible to obtain an analytic solution for the non-homogeneous problem, at intervals of 2 pi in true anomaly. The solution for orbital perturbations can be extended over several revolutions by applying well-known results from Floquet's theory. The technique is demonstrated with results presented on the spacecraft periapsis altitude for the forthcoming Venus Radar Mapper Mission.

Vijayaraghavan, A.↗

Global convergence of inexact Newton methods for transonic flow

In computational fluid dynamics, nonlinear differential equations are essential to represent important effects such as shock waves in transonic flow. Discretized versions of these nonlinear equations are solved using iterative methods. In this paper an inexact Newton method using the GMRES algorithm of Saad and Schultz is examined in the context of the full potential equation of aerodynamics. In this setting, reliable and efficient convergence of Newton methods is difficult to achieve. A poor initial solution guess often leads to divergence or very slow convergence. This paper examines several possible solutions to these problems, including a standard local damping strategy for Newton's method and two continuation methods, one of which utilizes interpolation from a coarse grid solution to obtain the initial guess on a finer grid. It is shown that the continuation methods can be used to augment the local damping strategy to achieve convergence for difficult transonic flow problems. These include simple wings with shock waves as well as problems involving engine power effects. These latter cases are modeled using the assumption that each exhaust plume is isentropic but has a different total pressure and/or temperature than the freestream.

Young, David P.↗

Prediction of thrombus-related mechanical prosthetic valve dysfunction using transesophageal echocardiography

Identification of thrombus-related mechanical prosthetic valve dysfunction (MPVD) has important therapeutic implications. We sought to develop an algorithm, combining clinical and echocardiographic parameters, for prediction of thrombus-related MPVD in a series of 53 patients (24 men, age 52 +/- 16 years) who had intraoperative diagnosis of thrombus or pannus from 1992 to 1997. Clinical and echocardiographic parameters were analyzed to identify predictors of thrombus and pannus. Prevalence of thrombus and diagnostic yields relative to the number of predictors were determined. There were 22 patients with thrombus, 19 patients with pannus, and 12 patients with both. Forty-two of 53 masses were visualized using transesophageal echocardiography (TEE), including 29 of 34 thrombi or both thrombi and panni and 13 of 19 isolated panni. Predictors of thrombus or mixed presentation include mobile mass (p = 0.009), attachment to occluder (p = 0.02), elevated gradients (p = 0.04), and an international normalized ratio of < or = 2.5 (p = 0.03). All 34 patients with thrombus or mixed presentation had > or = 1 predictor. The prevalence of thrombus in the presence of < or = 1, 2, and > or = 3 predictors is 14%, 69%, and 91%, respectively. Thus, TEE is sensitive in the identification of abnormal mass in the setting of MPVD. An algorithm based on clinical and transesophageal echocardiographic predictors may be useful to estimate the likelihood of thrombus in the setting of MPVD. In the presence of > or = 3 predictors, the probability of thrombus is high.

NASA Discipline Cardiopulmonary↗

Optimal design of chemoepitaxial guideposts for the directed self-assembly of block copolymer systems using an inexact Newton algorithm

Directed self-assembly (DSA) of block copolymers (BCPs) is one of the most promising developments in the cost-effective production of nanoscale devices. The process makes use of the natural tendency for BCP melts to form nanoscale structures upon phase separation. The phase separation can be directed through the use of chemically patterned substrates to promote the formation of morphologies that are essential to the production of semiconductor devices. Moreover, the design of substrate pattern can be formulated as an optimization problem for which we seek optimal substrate designs that effectively produce given target morphologies. In this paper, we adopt a phase field model given by a nonlocal Cahn–Hilliard partial differential equation (PDE) based on the minimization of the Ohta–Kawasaki free energy, and present an efficient PDE-constrained optimization framework for the optimal design problem. The design variables are the locations of circular- or strip-shaped guiding posts that are used to model the substrate chemical pattern. To solve the ensuing optimization problem, we propose a variant of an inexact Newton conjugate gradient algorithm tailored to this problem. Additionally, we demonstrate the effectiveness of our computational strategy on numerical examples that span a range of target morphologies. Owing to our second-order optimizer and fast state solver, the numerical results demonstrate five orders of magnitude reduction in computational cost over previous work. The efficiency of our framework and the fast convergence of our optimization algorithm enable us to rapidly solve the optimal design problem in not only two, but also three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

Class II algorithm for charged-particle transport simulation - Paper 142

Simulation of the transport of high-energy charged particles is difficult because of the large number of interactions experienced by these particles before being brought to rest. Possible strategies to deal with this difficulty were analyzed by Berger. Most modern Monte Carlo codes use a mixture of complete-grouping (class I) and mixed (class II) schemes. In class I simulations, the global effect of all the interactions that occur along a trajectory segment of a given length s is described by means of precalculated distributions derived from multiple-scattering theories. In class II simulations, hard (or catastrophic) interactions (with energy loss W or polar scattering angle {theta} larger than given cutoff values) are sampled individually, while the effect of soft interactions (with energy losses and scattering angles smaller than the respective cutoffs) is described using a multiple-scattering approach. Although Berger effectively employed class II simulation only for energy-loss events, he did recognize the advantages of class II over class I also for multiple elastic scattering. On the one hand, because hard interactions are described exactly according to the adopted differential cross sections (DCSs), class II schemes are more accurate. On the other hand, multiple-scattering approximations, which are still required to describe the cumulative effect of soft interactions, are simpler and more accurate when individual interactions are limited to small energy transfers and angular deflections. For instance, for path lengths that are not too small, but still much less than the CSDA range, the energy-loss distribution due to multiple soft events is approximately Gaussian, by virtue of the central limit theorem. Similarly, the angular distribution caused by multiple small-angle deflections is also approximately Gaussian. However, class II schemes are more difficult to implement because of their dependence on specificities of the DCSs. In this article we briefly present the essentials of the class II algorithm for charged particles implemented in the last version of the penelope code, and provide evidence of its accuracy and stability with the simulation parameters. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Homogenizing atomic dynamics by fractional differential equations

In this paper, we propose two ways to construct fractional differential equations (FDE) for approximating atomic chain dynamics. Taking harmonic chain as an example, we add a power function of fractional order to Taylor expansion of the dispersion relation, and determine the parameters by matching two selected wave numbers. This approximate function leads to an FDE after considering both directions for wave propagation. As an alternative, we consider the symbol of the force term, and approximate it by a similar function. It also induces an FDE. Both approaches produce excellent agreement with the harmonic chain dynamics. The accuracy may be improved by optimizing the selected wave numbers, or starting with higher order Taylor expansions. When resolved in the lattice constant, the resulting FDE's faithfully reproduce the lattice dynamics. When resolved in a coarse grid instead, they systematically generate homogenized algorithms. Numerical tests are performed to verify the proposed approaches. Moreover, FDE's are also constructed for diatomic chain and anharmonic lattice, to illustrate the generality of the proposed approaches. - Highlights: • Match the dispersion relation of linear chain by power function of fractional order, added on low order Taylor expansion. • Design FDE by approximating dispersion relation, or the symbol for the force term. • Solve the FDE by algorithm of spectral accuracy. • Obtain faithful and systematical homogenization when resolved at coarser grid. • Applies to general lattices: complex, nonlinear and multidimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗