Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

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,513 records · Page 84

Demonstration of the Plant Fuel Reload Process Optimization for an Operating PWR

The United States (U.S.) nuclear industry is facing a strong challenge to maintain regulatory-required levels of safety while ensuring economic competitiveness to stay in business. Safety remains a key parameter for all aspects related to the operation of light water reactor (LWR) nuclear power plants (NPPs) and can be achieved more economically by using a risk-informed ecosystem such as that being developed by the Risk-Informed Systems Analysis (RISA) Pathway under the U.S. Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program. The LWRS Program is promoting a wide range of research and development (R&D) activities with the goal to maximize both the safety and economically efficient performance of NPPs through improved scientific understanding, especially given that many plants are considering second license renewal. The RISA Pathway has two main goals: (1) the deployment of methodologies and technologies that enable better representation of safety margins and the factors that contribute to cost and safety; and (2) the development of advanced applications that enable cost-effective plant operation. This report summarizes the research outcomes in FY-2021, which the project progressed from the planning and methodology development phase to the early demonstration phase. The highlights of these activities are: (1) the development of a multi-objective optimization process using Genetic Algorithms (GAs); (2) the development and test of an approach for optimization process acceleration using artificial intelligence (AI) that significantly reduces the computational burden; (3) the demonstration of the fuel reload optimization framework for a generic pressurized water reactor (PWR); and (4) the demonstration of limiting design basis accident (DBA) scenarios for evaluation of the transition from deterministic to risk-informed approach for fuel reload optimization.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗

Automated Credibility Assessments of User Features in Scientific Software

Scientific software (SciSoft) is complex, often containing a mixture of production capabilities co-mingled with features under active research and development. Furthermore, SciSoft is often developed over decades by non-computer scientists who may not have a strong background in or prioritize software architecture design, testing, and quality (e.g., test coverage). These conditions lead to difficulty in understanding which software components or functions implement what user-facing features and therefore those features’ software quality pedigree. This lack of understanding poses challenges in assessing readiness and credibility of user features, and often relies on a SciSoft subject matter expert’s (SME) laborious investigation and assertion. This final report of a one-year Computing and Information Sciences Lab Directed Research and Development project presents a general framework for modeling SciSoft architecture as a direct relationship between user features and the software components/functions that implement them. Our approach leverages automated labeling of the SciSoft’s regression test suite and employs machine learning algorithms to construct the architecture model. We demonstrate this framework on the Solid Mechanics component of the SIERRA multi-physics engineering analysis suite developed at Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗

Wholesale Electricity Analysis via Simulation & Learning Experiments (WEASLE): Platform Development and Pilot Competition

This document reports the development of the Wholesale Electricity Analysis via Simulation and Learning Experiments (WEASLE) platform and the pilot competition that was conducted to test the platform. Due to the increasing reliance on variable renewable energy resources for bulk power, the pilot competition, called the Energy Storage Participation Algorithm Competition (ESPA-Comp), was used to test the effect of various market designs on storage utilization and market efficiency. Basic details of the platform are provided, including an overview of the market clearing engine, the battery dispatch and degradation models, electric grid topology and resource mix, and software architecture. Two market designs were tested: a two-settlement market analogous to typical ISO design today, and a multi-settlement market that allows additional forward-trading periods during the real-time market. Results from the pilot competition show that the storage bidding problem is nontrivial and is well suited for future challenges. We find that: 1) all four teams utilized different approaches to the bidding problem, 2) different methodological approaches led to substantially different offer behaviors, 3) resource profits are clustered by team and methodological approach, 4) simulated offers reduced market surplus by about 0.5%, 5) substantially different prices between two-settlement and multi-settlement markets albeit minimal difference in overall market surplus.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Geometric remapping of particle distributions in the Discrete Element Model for Sea Ice (DEMSI v0.0)

Abstract. A new sea ice dynamical core, the Discrete Element Model for Sea Ice (DEMSI), is under development for use in coupled Earth system models. DEMSI is based on the discrete element method, which models collections of ice floes as interacting Lagrangian particles. In basin-scale sea ice simulations the Lagrangian motion results in significant convergence and ridging, which requires periodic remapping of sea ice variables from a deformed particle configuration back to an undeformed initial distribution. At the resolution required for Earth system models we cannot resolve individual sea ice floes, so we adopt the sub-grid-scale thickness distribution used in continuum sea ice models. This choice leads to a series of hierarchical tracers depending on ice fractional area or concentration that must be remapped consistently. The circular discrete elements employed in DEMSI help improve the computational efficiency at the cost of increased complexity in the effective element area definitions for sea ice cover that are required for the accurate enforcement of conservation. An additional challenge is the accurate remapping of element values along the ice edge, the location of which varies due to the Lagrangian motion of the particles. In this paper we describe a particle-to-particle remapping approach based on well-established geometric remapping ideas that enforces conservation, bounds preservation, and compatibility between associated tracer quantities, while also robustly managing remapping at the ice edge. One element of the remapping algorithm is a novel optimization-based flux correction that enforces concentration bounds in the case of nonuniform motion. We demonstrate the accuracy and utility of the algorithm in a series of numerical test cases.

58 GEOSCIENCES↗

An adaptive precision gradient method for optimal control.

This paper presents a gradient algorithm for unconstrained optimal control problems. The algorithm is stated in terms of numerical integration formulas, the precision of which is controlled adaptively by a test that ensures convergence. Empirical results show that this algorithm is considerably faster than its fixed precision counterpart.-

Klessig, R.↗

A survey of AFFDL parameter estimation efforts and future plans

