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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 991 records · Page 55

All sources NASA NTRS DOE OSTI

NASA NTRS1982

Algorithmic aspects of transient heat transfer problems in structures

It is noted that the application of finite element or finite difference techniques to the solution of transient heat transfer problems in structures often results in a stiff system of ordinary differential equations. Such systems are usually handled most efficiently by implicit integration techniques which require the solution of large and sparse systems of algebraic equations. The assembly and solution of these systems using the incomplete Cholesky conjugate gradient algorithm is examined. Several examples are used to demonstrate the advantage of the algorithm over other techniques.

Haftka, R. T.↗

DOE OSTI2025

jaxhps: An elliptic PDE solver built with machine learning in mind

Elliptic partial differential equations (PDEs) can model many physical phenomena, such as electrostatics, acoustics, wave propagation, and diffusion. In scientific machine learning settings, a high-throughput PDE solver may be required to generate a training dataset, run in the inner loop of an iterative algorithm, or interface directly with a deep neural network. To provide value to machine learning users, such a PDE solver must be compatible with standard automatic differentiation frameworks, scale efficiently when run on graphics processing units (GPUs), and maintain high accuracy for a large range of input parameters. We have designed the jaxhps package with these use-cases in mind by implementing a highly efficient and accurate solver for elliptic problems with native hardware acceleration and automatic differentiation support.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

Final Technical Report "Multiscale Simulation Algorithms for Biochemical Systems"

Biochemical systems are inherently multiscale and stochastic. In microscopic systems formed by living cells, the small numbers of reactant molecules can result in dynamical behavior that is discrete and stochastic rather than continuous and deterministic. An analysis tool that respects these dynamical characteristics is the stochastic simulation algorithm (SSA, Gillespie, 1976), a numerical simulation procedure that is essentially exact for chemical systems that are spatially homogeneous or well stirred. Despite recent improvements, as a procedure that simulates every reaction event, the SSA is necessarily inefficient for most realistic problems. There are two main reasons for this, both arising from the multiscale nature of the underlying problem: (1) stiffness, i.e. the presence of multiple timescales, the fastest of which are stable; and (2) the need to include in the simulation both species that are present in relatively small quantities and should be modeled by a discrete stochastic process, and species that are present in larger quantities and are more efficiently modeled by a deterministic differential equation (or at some scale in between). This project has focused on the development of fast and adaptive algorithms, and the fun- damental theory upon which they must be based, for the multiscale simulation of biochemical systems. Areas addressed by this project include: (1) Theoretical and practical foundations for ac- celerated discrete stochastic simulation (tau-leaping); (2) Dealing with stiffness (fast reactions) in an efficient and well-justified manner in discrete stochastic simulation; (3) Development of adaptive multiscale algorithms for spatially homogeneous discrete stochastic simulation; (4) Development of high-performance SSA algorithms.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1972

Numerical method for the solution of large systems of differential equations of the boundary layer type

A numerical method for the solution of large systems of nonlinear differential equations of the boundary-layer type is described. The method is a modification of the technique for satisfying asymptotic boundary conditions. The present method employs inverse interpolation instead of the Newton method to adjust the initial conditions of the related initial-value problem. This eliminates the so-called perturbation equations. The elimination of the perturbation equations not only reduces the user's preliminary work in the application of the method, but also reduces the number of time-consuming initial-value problems to be numerically solved at each iteration. For further ease of application, the solution of the overdetermined system for the unknown initial conditions is obtained automatically by applying Golub's linear least-squares algorithm. The relative ease of application of the proposed numerical method increases directly as the order of the differential-equation system increases. Hence, the method is especially attractive for the solution of large-order systems. After the method is described, it is applied to a fifth-order problem from boundary-layer theory.

Green, M. J.↗

NASA NTRS1990

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗

DOE OSTI2014

Characterization of Used Nuclear Fuel with Multivariate Analysis for Process Monitoring

The Multi-Isotope Process (MIP) Monitor combines gamma spectroscopy and multivariate analysis to detect anomalies in various process streams in a nuclear fuel reprocessing system. Measured spectra are compared to models of nominal behavior at each measurement location to detect unexpected changes in system behavior. In order to improve the accuracy and specificity of process monitoring, fuel characterization may be used to more accurately train subsequent models in a full analysis scheme. This paper presents initial development of a reactor-type classifier that is used to select a reactor-specific partial least squares model to predict fuel burnup. Nuclide activities for prototypic used fuel samples were generated in ORIGEN-ARP and used to investigate techniques to characterize used nuclear fuel in terms of reactor type (pressurized or boiling water reactor) and burnup. A variety of reactor type classification algorithms, including k-nearest neighbors, linear and quadratic discriminant analyses, and support vector machines, were evaluated to differentiate used fuel from pressurized and boiling water reactors. Then, reactor type-specific partial least squares models were developed to predict the burnup of the fuel. Using these reactor type-specific models instead of a model trained for all light water reactors improved the accuracy of burnup predictions. The developed classification and prediction models were combined and applied to a large dataset that included eight fuel assembly designs, two of which were not used in training the models, and spanned the range of the initial 235U enrichment, cooling time, and burnup values expected of future commercial used fuel for reprocessing. Error rates were consistent across the range of considered enrichment, cooling time, and burnup values. Average absolute relative errors in burnup predictions for validation data both within and outside the training space were 0.0574% and 0.0597%, respectively. The errors seen in this work are artificially low, because the models were trained, optimized, and tested on simulated, noise-free data. However, these results indicate that the developed models may generalize well to new data and that the proposed approach constitutes a viable first step in developing a fuel characterization algorithm based on gamma spectra.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2015

