Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,477 records · Page 82

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special non-deteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of 'non-reflecting kernels,' nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The non-deteriorating algorithm, which is the core of the new ABCs is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals, and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimension spaces, It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the non-modified scheme. In the paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABCs' algorithm.

Ryabenkii, V. S.↗

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven↗

The star identification, pointing and tracking system of UVSTAR, an attached payload instrument system for the Shuttle Hitchhiker-M platform

We describe an algorithm for star identification and pointing/tracking of a spaceborne electro-optical system and simulation analyses to test the algorithm. The algorithm will be implemented in the guiding system of UVSTAR, a spectrographic telescope for observations of astronomical and planetary sources operating in the 500-1250 A waveband at approximately 1 A resolution. The experiment is an attached payload and will fly as a Hitchhiker-M payload on the Shuttle. UVSTAR includes capabilities for independent target acquisition and tracking. The spectrograph package has internal gimbals that allow angular movement of plus or minus 3 deg from the central position. Rotation about the azimuth axis (parallel to the Shuttle z axis) and elevation axis (parallel to the Shuttle x axis) will actively position the field of view to center the target of interest in the fields of the spectrographs. The algorithm is based on an on-board catalog of stars. To identify star fields, the algorithm compares the positions of stars recorded by the guiding imager to positions computed from the on-board catalog. When the field has been identified, its position within the guiding imager field of view can be used to compute the pointing corrections necessary to point to a target of interest. In tracking mode, the software uses the past history to predict the quasi-periodic attitude control motions of the shuttle and sends pointing commands to cancel the motion and stabilize UVSTAR on the target. The guiding imager (guider) will have an 80-mm focal length and f/1.4 optics giving a field of view of 6 deg x 4.5 deg using a 385 x 288 pixel intensified CCD. It will be capable of providing high accuracy (better than 2 arc-sec) attitude determination from coarse (6 deg x 4.5 deg) initial knowledge of the pointing direction; and of pointing toward the target. It will also be capable of tracking at the same high accuracy with a processing time of less than a few hundredths of a second.

Decarlo, Francesco↗

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗

Entropy Stable Nonconforming Discretizations with the Summation-By-Parts Property for Curvilinear Coordinates

The entropy conservative/stable algorithm of Friedrichet al.(2018) for hyperbolic conservation laws on nonconforming p-refined/coarsened Cartesian grids, is extended to curvilinear grids for the compressible Euler equations. The primary focus is on constructing appropriate coupling procedures across the curvilinear nonconforming interfaces. A simple and flexible approach is proposed that uses interpolation operators from one element to the other. On the element faces,the analytic metrics are used to construct coupling terms, while metric terms in the volume are approximated to satisfy a discretization of the geometric conservation laws. The resulting scheme is entropy conservative/stable, elementwise conservative, and freestream preserving. The accuracy and stability properties of the resulting numerical algorithm are shown to be comparable to those ofthe original conforming scheme (∼p+ 1 convergence) in the context of the isentropic Euler vortex and the inviscid Taylor–Green vortex problems on manufactured high order grids.

David Del Rey Fernandez↗

Multi-fidelity Bayesian neural networks: Algorithms and applications

Here we propose a new class of Bayesian neural networks (BNNs) that can be trained using noisy data of variable fidelity, and we apply them to learn function approximations as well as to solve inverse problems based on partial differential equations (PDEs). These multi-fidelity BNNs consist of three neural networks: The first is a fully connected neural network, which is trained following the maximum a posteriori probability (MAP) method to fit the low-fidelity data; the second is a Bayesian neural network employed to capture the cross-correlation with uncertainty quantification between the low- and high-fidelity data; and the last one is the physics-informed neural network, which encodes the physical laws described by PDEs. For the training of the last two neural networks, we first employ the mean-field variational inference (VI) to maximize the evidence lower bound (ELBO) to obtain informative prior distributions for the hyperparameters in the BNNs, and subsequently we use the Hamiltonian Monte Carlo (HMC) method to estimate accurately the posterior distributions for the corresponding hyperparameters. We demonstrate the accuracy of the present method using synthetic data as well as real measurements. Specifically, we first approximate a one- and four-dimensional function, and then infer the reaction rates in one- and two-dimensional diffusion-reaction systems. Moreover, we infer the sea surface temperature (SST) in the Massachusetts and Cape Cod Bays using satellite images and in-situ measurements. Taken together, our results demonstrate that the present method can capture both linear and nonlinear correlation between the low- and high-fidelity data adaptively, identify unknown parameters in PDEs, and quantify uncertainties in predictions, given a few scattered noisy high-fidelity data. Finally, we demonstrate that we can effectively and efficiently reduce the uncertainties and hence enhance the prediction accuracy with an active learning approach, using as examples a specific one-dimensional function approximation and an inverse PDE problem.