An overview is presented of the applications of parameter estimation methods to the following areas of interest at the Air Force Flight Dynamics Laboratory (AFFDL): (1) conventional stability and control parameter estimation of rigid aircraft; (2) extension to elastic aircraft; (3) extension to stall/spin aerodynamics of rigid aircraft with a nonlinear model; (4) application to the pilot model identification; and (5) correlation of wind tunnel, drop model and flight test data. Only well-documented algorithms are used with modification to the model as required for the specific application. The genesis of each problem and other background information are discussed which enumerate the algorithms and explain how this information is used to improve existing operational aircraft characteristics as well as specify design criteria for future USAF aerospace vehicles.

Eckholdt, D. C.↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

SAR observations of coastal zone conditions

Applications of Synthetic Aperture Radar (SAR) technology to the observation of coastal zones phenomena are detailed. The conditions observed include gravity wave detection, surf zone location, surface currents, and long-period 'surf beats'. Algorithms have been developed and successfully tested that determine significant wave and current parameters from the sea surface backscatter of microwave energy. Doppler information from the SAR optical correlator allows a rough estimation of near shore surface flow velocities that has been found in agreement with both theory and in situ observations as well. Seasat SAR data of the Scotland and North Carolina coasts are considered, as well as the results of bathymetric updating of coastal area charts.

Meadows, G. A.↗

NASA/RAE collaboration on nonlinear control using the F-8C digital fly-by-wire aircraft

Design procedures are reviewed for variable integral control to optimize response (VICTOR) algorithms and results of preliminary flight tests are presented. The F-8C aircraft is operated in the remotely augmented vehicle (RAV) mode, with the control laws implemented as FORTRAN programs on a ground-based computer. Pilot commands and sensor information are telemetered to the ground, where the data are processed to form surface commands which are then telemetered back to the aircraft. The RAV mode represents a singlestring (simplex) system and is therefore vulnerable to a hardover since comparison monitoring is not possible. Hence, extensive error checking is conducted on both the ground and airborne computers to prevent the development of potentially hazardous situations. Experience with the RAV monitoring and validation procedures is described.

Butler, G. F.↗

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗

Edge detection for synthetic aperture radar and other noisy images

The development is examined of a new edge detector which is shown to perform adequately in the non-Gaussian multiplicative noise environment which characterizes radar images. This edge detector operates over larger local neighborhood and is less susceptible to noise than previous edge detectors and is therefore more suitable for radar. In addition, a radar image noise model is employed for the design of this new operator. This edge detector is unique in that it is assumed that every local area belongs to either the class of local areas not containing edges or to the class of local areas containing edges. Each pixel's local neighborhood is then assigned to one of these two classes using a statistical hypothesis (a likelihood ratio) test. It is demonstrated that this algorithm is useful for detecting edges in radar images.

Frost, V. S.↗

Hubble space telescope: Pointing error effects on nonlinear ball joints

The Hubble Space Telescope pointing error produced by optical benches mounted on free ball joints is examined. Spacecraft cable connections are assumed to produce translational and rotational damping and restoring forces which act through the optical bench center of mass. The nonlinear dynamics are modeled and then implemented using an existing computer program for simulating the vehicle dynamics and pointing control system algorithm. Results are presented for the test case which indicate acceptable performance.

Farmer, J. E.↗

ISCCP cloud algorithm intercomparison

Research related to the International Satellite Cloud Climatology Project (ISCCP) began with a pilot study initiated in late 1981 to evaluate currently available cloud analysis algorithms. Other objectives of this study are related to a test of the effects of data volume compression schemes and the design of the operational algorithms for ISCCP. The present paper summarizes the pilot study by focusing on the most fundamental step of any cloud algorithm, that of cloud detection. An outline is provided of the objectives and limitations of the pilot study, and a description is given of the criteria used to design the operational analysis algorithm. Attention is given to the pilot study data set, a cloud detection intercomparison, a cloud analysis, and ISCCP cloud algorithm design.

Rossow, W. B.↗

An algorithmic approach to crustal deformation analysis

In recent years the analysis of crustal deformation measurements has become important as a result of current improvements in geodetic methods and an increasing amount of theoretical and observational data provided by several earth sciences. A first-generation data analysis algorithm which combines a priori information with current geodetic measurements was proposed. Relevant methods which can be used in the algorithm were discussed. Prior information is the unifying feature of this algorithm. Some of the problems which may arise through the use of a priori information in the analysis were indicated and preventive measures were demonstrated. The first step in the algorithm is the optimal design of deformation networks. The second step in the algorithm identifies the descriptive model of the deformation field. The final step in the algorithm is the improved estimation of deformation parameters. Although deformation parameters are estimated in the process of model discrimination, they can further be improved by the use of a priori information about them. According to the proposed algorithm this information must first be tested against the estimates calculated using the sample data only. Null-hypothesis testing procedures were developed for this purpose. Six different estimators which employ a priori information were examined. Emphasis was put on the case when the prior information is wrong and analytical expressions for possible improvements under incompatible prior information were derived.

Iz, Huseyin Baki↗

Issues, concerns, and initial implementation results for space based telerobotic control

Telerobotic control for space based assembly and servicing tasks presents many problems in system design. Traditional force reflection teleoperation schemes are not well suited to this application, and the approaches to compliance control via computer algorithms have yet to see significant testing and comparison. These observations are discussed in detail, as well as the concerns they raise for imminent design and testing of space robotic systems. As an example of the detailed technical work yet to be done before such systems can be specified, a particular approach to providing manipulator compliance is examined experimentally and through modeling and analysis. This yields some initial insight into the limitations and design trade-offs for this class of manipulator control schemes. Implications of this investigation for space based telerobots are discussed in detail.

Lawrence, D. A.↗