Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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,729 records · Page 96

Design of a high power 8 MeV electron beam injector for the LERF

Here, we present the beamline design for a high power 8 MeV electron injector to be installed at the Low Energy Recirculator Facility (LERF). The injector is designed to provide beam power of up to 80 kW for testing positron source target candidates. We discuss the results of beam dynamics simulations conducted using the General Particle Tracer (GPT) software, where electromagnetic beamline elements were optimized using multi-objective genetic algorithm tools. Additionally, we present preliminary studies on secondary particle generation from both rotating solid and free surface liquid metal jet targets described elsewhere in this workshop.

Lizarraga-Rubio, Victor Manuel [Thomas Jefferson N↗

Scalable deep learning for watershed model calibration

Watershed models such as the Soil and Water Assessment Tool (SWAT) consist of high-dimensional physical and empirical parameters. These parameters often need to be estimated/calibrated through inverse modeling to produce reliable predictions on hydrological fluxes and states. Existing parameter estimation methods can be time consuming, inefficient, and computationally expensive for high-dimensional problems. In this paper, we present an accurate and robust method to calibrate the SWAT model (i.e., 20 parameters) using scalable deep learning (DL). We developed inverse models based on convolutional neural networks (CNN) to assimilate observed streamflow data and estimate the SWAT model parameters. Scalable hyperparameter tuning is performed using high-performance computing resources to identify the top 50 optimal neural network architectures. We used ensemble SWAT simulations to train, validate, and test the CNN models. We estimated the parameters of the SWAT model using observed streamflow data and assessed the impact of measurement errors on SWAT model calibration. We tested and validated the proposed scalable DL methodology on the American River Watershed, located in the Pacific Northwest-based Yakima River basin. Our results show that the CNN-based calibration is better than two popular parameter estimation methods (i.e., the generalized likelihood uncertainty estimation [GLUE] and the dynamically dimensioned search [DDS], which is a global optimization algorithm). For the set of parameters that are sensitive to the observations, our proposed method yields narrower ranges than the GLUE method but broader ranges than values produced using the DDS method within the sampling range even under high relative observational errors. The SWAT model calibration performance using the CNNs, GLUE, and DDS methods are compared using R 2 and a set of efficiency metrics, including Nash-Sutcliffe, logarithmic Nash-Sutcliffe, Kling-Gupta, modified Kling-Gupta, and non-parametric Kling-Gupta scores, computed on the observed and simulated watershed responses. The best CNN-based calibrated set has scores of 0.71, 0.75, 0.85, 0.85, 0.86, and 0.91. The best DDS-based calibrated set has scores of 0.62, 0.69, 0.8, 0.77, 0.79, and 0.82. The best GLUE-based calibrated set has scores of 0.56, 0.58, 0.71, 0.7, 0.71, and 0.8. The scores above show that the CNN-based calibration leads to more accurate low and high streamflow predictions than the GLUE and DDS sets. Our research demonstrates that the proposed method has high potential to improve our current practice in calibrating large-scale integrated hydrologic models.

54 ENVIRONMENTAL SCIENCES↗

Exact Factorization Adventures: A Promising Approach for Non-Bound States

Modeling the dynamics of non-bound states in molecules requires an accurate description of how electronic motion affects nuclear motion and vice-versa. The exact factorization (XF) approach offers a unique perspective, in that it provides potentials that act on the nuclear subsystem or electronic subsystem, which contain the effects of the coupling to the other subsystem in an exact way. We briefly review the various applications of the XF idea in different realms, and how features of these potentials aid in the interpretation of two different laser-driven dissociation mechanisms. We present a detailed study of the different ways the coupling terms in recently-developed XF-based mixed quantum-classical approximations are evaluated, where either truly coupled trajectories, or auxiliary trajectories that mimic the coupling are used, and discuss their effect in both a surface-hopping framework as well as the rigorously-derived coupled-trajectory mixed quantum-classical approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗

Computer generation of symbolic network functions - A new theory and implementation.

A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, the proposed procedure employs fast, efficient, numerical-type algorithms to determine the contribution of those network branches that are not represented by symbolic parameters. A computer program called NAPPE (for Network Analysis Program using Parameter Extractions) and incorporating all of the concepts discussed has been written. Several examples illustrating the usefulness and efficiency of NAPPE are presented.

Alderson, G. E.↗

Determination of instrumentation errors from measured data using maximum likelihood method

The maximum likelihood method is used for estimation of unknown initial conditions, constant bias and scale factor errors in measured flight data. The model for the system to be identified consists of the airplane six-degree-of-freedom kinematic equations, and the output equations specifying the measured variables. The estimation problem is formulated in a general way and then, for practical use, simplified by ignoring the effect of process noise. The algorithm developed is first applied to computer generated data having different levels of process noise for the demonstration of the robustness of the method. Then the real flight data are analyzed and the results compared with those obtained by the extended Kalman filter algorithm.

Keskar, D. A.↗

Transonic perturbation analysis of wing-fuselage-nacelle-pylon configurations with powered jet exhausts

A transonic small perturbation method has been developed for the analysis of general wing-fuselage-nacelle-pylon configurations with powered jet exhausts. Finite difference successive line relaxation algorithm is used to solve the small disturbance potential equation in conservative form. The nacelle tangency condition and the jet exhaust plume contact conditions are fulfilled in a quasi-cylindrical fashion on a surface fitting the Cartesian grid. The pylon tangency condition is treated in a quasi-planar manner as for the wing. Viscous displacement effects on the wing are modeled by suitable shape changes including the placement of a viscous ramp at the base of the shock. Computed results of a transport configuration show satisfactory correlation with test data.

Wai, J. C.↗

Hidden-Line Computer Code

New, efficient solution minimizes run time. Approach based on approved theorem provides formal basis for assuring generality and rapid execution. Theorem does not directly address nuisance of square law growth. Analysis of algorithm shows it tends to avoid square-law growth, and rigorous testing verified algorithm tends to enjoy almost linear growth.

Hedgley, D. R., Jr.↗

Detection of abrupt changes in dynamic systems

Some of the basic ideas associated with the detection of abrupt changes in dynamic systems are presented. Multiple filter-based techniques and residual-based method and the multiple model and generalized likelihood ratio methods are considered. Issues such as the effect of unknown onset time on algorithm complexity and structure and robustness to model uncertainty are discussed.

Willsky, A. S.↗

An implicit finite-difference code for a two-equation turbulence model for three-dimensional flows

An implicit finite difference code was developed which solves the transport equations for the turbulence kinetic energy and its dissipation rate in generalized coordinates in three dimensions. The finite difference equations are solved using the Beam-Warming algorithm. The kinetic energy-dissipation code, KEM, provides the closure; i.e., the turbulent viscosity for calculation of either compressible or incompressible flows. Turbulent internal flow over a backward-facing step has been calculated using the present code in conjunction with the Incompressible Navier-Stokes Code, INS3D. The results are in good agreement with experiments and two dimensional computations of other researchers.

Kaul, U. K.↗

Three dimensional CSCM method for the compressible Navier-Stokes equations with application to a multi-nozzle exhaust flowfield

The effective design of three-dimensional flow systems such as a clustered multinozzle shrouded exhaust system requires detailed analysis of the internal flowfield. It is pointed out that new numerical techniques on the most modern vector computers are making these analyses practicable. In this paper, the upwind differenced implicit conservative supracharacteristics method (CSCM) for three-dimensional viscous flow is presented. The new method is an implicit 'method of planes' symmetric Gauss-Seidel relaxation scheme. The data is conveniently stored on successive planes along the streamwise coordinate, and the system of equations is solved twice in each successive plane of the streamwise coordinate. The developed new three-dimensional compressible Navier-Stokes algorithm combines the best features of the storage and computationally efficient space marching procedures with the generality of time dependent techniques to solve flows with elliptic and streamwise separated flows.

Bardina, J.↗

Implicit finite-difference methods for the Euler equations

The present paper is concerned with two-dimensional Euler equations and with schemes which are in use of the time of this writing. Most of the development presented carries over directly to three dimensions. The characteristics of the two-dimensional Euler equations in Cartesian coordinates are considered along with generalized curvilinear coordinate transformations, metric relations, invariants of the transformation, flux Jacobian matrices and eigensystems, numerical algorithms, flux split algorithms, implicit and explicit nonlinear control (smoothing), upwind differencing in supersonic regions, unsteady and steady-state computation, the diagonal form of implicit algorithm, metric differencing and invariants, boundary conditions, geometry and mesh generation, and sample solutions.

Pulliam, T. H.↗

Parallel pseudospectral domain decomposition techniques

The influence of interface boundary conditions on the ability to parallelize pseudospectral multidomain algorithms is investigated. Using the properties of spectral expansions, a novel parallel two domain procedure is generalized to an arbitrary number of domains each of which can be solved on a separate processor. This interface boundary condition considerably simplifies influence matrix techniques.

Gottlieb, David↗

Approaches to the automatic generation and control of finite element meshes

The algorithmic approaches being taken to the development of finite element mesh generators capable of automatically discretizing general domains without the need for user intervention are discussed. It is demonstrated that because of the modeling demands placed on a automatic mesh generator, all the approaches taken to date produce unstructured meshes. Consideration is also given to both a priori and a posteriori mesh control devices for automatic mesh generators as well as their integration with geometric modeling and adaptive analysis procedures.

Shephard, Mark S.↗

Performance limits for optimal microburst encounter

An effort has been made to ascertain the envelope-edges for uneventful aircraft penetrations of microburst windshears on the basis of optimal aircraft control strategies. Over 1100 such trajectories have been computed for contemporary airliners and general aviation aircraft, in the case of idealized microbursts, using a successive quadratic program trajectory optimization algorithm able to directly handle inequality constraints. Variations of optimal performance with microburst type, intensity, length scale, and location, define performance limits; these limits fall into short, intermediate, and long microburst length scale regimes. The ability to safely transit a microburst also varies strongly with microburst location.

Psiaki, Mark L.↗

The dynamics and control of the in-orbit SCOLE configuration

The study of the dynamics of the Spacecraft Control Laboratory Experiment (SCOLE) is extended to emphasize the synthesis of control laws for both the linearized system as well as the large amplitude slewing maneuvers required to rapidly reorient the antenna line of sight. For control of the system through small amplitude displacements from the nominal equilibrium position LQR techniques are used to develop the control laws. Pontryagin's maximum principle is applied to minimize the time required for the slewing of a general rigid spacecraft system. The minimum slewing time is calculated based on a quasi-linearization algorithm for the resulting two point boundary value problem. The effect of delay in the control input on the stability of a continuously acting controller (designed without considering the delay) is studied analytically for a second order plant. System instability can result even for delays which are only a small fraction of the natural period of motion.

Bainum, Peter M.↗

Extension and validation of a method for locating damaged members in large space trusses

The damage location approach employs the control system capabilities for the structure to test the structure and measure the dynamic response. The measurements are then used in a system identification algorithm to produce a model of the damaged structure. The model is compared to one for the undamaged structure to find regions of reduced stiffness which indicate the location of damage. Kabe's 3,4 stiffness matrix adjustment method was the central identification algorithm. The strength of his method is that, with minimal data, it preserves the representation of the physical connectivity of the structure in the resulting model of the damaged truss. However, extensive storage and computational effort were required as a result. Extension of the damage location method to overcome these problems is the first part of the current work. The central system identification algorithm is replaced with the MSMT method of stiffness matrix adjustment which was previously derived by generalizing an optimal-update secant method form quasi-Newton approaches for nonlinear optimization. Validation of the extended damage location method is the second goal.

Smith, Suzanne Weaver↗

Optimal dynamic control of resources in a distributed system

The authors quantitatively formulate the problem of controlling resources in a distributed system so as to optimize a reward function and derive optimal control strategies using Markov decision theory. The control variables treated are quite general; they could be control decisions related to system configuration, repair, diagnostics, files, or data. Two algorithms for resource control in distributed systems are derived for time-invariant and periodic environments, respectively. A detailed example to demonstrate the power and usefulness of the approach is provided.

Shin, Kang G.↗