SEARCH · Engineering Papers

Results for “decomposition algorithms”

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 487 records · Page 27

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Dynamic Mode Decomposition of Random Pressure Fields over Bluff Bodies

Fluctuating surface pressures on a bluff body exposed to a boundary layer flow generally are characterized as a spatiotemporally varying random field. In this paper, a dynamic mode decomposition (DMD) was applied to extract dominant features embedded in these random pressure fields. Utilizing an unsupervised machine learning algorithm, spatial modes and their temporal variations were grouped into different clusters at scales, e.g., macro, meso, and micro. A proper orthogonal decomposition (POD) of the experimental data was carried out to observe commonalities and distinctive perspectives each decomposition offers. Here, a comprehensive examination of the DMD/POD for their convergence criteria, data sufficiency, and modal components analysis was conducted. The physical interpretation of the spatiotemporal pressure field based on these decomposition schemes was discussed. At different scales, the DMD modes can capture the evolution of aerodynamic features, e.g., convection of vortices (or vortex tubes) and other structures. The distribution of energy among these three broad scales also reflects an energy cascade in pressure fluctuations akin to turbulence.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Effects of Postmortem Decomposition on Face Recognition

Although viable tools are available for the identification of unknown deceased individuals, recognition rates with these methods are greatly impacted by the degree to which decomposition has occurred. Therefore, identifying highly decomposed remains poses a major challenge. This paper analyzes the effect of facial decomposition on the recognition rates of several facial recognition commercial-off-theshelf systems and research-grade systems, as well as algorithms contained in a custom recognition library. The custom dataset of facial images used in the experiment is composed of 42 subjects at stages of decomposition rangingfrom recently deceased to later stages where the soft tissues are severely decomposed and facial features are deformed. It is shown that an algorithm’s ability to correctly detect a decomposing face is a crucial first step that not all face models can accurately handle. However, some of the evaluated Convolution Neural Network (CNN)–inspired methods provide promising results even in cases of severely decomposed faces.

Cornett, David↗

NASA NTRS1988

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↗

NASA NTRS1989

Parallel pseudospectral domain decomposition techniques

Gottlieb, David↗

NASA NTRS2006

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This report investigates the utility of the Hilbert Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this report is to demonstrate the potential applications of the Hilbert Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F-18 Active Aeroelastic Wing airplane, an Aerostructures Test Wing, and pitch plunge simulation.

Brenner, Martin J.↗

NASA NTRS2005

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This paper investigates the utility of the Hilbert-Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert-Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert-Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this paper is to demonstrate the potential applications of the Hilbert-Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized/online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F/A-18 Active Aeroelastic Wing aircraft, an Aerostructures Test Wing, and pitch-plunge simulation.

Brenner, Marty↗

DOE OSTI2018

Detecting False Data Injection Attacks Against Power System State Estimation With Fast Go-Decomposition Approach

State estimation is a fundamental function in modern energy management system, but its results may be vulnerable to false data injection attacks (FDIAs). FDIA is able to change the estimation results without being detected by the traditional bad data detection algorithms. In this paper, we propose an accurate and computational attractive approach for FDIA detection. In this work, we first rely on the low rank characteristic of the measurement matrix and the sparsity of the attack matrix to reformulate the FDIA detection as a matrix separation problem. Then, four algorithms that solve this problem are presented and compared, including the traditional augmented Lagrange multipliers (ALMs), double-noise-dual-problem (DNDP) ALM, the low rank matrix factorization, and the proposed new “Go Decomposition (GoDec).” Numerical simulation results show that our GoDec algorithm outperforms the other three alternatives and demonstrates a much higher computational efficiency. Furthermore, GoDec is shown to be able to handle measurement noise and applicable for large-scale attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2014

Transmission integral analysis of Mössbauer spectra displaying hyperfine parameter distributions with arbitrary profile

Accurate quantitative analysis of Mössbauer spectra displaying thickness effects requires the consideration of the so-called transmission integral when modeling the spectral shape. Whereas this is straightforward when the correct model for the decomposition of the absorber's nuclear resonance absorption cross-section into individual components is a priori known, in the absence of such knowledge and notably in the presence of hyperfine parameter distributions with an unknown profile, the so-called model-independent evaluation methods could be used to fit the spectra. However, the methods available for this purpose were developed for the analysis of spectra for which the thin absorber approximation is valid, and thus they do not take the sample thickness and related effects into account. Consequently, in order to use them for spectra displaying thickness effects, their usage needs to be generalized by combining them with transmission integral fitting. A new algorithm realizing such a generalized version of the Hesse-Rübartsch model-independent evaluation method was developed recently as an integral part of the MossWinn program. In the present work, the working principle of the newly developed algorithm is described in details along with examples illustrating the capabilities of the method for the case of {sup 57}Fe Mössbauer spectroscopy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2026

Performance of modern color decompositions for standard candle LHC tree amplitudes

