Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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,207 records · Page 67

Radiation Hardened Engineered Substrates for Time and Space Resolution

Low Gain Avalanche Diodes (LGADs) have become sensors of choice for fast timing of minimum ionizing particles. The current generation of these devices suffer from only moderate radiation hardness, low fill factor, and limited design options. Cactus Materials Inc. proposes to develop sensors with gain layer implants buried beneath the surface which will, with AC coupling developed by Brookhaven National Laboratory (BNL) and University of California Santa Cruz (UC Santa Cruz) solve these problems. Fermilab has a major role in the CMS timing upgrade using the current generation of LGADs and development of AC-coupled, buried layer LGADs will solve some of the central problems inherent in this technology. Annex B included a two-year work plan, deliverables, schedule and funding for the project’s SBIR Phase II award to develop and test prototype LGADs utilizing wafer bonding technology and epitaxial growth, that will allow for fabrication of radiation hard AC coupled devices with 100% fill factor and adjustable operating point.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DYSCO: A software system for modeling general dynamic systems

The DYSCO program has been under development since 1979. It has been funded by Army and Air Force laboratories and by the Kaman Aerospace Corporation. It is presently available at a number of government and nongovernment installations. It has been used to analyze a very broad range of dynamics problems. A principle feature of the software design of DYSCO is the separation of the executive from the technology. The executive, which controls all the operations, is intelligent in the sense that it knows that its function is to assemble differential equations and to prepare them for solution. The technology library contains FORTRAN routines which perform standard functions, such as, computing the equation coefficients of an element (or component) given the local state at any time. The technology library also contains algorithms and procedures for solving the coupled system equations. The system was designed to allow easy additional of technology to the library. Any linear or nonlinear structural entity, control system, or set of ordinary differential equations may be simply coded and added to the library, as well as algorithms for time or frequency domain solution. The program is described with emphasis on its usefulness in easily modeling unusual concepts and configurations, performing analysis of damage, evaluating new algorithms, and simulating dynamic tests.

Berman, Alex↗

Expert system decision support for low-cost launch vehicle operations

Progress in assessing the feasibility, benefits, and risks associated with AI expert systems applied to low cost expendable launch vehicle systems is described. Part one identified potential application areas in vehicle operations and on-board functions, assessed measures of cost benefit, and identified key technologies to aid in the implementation of decision support systems in this environment. Part two of the program began the development of prototypes to demonstrate real-time vehicle checkout with controller and diagnostic/analysis intelligent systems and to gather true measures of cost savings vs. conventional software, verification and validation requirements, and maintainability improvement. The main objective of the expert advanced development projects was to provide a robust intelligent system for control/analysis that must be performed within a specified real-time window in order to meet the demands of the given application. The efforts to develop the two prototypes are described. Prime emphasis was on a controller expert system to show real-time performance in a cryogenic propellant loading application and safety validation implementation of this system experimentally, using commercial-off-the-shelf software tools and object oriented programming techniques. This smart ground support equipment prototype is based in C with imbedded expert system rules written in the CLIPS protocol. The relational database, ORACLE, provides non-real-time data support. The second demonstration develops the vehicle/ground intelligent automation concept, from phase one, to show cooperation between multiple expert systems. This automated test conductor (ATC) prototype utilizes a knowledge-bus approach for intelligent information processing by use of virtual sensors and blackboards to solve complex problems. It incorporates distributed processing of real-time data and object-oriented techniques for command, configuration control, and auto-code generation.

Szatkowski, G. P.↗

Analysis of predicted mean vote-based model predictive control for residential HVAC systems

Model Predictive Control (MPC) is an advanced process control method that has attracted much attention in building heating, ventilation, and air conditioning (HVAC) systems. Here, this paper analyzes the optimal precooling performance in residential buildings using MPC with two different comfort indices, namely, temperature and predicted mean vote (PMV). It first formulates, for each comfort index, an optimization problem that accounts for different factors, such as weather, home thermal condition, prediction horizon, time-of use (TOU) utility rate, and rated cooling capacity. The problem is then solved, resulting in an MPC strategy that determines the HVAC on/off control signal and minimizes energy cost over a receding time horizon while maintaining thermal comfort. The energy performance difference between temperature-based and PMV-based MPC strategies is subsequently investigated, especially in light of the interior wall surface temperature and under different combinations of the factors. Extensive simulation results demonstrated that the proposed MPC strategies are adaptive and their performances depend primarily on weather, home thermal condition, and prediction horizon, while the impact of TOU utility rate and rated cooling capacity is relatively small. Because the PMV-based MPC strategy can take advantage of the lower interior wall surface temperature due to precooling, it resulted in 8–45% cost savings for the scenarios investigated and an average increase of 0.042–0.113 in the absolute value of the PMV index compared to the temperature-based MPC strategy.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems

We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.

97 MATHEMATICS AND COMPUTING↗

Atmospheric Chemistry Modeling Using a Regression Forest Model