Mineral classification map using MF and SAM techniques: A case study in the Nohwa Island, Korea

The purpose of this study is to map pyprophyllite distribution at surface of the Nohwa deposit, Korea by using Advanced Spaceborne Thermal Emission and Reflectance Radiometer (ASTER) data. For this, combined Spectral Angle Mapper (SAM), and Matched Filtering (MF) technique based on mathematical algorithm was applied. The regional distribution of high-grade and low-grade pyrophyllite in the Nohwa deposit area could be differentiated by this method. The results of this study show that ASTER data analysis using combination of SAM and MF techniques will assist in exploration of pyrophyllite at the exposed surface.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2013

A probabilistic graphical model approach to stochastic multiscale partial differential equations

We develop a probabilistic graphical model based methodology to efficiently perform uncertainty quantification in the presence of both stochastic input and multiple scales. Both the stochastic input and model responses are treated as random variables in this framework. Their relationships are modeled by graphical models which give explicit factorization of a high-dimensional joint probability distribution. The hyperparameters in the probabilistic model are learned using sequential Monte Carlo (SMC) method, which is superior to standard Markov chain Monte Carlo (MCMC) methods for multi-modal distributions. Finally, we make predictions from the probabilistic graphical model using the belief propagation algorithm. Numerical examples are presented to show the accuracy and efficiency of the predictive capability of the developed graphical model.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Implementation of Material and Geometry Criticality Search in RMC Code

RMC is a continuous-energy Reactor Monte Carlo neutron and photon transport code being developed by Department of Engineering Physics at Tsinghua University, Beijing. For the use of simulation of reactor control or design of reactor with unknown material and geometry parameters, an accurate and efficient method of eigenvalue search is implemented in RMC code. The eigenvalue search focuses on two types of parameters. One is nuclide atom density, called material search, which includes the fuel density, enrichment or boron concentration. Perturbation theory of Monte Carlo Code, like differential operator method and adjoint-weighted perturbation method has been widely researched in sensitivity and uncertainty study. For material search, the perturbation algorithm needs to coupled with flexible material control block and optimized strategy. The other type of parameter is surface position, called geometry search, which includes fuel rod diameter, pitch and control rod position. MC21 iterated on surface position based on bisection method or regula-falsi method, and directly recalculated k-eff until it converged to target error interval. In this paper, the differential operator method, improved Newton-Raphson method is introduced. Based on these methods, the global material search is implemented. Then based on material search and finite method, global geometry search is implement. Finally, fuel enrichment, boron concentration and control rod position in normal PWR assembly are searched. The results show that RMC can search material and geometry parameters accurately and efficiently. In this paper, global eigenvalue search of material and geometry parameters have been implemented in RMC code. They are based on the differential operator method in Monte Carlo perturbation theory. The differential operator method samples δk/δρ{sub r}, δ{sup 2}k/δρ{sub r}{sup 2} along with k-eff estimator. Therefore it won't take up too much additional computational resource. For homogeneous material search, fission source effect has little effect of accuracy and can be ignored. The results of fuel enrichment and boron concentration searches in assembly show that improved Newton-Raphson method can iterate efficiently until k-eff is in the error interval. Based on material search and finite difference formula, the geometry parameter, like control rod axial position, can iterate until k-eff is in the error interval. However, the tiny perturbed region may not contain enough tracks to simulate. Besides, the large number density's relative change up to -1 may cause underestimation of Δk-eff, and then slope of k-x curve. This will cause non-convergence for Newton- Raphson method. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS1989

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

NASA NTRS1995

Grid Sensitivity and Aerodynamic Optimization of Generic Airfoils

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B- Splines) for defining the airfoil geometry. An interactive algebraic grid generation technique is employed to generate C-type grids around airfoils. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the airfoil surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the airfoil.

Sadrehaghighi, Ideen↗

DOE OSTI2017

Measurement of the inclusive jet cross-sections in proton-proton collisions at $\sqrt{s}=8$ TeV with the ATLAS detector

Inclusive jet production cross-sections are measured in proton-proton collisions at a centre-of-mass energy of √s=8 TeV recorded by the ATLAS experiment at the Large Hadron Collider at CERN. The total integrated luminosity of the analysed data set amounts to 20.2 fb -1 . Double-differential cross-sections are measured for jets defined by the anti-k t jet clustering algorithm with radius parameters of R = 0.4 and R = 0.6 and are presented as a function of the jet transverse momentum, in the range between 70 GeV and 2.5 TeV and in six bins of the absolute jet rapidity, between 0 and 3.0. The measured cross-sections are compared to predictions of quantum chromodynamics, calculated at next-to-leading order in perturbation theory, and corrected for non-perturbative and electroweak effects. The level of agreement with predictions, using a selection of different parton distribution functions for the proton, is quantified. Tensions between the data and the theory predictions are observed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