97 MATHEMATICS AND COMPUTING↗

Randomized algorithms for accelerating linear algebraic computations

The project supported the development of new methodologies for performing matrix computations that form key building blocks in modern scientific computing, such as low rank approximation of matrices, and efficient representations of global operators that arise in simulations of physical phenomena.

97 MATHEMATICS AND COMPUTING↗

Use of multiple gauges and microwave attenuation of precipitation for satellite verification

In this paper both a microwave attenuation measurement along a horizontal line and multiple point gauge measurements are analyzed as possible ground-truth designs to validate satellite precipitation retrieval algorithms at the field of view spatial level (typically about 20 km). The design consists of comparing a sequence of pairs of contemporaneous measurements taken from the ground and from space. The authors examine theoretically the variance of expected differences between the two systems. The line average measurement leads to a smaller mean-square error compared to the case of a single point gauge, since some of the small-scale variability of the rain field is smoothed away by the line integration. The multiple point gauge measurements also give smaller mean-square error than that of a single point gauge. The centroid of the line and point gauge configurations are considered to be located randomly inside the field of view for different overpasses. A space-time spectral formalism is used with a noise-forced diffusive rain field to find the mean-square error. By considering instantaneous ground and satellite measurement pairs over about 50 visits when raining, we can reduce the expected error to approximately 10% of the standard deviation of climatological variability. This is considered to be a useful level of tolerance for identifying biases in the retrieval algorithms. It is found that the multiple point gauges (especially two gauges) are the economical ground-truth design compared to the microwave attenuation based on the mean-square error comparison. The major finding of this study is that a significant improvement over the point gauge is obtained by adding a single additional piece of information; adding more gauges or extending the line of attenuation is not an important improvement.

Ha, Eunho↗

Sea Salt and Dust Optical Depths in the Caribbean and Equatorial Western Atlantic: A Multi-technique Analysis

Many instruments and algorithms can estimate aerosol optical depth (AOD) of the atmosphere. The Moderate Resolution Imaging Spectroradiometer (MODIS) onboard the Aqua spacecraft provides estimates at several wavelengths. The Synergized Optical Depth of Aerosols (SODA) algorithm utilizes the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) onboard the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO) spacecraft and the Cloud Profiling Radar (CPR) onboard the CloudSat spacecraft’s ocean returns to estimate AOD. CALIOP routinely estimates AOD for all individual layers detected within a column and these can be summed to generate a total column approximation. With the release of the Version 4.51 Lidar Level 2 data products in October 2023, direct estimates of total column optical depth are now derived using the Ocean Derived Column Optical Depths (ODCOD) algorithm. In this poster we investigate the multispectral AOD estimates, and derived Angstrom exponents of marine sea salt and dust provided by MODIS, SODA, CALIOP, and ODCOD in a major dust transport and deposition region of the equatorial Atlantic Ocean.

optical depth↗

Leveraging staggered tessellation for enhanced spatial resolution in high-granularity calorimeters

Here we advance the concept of high-granularity calorimeters with staggered tessellations, underscoring the effectiveness of a design incorporating multifold staggering cycles based on hexagonal cells to enhance position resolution. Moreover, we introduce HEXPLIT, a sub-cell re-weighting algorithm tailored to harness staggered designs, resulting in additional performance improvements. By combining our proposed staggered design with HEXPLIT, we achieve an approximately twofold enhancement in position resolution for neutrons across a wide energy range, as compared to unstaggered designs. These findings hold the potential to elevate particle-flow performance across various forthcoming facilities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Traffic Signal Control With Adaptive Online-Learning Scheme Using Multiple-Model Neural Networks