In the last decade, developments of matrix element and phase space generators have focused on providing good efficiency and maximal flexibility and automation for a wide range of physical processes. However, as recent studies have shown, they are a major bottleneck in the established Monte Carlo event generator toolchains. With the advent of the HL-LHC and ever rising precision requirements, future developments will need to focus on computational performance, especially at intermediate to large jet multiplicities. We present the novel BlockGen family of fast matrix element algorithms that are amenable for GPU acceleration, making use of modern, minimal color decompositions. Moreover, we discuss the performance achieved for standard candle processes such as V +jets and tt̄+jets production.

Bothmann, E. [Gottingen U.]↗

DOE OSTI2021

A Privacy-Preserving Distributed Control of Optimal Power Flow

Here, we consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Twisty-puzzle-inspired approach to Clifford synthesis

The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's cube twisty puzzle, here we develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity. This approach is probabilistic and computationally intensive. However, when a decomposition is successfully found, it often involves fewer gates than the decomposition methods used in the Qiskit decomposition protocol, which uses a combination of several well-known Clifford decomposition schemes. Additionally, our approach is much more flexible than existing algorithms in that arbitrary gate sets, device topologies, and gate fidelities may be incorporated, thus allowing for the approach to be tailored to a specific device.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Stabilizer Rank Strong Simulation v.0.1

This software improves upon the Clifford gate+T gate magic state strong simulation algorithm by Brayvi and Gosset. It provides a better stabilizer state decomposition that scales as 2^{0.463t}, an improvement over 2^{0.468t}, for t T gate magic states. This code enables simulations of universal quantum computing with that asymptotic scaling cost. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525 SAND2020-14293 O

SciDAC↗

DOE OSTI2021

Using Grover's search algorithm to characterize the Rigetti Quantum Computing Platform

Performance of the Rigetti quantum computing platform was tested during the period of time from 12/16/2019 to 05/18/2020. The Grover's search (GS) algorithm was used as a testing tool, in particular, 3- and 4-level versions of the algorithm. As a result, a number of hardware issues were revealed, so the algorithm was split to smaller blocks and individual gates, and all of them were tested separately. The fidelity decay was found to be due to both decoherent processes and coherent errors of the native hardware gates. These errors were estimated from RX gate benchmarks and were in a form of extra rotation of the quantum state. As a consequence of that, performance of the algorithm was shown to be strongly dependent on the native gate decomposition of the program. Suggestions and possible improvements of the future Rigetti runs are made based on the obtained observations.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2001

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗

NASA NTRS2010

Extracting Independent Local Oscillatory Geophysical Signals by Geodetic Tropospheric Delay

Zenith Tropospheric Delay (ZTD) due to water vapor derived from space geodetic techniques and numerical weather prediction simulated-reanalysis data exhibits non-linear and non-stationary properties akin to those in the crucial geophysical signals of interest to the research community. These time series, once decomposed into additive (and stochastic) components, have information about the long term global change (the trend) and other interpretable (quasi-) periodic components such as seasonal cycles and noise. Such stochastic component(s) could be a function that exhibits at most one extremum within a data span or a monotonic function within a certain temporal span. In this contribution, we examine the use of the combined Ensemble Empirical Mode Decomposition (EEMD) and Independent Component Analysis (ICA): the EEMD-ICA algorithm to extract the independent local oscillatory stochastic components in the tropospheric delay derived from the European Centre for Medium-Range Weather Forecasts (ECMWF) over six geodetic sites (HartRAO, Hobart26, Wettzell, Gilcreek, Westford, and Tsukub32). The proposed methodology allows independent geophysical processes to be extracted and assessed. Analysis of the quality index of the Independent Components (ICs) derived for each cluster of local oscillatory components (also called the Intrinsic Mode Functions (IMFs)) for all the geodetic stations considered in the study demonstrate that they are strongly site dependent. Such strong dependency seems to suggest that the localized geophysical signals embedded in the ZTD over the geodetic sites are not correlated. Further, from the viewpoint of non-linear dynamical systems, four geophysical signals the Quasi-Biennial Oscillation (QBO) index derived from the NCEP/NCAR reanalysis, the Southern Oscillation Index (SOI) anomaly from NCEP, the SIDC monthly Sun Spot Number (SSN), and the Length of Day (LoD) are linked to the extracted signal components from ZTD. Results from the synchronization analysis show that ZTD and the geophysical signals exhibit (albeit subtle) site dependent phase synchronization index.

Botai, O. J.↗

NASA NTRS2011

Improving Distributed Diagnosis Through Structural Model Decomposition

Complex engineering systems require efficient fault diagnosis methodologies, but centralized approaches do not scale well, and this motivates the development of distributed solutions. This work presents an event-based approach for distributed diagnosis of abrupt parametric faults in continuous systems, by using the structural model decomposition capabilities provided by Possible Conflicts. We develop a distributed diagnosis algorithm that uses residuals computed by extending Possible Conflicts to build local event-based diagnosers based on global diagnosability analysis. The proposed approach is applied to a multitank system, and results demonstrate an improvement in the design of local diagnosers. Since local diagnosers use only a subset of the residuals, and use subsystem models to compute residuals (instead of the global system model), the local diagnosers are more efficient than previously developed distributed approaches.

Bregon, Anibal↗

DOE OSTI2026

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