NASA NTRS1992

Comparison Of Two Viscous-Flow Computer Codes

Two viscous-flow computer codes compared by applying them to five test cases of steady-state transonic viscous flows about transonic airfoils. Two codes were: FLOMG, which solves Navier-Stokes differential equations of flow by implementing explicit, Runge-Kutta, finite-volume, multigrid numerical-integration algorithm; and ARC2D, which implements implicit, finite-difference, approximate-factorization, eigenvector-diagonalization numerical-integration algorithm.

Maksymiuk, C. M.↗

NASA NTRS1991

Distributed parameter estimation for NASA Mini-Mast truss through displacement measurements

Most methods of system identification of large flexible structures by far are based on the lumped parameter approach. Because of the considerable computational burden due to the large number of unknown parameters, distributed parameter approach, which greatly decreases the number of unknowns, has being investigated. In this paper a distributed parameter model for the estimation of modal characteristics of NASA Mini-Mast truss has been formulated. Both Bernoulli-Euler beam and Timoshenko beam equations are used to characterize the lateral bending vibrations of the truss. The measurement of the lateral displacement at the tip of the truss is provided to the maximum likelihood estimator. Closed-form solutions of the partial differential equations and closed-form expressions of the sensitivity functions are derived so that the estimation algorithm is highly efficient. The resulting estimates from test data by using Timoshenko beam model are found to be comparable to those derived from finite element analysis.

Huang, Jen-Kuang↗

NASA NTRS1993

On the spectral stability of time integration algorithms for a class of constrained dynamics problems

Incomplete field formulations have recently been the subject of intense research because of their potential in coupled analysis of independently modeled substructures, adaptive refinement, domain decomposition, and parallel processing. This paper discusses the design and analysis of time-integration algorithms for these formulations and emphasizes the treatment of their inter-subdomain constraint equations. These constraints are shown to introduce a destabilizing effect in the dynamic system that can be analyzed by investigating the behavior of the time-integration algorithm at infinite and zero frequencies. Three different approaches for constructing penalty-free unconditionally stable second-order accurate solution procedures for this class of hybrid formulations are presented, discussed and illustrated with numerical examples. The theoretical results presented in this paper also apply to a large family of nonlinear multibody dynamics formulations. Some of the algorithms outlined herein are important alternatives to the popular technique consisting of transforming differential/algebraic equations into ordinary differential equations via the introduction of a stabilization term that depends on arbitrary constants and that influences the computed so1ution.

Farhat, Charbel↗

NASA NTRS1995

Extensional flow convecting a reactant undergoing a first order homogeneous reaction and diffusional mass transfer from a sphere at low to intermediate Peclet and Damkohler numbers

Forced convective diffusion-reaction is considered for viscous axisymmetric extensional convecting velocity in the neighborhood of a sphere. For Peclet numbers in the range 0.1 less than or equal to Pe less than or equal to 500 and for Damkohler numbers increasing with increasing Pe but in the overall range 0.02 less than or equal to Da less than or equal to 10, average and local Sherwood numbers have been computed. By introducing the eigenfunction expansion c(r, Theta) = Sum of c(n)(r)P(n)(cos Theta) into the forced convective diffusion equation for the concentration of a chemical species undergoing a first order homogeneous reaction and by using properties of the Legendre functions Pn(cos Theta), the variable coefficient PDE can be reduced to a system of N + 1 second order ODEs for the radial functions c(sub n)(r), n = 0, 1, 2,..., N. The adaptive grid algorithm of Pereyra and Lentini can be used to solve the corresponding 2(N + 1) first order differential equations as a two-point boundary value problem on 1 less than or equal to r less than or equal to r(sub infinity). Convergence of the expansion for a specific value of N can thus be established and provides 'spectral' behavior as well as the full concentration field c(r, Theta).

Shah, N. Y.↗

NASA NTRS1998

Flow Applications of the Least Squares Finite Element Method

The main thrust of the effort has been towards the development, analysis and implementation of the least-squares finite element method (LSFEM) for fluid dynamics and electromagnetics applications. In the past year, there were four major accomplishments: 1) special treatments in computational fluid dynamics and computational electromagnetics, such as upwinding, numerical dissipation, staggered grid, non-equal order elements, operator splitting and preconditioning, edge elements, and vector potential are unnecessary; 2) the analysis of the LSFEM for most partial differential equations can be based on the bounded inverse theorem; 3) the finite difference and finite volume algorithms solve only two Maxwell equations and ignore the divergence equations; and 4) the first numerical simulation of three-dimensional Marangoni-Benard convection was performed using the LSFEM.

Jiang, Bo-Nan↗