This article proposes a new traffic signal control algorithm to deal with unknown-traffic-system uncertainties and reduce delays in vehicle travel time. Unknown-traffic-system dynamics are approximated using a recurrent neural network (NN). To accurately identify the traffic system model, an online-learning scheme is developed to switch among a set of candidate NNs (i.e., multiple-model NNs) based on their estimation errors. Then, a bank of optimal signal-timing controllers is designed based on the online identification of the traffic system. Simulation studies have been carried out for the obtained control strategies using multiple-model NNs, and the desired results have been obtained. Moreover, compared with the widely used actuated traffic signal control schemes, it is shown that the proposed method can reduce vehicle travel delays and improve traffic system robustness.

99 GENERAL AND MISCELLANEOUS↗

Generative Vulnerability Assessment for Cyber-Physical Systems

Cyber-physical systems (CPS) are highly susceptible to malicious attacks due to their complex dynamics and interconnectivity. A comprehensive understanding of their vulnerabilities is essential for designing effective resilience measures. This paper presents a data-driven attack generative system for evaluating the vulnerability of CPS. The proposed approach formulates the vulnerability assessment problem as determining the feasibility of a specific attack set based on two boundary functions that represent the effectiveness and stealthiness of attacks. The attack generative model is trained using a custom loss function, with two universal approximators designed to learn the effectiveness and stealthiness functions simultaneously. Theoretical results for successful generation and asymptotic convergence of the resulting training algorithm are given. As a result, the proposed approach is evaluated via numerical simulation of an IEEE 14-bus system and gas pipeline systems, demonstrating its viability in learning how to attack nonlinear CPS and identify potential vulnerabilities.

Computer systems organization↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

ACCESS 1: Approximation Concepts Code for Efficient Structural Synthesis program documentation and user's guide

The program documentation and user's guide for the ACCESS-1 computer program is presented. ACCESS-1 is a research oriented program which implements a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and general mathematical programming algorithms are applied in the design optimization procedure. Implementation of the computer program, preparation of input data and basic program structure are described, and three illustrative examples are given.

Miura, H.↗

ACCESS-2: Approximation Concepts Code for Efficient Structural Synthesis, user's guide

A user's guide is presented for the ACCESS-2 computer program. ACCESS-2 is a research oriented program which implements a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and general mathematical programming algorithms are applied in the design optimization procedure.

Miura, H.↗

Forebody and base region real gas flow in severe planetary entry by a factored implicit numerical method. II - Equilibrium reactive gas

The factored-implicit, gas-dynamic algorithm has been adapted to the numerical simulation of equilibrium reactive flows. Changes required in the perfect gas version of the algorithm are developed, and the method of coupling gas-dynamic and chemistry variables is discussed. A flow-field solution that approximates a Jovian entry case was obtained by this method and compared with the same solution obtained by HYVIS, a computer program much used for the study of planetary entry. Comparison of surface pressure distribution and stagnation line shock-layer profiles indicates that the two solutions agree well.

Davy, W. C.↗

An implicit, transonic, full-potential code for cascade flow on H-grid topology

A transonic, full-potential code is developed for computing the flow through two-dimensional cascades using an H-type grid topology that employs an implicit approximate-factorization scheme. The body-conforming H-grid is generated numerically by solving Poisson's equation. The flow-solution algorithm at the coordinate mapping singularity associated with this grid is investigated using two different types of finite-difference schemes. The grid-geometry effect on these schemes is also studied by noting free-stream capturing properties. It is found that by implementing a consistent spatial differencing scheme, the mapping singularities can be resolved numerically, and the grid-geometry-induced error minimized. The code is verified by computing model cascade flow problems.

Kwak, D.↗

Three-dimensional flow over a conical afterbody containing a centered propulsive jet - A numerical simulation

The supersonic flow field over a body of revolution incident to the free stream is simulated numerically on a large, array processor (the CDC Cyber 205). The configuration is composed of a cone-cylinder forebody followed by a conical afterbody from which emanates a centered, supersonic propulsive jet. The free-stream Mach number is 2, the jet-exit Mach number is 2.5, and the jet-to-free-stream static pressure ratio is 3. Both the external flow and the exhaust are ideal air at a common total temperature. The thin-layer approximation to the time-dependent, compressible, Reynolds-averaged Navier-Stokes equations are solved using an implicit finite-difference algorithm. The data base, of 5 million words, is structured in a 'pencil' format so that efficient use of the array processor can be realized. The computer code is completely vectorized to take advantage of the data structure. Turbulence closure is achieved using an empirical algebraic eddy-viscosity model. The configuration and flow conditions correspond to published experimental tests and the computed solutions are consistent with the experimental data.

Deiwert, G. S.↗