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 775 records · Page 43

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

An application of oil film interferometry (OFI) to measure skin friction on the 3D flow over an NACA 0015 airfoil with 30° of sweep is presented. Local flow direction must be known to apply OFI to complex 3D flows such as this. A recently developed surface flow vector extraction method was integrated into the OFI analysis algorithm. Surface flow vectors were used to calculate the surface streamlines and hence provided local flow direction to the OFI analysis. After calibration using photogrammetry, the surface flow vectors also enabled decomposition of the skin friction coefficient into different components (such as chordwise and spanwise). The presented method successfully measured skin friction at locations with different flow characteristics such as high skin friction regions, strong spanwise flow regions, and 3D flow separated regions. In the current OFI analysis, multiple interferogram images acquired at different times were analyzed for the same location. The multiple interferogram analysis enabled averaging, which reduced the scatter the skin friction data. The results presented herein demonstrate the capability of the current approach, thereby extending OFI skin friction measurements to complex 3D flows.

Skin friction measurement↗

NASA NTRSDate not supplied

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

Skin friction measurement↗

DOE OSTI2026

Ensemble Federated Machine Learning‐Based Cybersecurity Situational Awareness in Microgrid Network

Cyber-physical microgrids are vulnerable to stealthy cybersecurity threats that disguise their actions through the exploitation of system knowledge. Such actions can severely impacts microgrids deployed in defense bases, slowing the response time of military forces during national emergencies. Several machine-learning algorithms have been proposed to detect intrusions in the grid networks; however, these traditional machine-learning algorithms lack data privacy and are subject to several adversarial machine-learning threats. This paper proposes a novel federated machine learning (FML)-based three-model framework to detect and identify stealthy data-integrity attacks while ensuring data privacy in microgrid networks. The proposed architecture uses a variational mode decomposition technique to extract derived features from incoming measurement and control datasets. The extraction of these derived features allows FML models to learn minute variations in data patterns that allow them to perform significantly better than the models trained with generic datasets consisting of raw features. Our experimental results show the efficient performance of the proposed methodology against different types of data integrity attacks while considering primary and secondary controllers in microgrids. Further, the applied FML-integrated random forest ensemble algorithm outperforms the existing generic FML algorithms during noisy and noise-free datasets with prediction latencies of only 91–134 µs per sample within the 0.1 s sampling interval and requires communication bandwidth of around ∼8.25 KB/s at the control center and ∼2.7 KB/s per edge client for communication.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1997

A Comparison of PETSC Library and HPF Implementations of an Archetypal PDE Computation