Atmospheric chemistry is central to many environmental issues such as air pollution, climate change, and stratospheric ozone loss. Chemistry Transport Models (CTM) are a central tool for understanding these issues, whether for research or for forecasting. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a CTM. We have investigated a machine learning approach to solving the differential equations instead of solving them numerically. From an annual simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry. This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, centennial scale climate simulations etc. We discuss our approches' speed and accuracy, and highlight some potential future directions for improving this approach.

Keller, Christoph A.↗

Atmospheric Chemistry Modeling Using Machine Learning

Atmospheric chemistry models are a central tool to study the impact of chemical constituents on the environment, vegetation and human health. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a chemistry model. We have investigated a machine learning approach to emulate the chemistry instead of solving the differential equations numerically. From a one-month simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry. This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, etc. We discuss speed and accuracy of our approach, and highlight some potential future directions for improving it.

Keller, Christoph A.↗

Atmospheric Chemistry Modeling and Air Quality Forecasting Using Machine Learning

Atmospheric chemistry models are a central tool to study the impact of chemical constituents on the environment, vegetation and human health. These models split the atmosphere in a large number of grid-boxes and consider the emission of compounds into these boxes and their subsequent transport, deposition, and chemical processing. The chemistry is represented through a series of simultaneous ordinary differential equations, one for each compound. Given the difference in life-times between the chemical compounds (milli-seconds for O1D to years for CH4) these equations are numerically stiff and solving them consists of a significant fraction of the computational burden of a chemistry model.We have investigated a machine learning approach to emulate the chemistry instead of solving the differential equations numerically. From a one-month simulation of the GEOS-Chem model we have produced a training dataset consisting of the concentration of compounds before and after the differential equations are solved, together with some key physical parameters for every grid-box and time-step. From this dataset we have trained a machine learning algorithm (regression forest) to be able to predict the concentration of the compounds after the integration step based on the concentrations and physical state at the beginning of the time step. We have then included this algorithm back into the GEOS-Chem model, bypassing the need to integrate the chemistry.This machine learning approach shows many of the characteristics of the full simulation and has the potential to be substantially faster. There are a wide range of application for such an approach - generating boundary conditions, for use in air quality forecasts, chemical data assimilation systems, etc. We discuss speed and accuracy of our approach, and highlight some potential future directions for improving it.

Keller, Christoph A.↗

Applications of NASTRAN to nuclear problems

The extent to which suitable solutions may be obtained for one physics problem and two engineering type problems is traced. NASTRAN appears to be a practical tool to solve one-group steady-state neutron diffusion equations. Transient diffusion analysis may be performed after new levels that allow time-dependent temperature calculations are developed. NASTRAN piecewise linear anlaysis may be applied to solve those plasticity problems for which a smooth stress-strain curve can be used to describe the nonlinear material behavior. The accuracy decreases when sharp transitions in the stress-strain relations are involved. Improved NASTRAN usefulness will be obtained when nonlinear material capabilities are extended to axisymmetric elements and to include provisions for time-dependent material properties and creep analysis. Rigid formats 3 and 5 proved to be very convenient for the buckling and normal-mode analysis of a nuclear fuel element.

Spreeuw, E.↗

Numerical Behaviour of a Smooth Local Correlation-based Transition Model in a Newton-Krylov Flow Solver

The numerical behaviour of transport-equation-based transition models, including both iterative and grid convergence, is influenced by the source terms. Transition models contain source terms that are large and highly nonlinear, and can be destabilizing in a strong implicit solver. Linearization strategies with varying levels of coupling are evaluated in conjunction with a source-term time step restriction to determine best-practices for solving the SA-sLM2015smooth local correlation-based transition model in an implicit Newton-Krylov flow solver. Achieving deep iterative convergence facilitates a detailed investigation of the grid convergence of these free-transition simulations, which are evaluated relative to fully-turbulent simulations performed using the Spalart-Allmaras turbulence model. Simulations of the NLF0416 general aviation airfoil, VA-2 supercritical airfoil, and NASA CRM-NLF wing-body geometry are performed over a range of grid levels. The results demonstrate that both a fully-coupled linearization strategy and a source-term time step restriction improve nonlinear convergence as the complexity of the free-transition simulations increases. In general, additional grid resolution is required for free-transition simulations relative to fully-turbulent simulations in order to achieve a similar level of accuracy, with the grid convergence of free-transition simulations sensitive to the streamwise grid spacings in the transition regions.

AATT↗

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

We present a goal-oriented framework for constructing digital twins with the following properties: (1) they employ discretizations of high-fidelity partial differential equation (PDE) models governed by autonomous dynamical systems, leading to large-scale forward problems; (2) they solve a linear inverse problem to assimilate observational data to infer uncertain model components followed by a forward prediction of the evolving dynamics; and (3) the entire end-to-end, data-to-inference-to-prediction computation is carried out without approximation and in real time through a Bayesian framework that rigorously accounts for uncertainties. Several challenges must be overcome to realize this framework, including the large scale of the forward problem, the high dimensionality of the parameter space, and for a class of problems including those we target, the slow decay of the singular values of the parameter-to-observable map. Here we introduce a methodology to overcome these challenges by exploiting the autonomous structure of the forward model to decompose the solution of the inverse problem into a one-time-only offline phase in which the PDE model is solved a limited number of times (equal to the number of sensors), and an online phase that maps well onto GPUs and computes the parameter inference and prediction of quantities of interest in real time, given observational data. Our ultimate goal is to apply this framework to construct digital twins for subduction zones, including Cascadia, to provide early warning for tsunamis generated by megathrust earthquakes. To this end, we demonstrate how our methodology can be used to employ seafloor pressure observations, along with the coupled acoustic–gravity wave equations, to infer the earthquake-induced spatiotemporal seafloor motion (discretized with $\mathscr{O}$ (10 9 ) parameters) and forward predict the tsunami propagation. We present results of an end-to-end inference, prediction, and uncertainty quantification for a representative test problem with $\mathscr{O}$ (10 8 ) inversion parameters for which goal-oriented Bayesian inference is accomplished exactly and in real time, that is, in a matter of seconds.

97 MATHEMATICS AND COMPUTING↗

High-order multirate explicit time-stepping schemes for the baroclinic-barotropic split dynamics in primitive equations

In order to treat the multiple time scales of ocean dynamics in an efficient manner, the baroclinic-barotropic splitting technique has been widely used for solving the primitive equations for ocean modeling. Based on the framework of strong stability-preserving Runge-Kutta approach, we propose two high-order multirate explicit time-stepping schemes (SSPRK2-SE and SSPRK3-SE) for the resulting split system in this paper. The proposed schemes allow for a large time step to be used for the three-dimensional baroclinic (slow) mode and a small time step for the two-dimensional barotropic (fast) mode, in which each of the two mode solves just need to satisfy their respective CFL conditions for numerical stability. Specifically, at each time step, the baroclinic velocity is first computed by advancing the baroclinic mode and fluid thickness of the system with the large time-step and the assistance of some intermediate approximations of the barotropicmode obtained by substepping with the small time step; then the barotropic velocity is corrected by using the small time step to re-advance the barotropic mode un-der an improved barotropic forcing produced by interpolation of the forcing terms from the preceding baroclinic mode solves; lastly, the fluid thickness is updated by coupling the baroclinic and barotropic velocities. Additionally, numerical inconsistencies on the discretized sea surface height caused by the mode splitting are relieved via a reconciliation process with carefully calculated flux deficits. Here, two benchmark tests from the “MPAS-Ocean” platform are carried out to numerically demonstrate the performance and parallel scalability of the proposed SSPRK-SE schemes.

54 ENVIRONMENTAL SCIENCES↗

Computation of supersonic turbulent flows over an inclined ogive-cylinder-flare

A supersonic turbulent flow over an ogive-cylinder-flare has been solved numerically. Initially, the parabolized Navier-Stokes equations are solved for the ogive cylinder back to a location upstream of the shock-wave and boundary-layer interaction. Then, the time-dependent Navier-Stokes equations with a thin-layer approximation are solved for the remaining cylinder-flare portion. Results for a Mach number of 2.9 and a unit Reynolds number of 11.42 x 10 to the 6th/m are obtained for angles of attack alpha = 0, 4, and 8 deg. Good agreement has been found between computed and experimental results of the surface pressure on the ogive-cylinder portion, and for the interaction region at alpha = 0 and 4 deg. The role of circumferential communication in a three-dimensional shock-wave and boundary-layer interaction flow field is discussed.

Hung, C. M.↗

Computation of Supersonic Turbulent Flows over an Inclined Ogive-Cylinder-Flare

A supersonic turbulent flow over an ogive-cylinder-flare has been solved numerically. The calculations proceed in two parts. Initially, the parabolized Navier-Stokes equations are solved for the ogive cylinder back to a location upstream of the shock-wave and boundary-layer interaction. Then, the time-dependent Navier-Stokes equations with a thin-layer approximation are solved for the remaining cylinder-flare portion. Results for a Mach number of 2.0 and a unit Reynolds number of 11.42 x 10(exp 6)/m are obtained for angles of attack alpha = 0, 4, and 8 deg. Good agreement has been found between computed and experimental results of the surface pressure on the ogive-cylinder portion and for the interaction region at alpha = 0 and 4 deg. The role of circumferential communication in a three-dimensional shock-wave and boundary-layer interaction flowfield is discussed.

Hung, C. M.↗

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 2: User's guide

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the User's Guide, and describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 1: Analysis description

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the Analysis Description, and presents the equations and solution procedure. The governing equations, the turbulence model, the linearization of the equations and boundary conditions, the time and space differencing formulas, the ADI solution procedure, and the artificial viscosity models are described in detail.

Towne, Charles E.↗