Two paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation a nonlinear, structured-grid partial differential equation boundary value problem using the same algorithm on the same hardware. Both paradigms, parallel libraries represented by Argonne's PETSC, and parallel languages represented by the Portland Group's HPF, are found to be easy to use for this problem class, and both are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under either paradigm includes specification of the data partitioning (corresponding to a geometrically simple decomposition of the domain of the PDE). Programming in SPAM style for the PETSC library requires writing the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global- to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm, introducing concurrency through subdomain blocking (an effort similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Correctness and scalability are cross-validated on up to 32 nodes of an IBM SP2.

Hayder, M. Ehtesham↗

NASA NTRS2007

Quaternion Averaging

Many applications require an algorithm that averages quaternions in an optimal manner. For example, when combining the quaternion outputs of multiple star trackers having this output capability, it is desirable to properly average the quaternions without recomputing the attitude from the the raw star tracker data. Other applications requiring some sort of optimal quaternion averaging include particle filtering and multiple-model adaptive estimation, where weighted quaternions are used to determine the quaternion estimate. For spacecraft attitude estimation applications, derives an optimal averaging scheme to compute the average of a set of weighted attitude matrices using the singular value decomposition method. Focusing on a 4-dimensional quaternion Gaussian distribution on the unit hypersphere, provides an approach to computing the average quaternion by minimizing a quaternion cost function that is equivalent to the attitude matrix cost function Motivated by and extending its results, this Note derives an algorithm that deterniines an optimal average quaternion from a set of scalar- or matrix-weighted quaternions. Rirthermore, a sufficient condition for the uniqueness of the average quaternion, and the equivalence of the mininiization problem, stated herein, to maximum likelihood estimation, are shown.

Markley, F. Landis↗

DOE OSTI2016

Grid-based electronic structure calculations: The tensor decomposition approach

We present a fully grid-based approach for solving Hartree–Fock and all-electron Kohn–Sham equations based on low-rank approximation of three-dimensional electron orbitals. Due to the low-rank structure the total complexity of the algorithm depends linearly with respect to the one-dimensional grid size. Linear complexity allows for the usage of fine grids, e.g. 8192{sup 3} and, thus, cheap extrapolation procedure. We test the proposed approach on closed-shell atoms up to the argon, several molecules and clusters of hydrogen atoms. All tests show systematical convergence with the required accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2013

Collaborative Proposal: Transforming How Climate System Models are Used: A Global, Multi-Resolution Approach

Despite the great interest in regional modeling for both weather and climate applications, regional modeling is not yet at the stage that it can be used routinely and effectively for climate modeling of the ocean. The overarching goal of this project is to transform how climate models are used by developing and implementing a robust, efficient, and accurate global approach to regional ocean modeling. To achieve this goal, we will use theoretical and computational means to resolve several basic modeling and algorithmic issues.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1986

A class of fast staircase algorithms for generalized state-space systems

Several methods are presented for defining generalized state space models (GSSM), with emphasis on 'fast' techniques for transforming GSSMs to condensed state space models (SSM). The fast forms are configured to yield invariant transfer functions. Details of the decomposition process are summarized in terms of the determination of eigenvalues which are separated within staircase matrices. Applications of the techniques are illustrated through implementation of a unimodular transformation which does not affect the finite eigenvalues, by demonstrating deadbeat control of a GSSM, which the definition of a reduced observer of a GSSM, and by embedding a polynomial matrix into a unimodular matrix.

Beelen, T.↗

DOE OSTI2019

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Global sensitivity analysis in stochastic simulators of uncertain reaction networks

Stochastic models of chemical systems are often subjected to uncertainties in kinetic parameters in addition to the inherent random nature of their dynamics. Uncertainty quantification in such systems is generally achieved by means of sensitivity analyses in which one characterizes the variability with the uncertain kinetic parameters of the first statistical moments of model predictions. In this work, we propose an original global sensitivity analysis method where the parametric and inherent variability sources are both treated through Sobol’s decomposition of the variance into contributions from arbitrary subset of uncertain parameters and stochastic reaction channels. The conceptual development only assumes that the inherent and parametric sources are independent, and considers the Poisson processes in the random-time-change representation of the state dynamics as the fundamental objects governing the inherent stochasticity. Here, a sampling algorithm is proposed to perform the global sensitivity analysis, and to estimate the partial variances and sensitivity indices characterizing the importance of the various sources of variability and their interactions. The birth-death and Schlögl models are used to illustrate both the implementation of the algorithm and the richness of the proposed analysis method. The output of the proposed sensitivity analysis is also contrasted with a local derivative-based sensitivity analysis method classically used for this type of systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

An efficient computational algorithm for pricing European, barrier and American options

In this work, we use the spectral collocation technique for spatial derivatives and predictor–corrector method for time integration to solve the Black–Scholes (B–S) equation. If the spectral collocation method is worked properly, then we get high accuracy in the numerical solutions. Firstly, theory of application of Chebyshev spectral collocation technique and domain decomposition method on the B–S equation is presented. This method gets a stiff system of differential equations. Secondly, by using the predictor–corrector method with variable step size, we obtain the high accuracy approximate solution in the numerical integration of the stiff system of DEs. We present the order of accuracy for the proposed method. The numerical results show the efficiency and validity of the method.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1997

An Algorithm for Integrated Subsystem Embodiment and System Synthesis

Consider the statement,'A system has two coupled subsystems, one of which dominates the design process. Each subsystem consists of discrete and continuous variables, and is solved using sequential analysis and solution.' To address this type of statement in the design of complex systems, three steps are required, namely, the embodiment of the statement in terms of entities on a computer, the mathematical formulation of subsystem models, and the resulting solution and system synthesis. In complex system decomposition, the subsystems are not isolated, self-supporting entities. Information such as constraints, goals, and design variables may be shared between entities. But many times in engineering problems, full communication and cooperation does not exist, information is incomplete, or one subsystem may dominate the design. Additionally, these engineering problems give rise to mathematical models involving nonlinear functions of both discrete and continuous design variables. In this dissertation an algorithm is developed to handle these types of scenarios for the domain-independent integration of subsystem embodiment, coordination, and system synthesis using constructs from Decision-Based Design, Game Theory, and Multidisciplinary Design Optimization. Implementation of the concept in this dissertation involves testing of the hypotheses using example problems and a motivating case study involving the design of a subsonic passenger aircraft.

Lewis, Kemper↗

DOE OSTI2019

Enhanced Quantum Synchronization via Quantum Machine Learning

Abstract The quantum synchronization between a pair of two‐level systems inside two coupled cavities is studied. By using a digital–analog decomposition of the master equation that rules the system dynamics, it is shown that this approach leads to quantum synchronization between both two‐level systems. Moreover, in this digital–analog block decomposition, the fundamental elements of a quantum machine learning protocol can be identified, in which the agent and the environment (learning units) interact through a mediating system, namely, the register. If the algorithm can be additionally equipped with a classical feedback mechanism, which consists of projective measurements in the register, reinitialization of the register state, and local conditional operations on the agent and environment subspace, a powerful and flexible quantum machine learning protocol emerges. Indeed, numerical simulations show that this protocol enhances the synchronization process, even when every subsystem experiences different loss/decoherence mechanisms, and gives the flexibility to choose the synchronization state. Finally, an implementation is proposed, based on current technologies in superconducting circuits.

Cárdenas‐López, Francisco A.↗

DOE OSTI2024

GPU-Accelerated Solution of the Bethe–Salpeter Equation for Large and Heterogeneous Systems

We present a massively parallel GPU-accelerated implementation of the Bethe–Salpeter equation (BSE) for the calculation of the vertical excitation energies (VEEs) and optical absorption spectra of condensed and molecular systems, starting from single-particle eigenvalues and eigenvectors obtained with density functional theory. The algorithms adopted here circumvent the slowly converging sums over empty and occupied states and the inversion of large dielectric matrices through a density matrix perturbation theory approach and a low-rank decomposition of the screened Coulomb interaction, respectively. Further computational savings are achieved by exploiting the nearsightedness of the density matrix of semiconductors and insulators to reduce the number of screened Coulomb integrals. We scale our calculations to thousands of GPUs with a hierarchical loop and data distribution strategy. The efficacy of our method is demonstrated by computing the VEEs of several spin defects in wide-band-gap materials, showing that supercells with up to 1000 atoms are necessary to obtain converged results. We discuss the validity of the common approximation that solves the BSE with truncated sums over empty and occupied states. In conclusion, we then apply our GW-BSE implementation to a diamond lattice with 1727 atoms to study the symmetry breaking of triplet states caused by the interaction of a point defect with an extended line defect.

Absorption spectra↗

DOE OSTI2022

Nonlinear spectral analysis of ion acoustic solitons arising from a streaming charged object using the numerical inverse scattering transform

Observations of nonlinear coherent plasma phenomena in spacecraft and terrestrial experiments often rely on visual identification of solitary modes because nonlinear coherent modes are broadband in a Fourier transform based analysis. We implement an alternative spectral decomposition known as the inverse scattering transform and demonstrate its ability to successfully isolate nonlinear modes on the homogeneous and forced Korteweg–De Vries equation which models these nonlinear modes. We also demonstrate for the first time that this decomposition is useful when forcing is applied. This is because the stable modes generated by localized forcing are similar to the homogeneous solutions where the inverse scattering transform is a rigorous decomposition. This spectral technique is then applied to simulations of ion acoustic waves generated by a 10 mm spherical debris object interacting with the ionospheric plasma orbiting at 2000 km altitude. The algorithm is found to successfully detect the resultant solitons. This demonstrates the feasibility of using this spectral technique as a real time analysis tool for screening spacecraft data for nonlinear solitary modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1990

A parallel algorithm for nonlinear convection-diffusion equations

A parallel algorithm for the efficient solution of nonlinear time-dependent convection-diffusion equations with small parameter on the diffusion term is presented. The method is based on a physically motivated domain decomposition that is dictated by singular perturbation analysis. The analysis is used to determine regions where certain reduced equations may be solved in place of the full equation. The method is suitable for the solution of problems arising in the simulation of fluid dynamics. Experimental results for a nonlinear equation in two-dimensions are presented.

Scroggs, Jeffrey S.↗

NASA NTRS1996

Soft-decision decoding techniques for linear block codes and their error performance analysis

The first paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. The second paper derives an upper bound on the probability of block error for multilevel concatenated codes (MLCC). The bound evaluates difference in performance for different decompositions of some codes. The third paper investigates the bit error probability code for maximum likelihood decoding of binary linear codes. The fourth and final paper included in this report is concerns itself with the construction of multilevel concatenated block modulation codes using a multilevel concatenation scheme for the frequency non-selective Rayleigh fading channel.

Lin, Shu↗

DOE OSTI2015

Nondestructive Evaluation of Thick Concrete Structures

Materials issues are a key concern for the existing nuclear reactor fleet in the United States as material degradation can lead to increased maintenance, increased downtime, and increased risk. Extending reactor life to 60 years and beyond will likely increase susceptibility and severity of both known and new forms of degradation. A multitude of concrete-based structures are typically part of a light water reactor plant to provide foundation, support, shielding, and containment functions. The size and complexity of nuclear power plant containment structures and the heterogeneity of Portland cement concrete make characterization of the degradation extent a difficult task. This paper examines the benefits of using time-frequency analysis with Synthetic Aperture Focusing Technique (SAFT). By using wavelet packet decomposition, the original ultrasound signals are decomposed into various frequency bands that facilitates highly selective analysis of the signal’s frequency content and can be visualized using the familiar SAFT image reconstruction algorithm.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