Search NASA⌕ Search

SEARCH · Search NASA

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 559 records · Page 31

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Three Dimensional Characterization of Defects by Ultrasonic Time-of-Flight Diffraction (ToFD) Technique

Ultrasonic time-of-flight diffraction (ToFD) technique has high accuracy in locating and sizing discontinuities. The primary reason for this accuracy is the use of time instead of amplitude for measurement of the depth and size of discontinuities. Despite the many advantages of ToFD, it suffers from a number of shortcomings, the most notable one being its two-dimensional character. The goal of this paper is to develop an algorithm, as a prerequisite, to extend ToFD measurements to a three-dimensional space. For this purpose, a combination of multiple transmitting and receiving probes is proposed instead of just one pair commonly used in ToFD measurements. The approach for locating and sizing defects in a 3D space follows the methods used in radar and acoustic positioning systems. Non-iterative techniques are used for positioning a single source (defect) based on signals collected by several transducers. The estimation formula, in the form of a closed-form solution, is derived by linear least-squares minimization. In addition to existing conventional passive algorithms, a new active algorithm is also proposed for the general arrangement of transducers. This algorithm is tested on a steel specimen having an artificially implanted discontinuity and the three-dimensional location of the defect is estimated.

42 ENGINEERING↗

Solving PDEs in Irregular Geometries with Multiresolution Methods I: Embedded Dirichlet Boundary Conditions

In this work, we develop and analyze a formalism for solving boundary value problems in arbitrarily-shaped domains using the MADNESS (multiresolution adaptive numerical environment for scientific simulation) package for adaptive computation with multiresolution algorithms. We begin by implementing a previously-reported diffuse domain approximation for embedding the domain of interest into a larger domain (Li et al., 2009 [1]). Numerical and analytical tests both demonstrate that this approximation yields non-physical solutions with zero first and second derivatives at the boundary. This excessive smoothness leads to large numerical cancellation and confounds the dynamically-adaptive, multiresolution algorithms inside MADNESS. We thus generalize the diffuse domain approximation, producing a formalism that demonstrates first-order convergence in both near- and far-field errors. We finally apply our formalism to an electrostatics problem from nanoscience with characteristic length scales ranging from 0.0001 to 300 nm.

99 GENERAL AND MISCELLANEOUS↗

Exact Reconstruction From Uniformly Attenuated Helical Cone-Beam Projections in SPECT

In recent years the development of cone-beam reconstruction algorithms has been an active research area in x-ray computed tomography (CT), and significant progress has been made in the advancement of algorithms. Theoretically exact and computationally efficient analytical algorithms can be found in the literature. However, in single photon emission computed tomography (SPECT), published cone-beam reconstruction algorithms are either approximate or involve iterative methods. The SPECT reconstruction problem is more complicated due to degradations in the imaging detection process, one of which is the effect of attenuation of gamma ray photons. Attenuation should be compensated for to obtain quantitative results. In this paper, an analytical reconstruction algorithm for uniformly attenuated cone-beam projection data is presented for SPECT imaging. The algorithm adopts the DBH method, a procedure consisting of differentiation and backprojection followed by a finite inverse cosh-weighted Hilbert transform. The significance of the proposed approach is that a selected region of interest can be reconstructed even with a detector with a reduced field of view. The algorithm is designed for a general trajectory. However, to validate the algorithm, a numerical study was performed using a helical trajectory. The implementation is efficient and the simulation result is promising.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Algebraic Algorithms for Betweenness and Percolation Centrality

Abstract In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes' algorithm. We aimed for algebraic betweenness centrality that can be parallelized easily. We proposed 3-tuple geodetic semiring as an extension to the usual geodetic semiring with 2-tuples. Using the 3-tuple geodetic semiring, Dijkstra's and Brandes' algorithm, we wrote more concise and general algebraic betweenness centrality (ABC) algorithm which is valid for weighted and directed graphs. We also proposed an alternative version of ABC using the usual geodetic semiring with 2-tuple where we used a simple way to construct shortest path tree after computing shortest path distances in the usual geodetic semiring. This allows us to avoid computational complexity of ABC implementation using 3-tuple geodetic semiring. We used numba to optimize and parallelize ABC. We evaluated the performance of ABC using 2-tuple geodetic semiring as compared to NetworkX, a common python package for graph algorithms. We did scalability experiments on parallel ABC and showed its total speedup. We also showed that with small modification, ABC can be adapted to algebraicly compute other centrality measures such as percolation centrality.

97 MATHEMATICS AND COMPUTING↗

Three-dimensional viscous-flow computations using a directionally hybrid implicit-explicit procedure

A new, directionally dependent, hybrid numerical algorithm for solving the unsteady, three-dimensional Navier-Stokes equations has been developed and used to compute the viscous supersonic flow over complex configurations, which may generate local regions of embedded subsonic or streamwise separated flows or both. The new hybrid implicit-explicit algorithm is derived from the more general implicit Beam-Warming algorithm and is particularly suitable for viscous computations in which the grid spacing in the direction outward from the body is considerably smaller than the spacing in the other two directions. Numerical results obtained from both the hybrid and implicit schemes are presented and compared on the basis of numerical stability, convergence history, and computer and core memory requirements.

Rizk, Y. M.↗

A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

Impact of Non-Uniform Beam Filling on Spaceborne Cloud and Precipitation Radar Retrieval Algorithms

In this presentation we will discuss the performance of classification and retrieval algorithms for spaceborne cloud and precipitation radars such as the Global Precipitation Measurement mission Dual-frequency Precipitation Radar (GPM/DPR), and notional radar for the Aerosol/Clouds/Ecosystem (ACE) mission and related concepts. Spaceborne radar measurements are simulated either from Airborne Precipitation Radar 2nd Generation observations, or from atmospheric model outputs via instrument simulators contained in the NASA Earth Observing Systems Simulators Suite (NEOS(sup 3)). Both methods account for the three dimensional nature of the scattering field at resolutions smaller than that of the spaceborne radar under consideration. We will focus on the impact of non-homogeneities of the field of hydrometeors within the beam. We will discuss also the performance of methods to identify and mitigate such conditions, and the resulting improvements in retrieval accuracy. The classification and retrieval algorithms analyzed in this study are those derived from APR-2's Suite of Processing and Retrieval Algorithms (ASPRA); here generalized to operate on an arbitrary set of radar configuration parameters to study the expected performance of spaceborne cloud and precipitation radars. The presentation will highlight which findings extend to other algorithm families and which ones do not.

Aerosol/Clouds/Ecosystem (ACE)↗

Coordinated Planning Strategy for Integrated Energy Systems in a District Energy Sector

With the ever-growing integration of diverse distributed energy resources, modern district energy sectors are transitioning into integrated energy systems (IESs), which generally consist of various energy carriers such as electric power, natural gas, and heat. Instead of modeling individual energy carriers, the emergence of IESs requires comprehensive consideration of all involved energy systems in both planning and operation phases. This paper proposes a comprehensive planning strategy for a district energy sector to address the challenges of IES planning considering the coupling of power, gas, and heat systems. The proposed planning model contains an operational module that develops a steady-state optimal multi-energy flow (OMEF) for the IES considered and a multi-stage expansion module that optimizes the investment decisions. To efficiently solve the proposed planning model, which is formulated as a mixed-integer nonlinear programming problem, an improved generalized Benders decomposition algorithm that utilizes dynamic dual multipliers to improve the convergence speed is employed. The effectiveness of the proposed planning model and the feasibility of the improved Benders decomposition algorithm are verified in case studies.

coordinated planning↗

A biconjugate gradient type algorithm on massively parallel architectures

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.

Freund, Roland W.↗

Multishaker modal testing

A component mode synthesis method for damped structures was developed and modal test methods were explored which could be employed to determine the relevant parameters required by the component mode synthesis method. Research was conducted on the following topics: (1) Development of a generalized time-domain component mode synthesis technique for damped systems; (2) Development of a frequency-domain component mode synthesis method for damped systems; and (3) Development of a system identification algorithm applicable to general damped systems. Abstracts are presented of the major publications which have been previously issued on these topics.

Craig, R. R., Jr.↗

Quasi-static solution algorithms for kinematically/materially nonlinear thermomechanical problems

This paper develops an algorithmic solution strategy which allows the handling of positive/indefinite stiffness characteristics associated with the pre- and post-buckling of structures subject to complex thermomechanical loading fields. The flexibility of the procedure is such that it can be applied to both finite difference and element-type simulations. Due to the generality of the algorithmic approach developed, both kinematic and thermal/mechanical type material nonlinearity including inelastic effects can be treated. This includes the possibility of handling completely general thermomechanical boundary conditions. To demonstrate the scheme, the results of several benchmark problems is presented.

Padovan, J.↗

Simplified Syndrome Decoding of (n, 1) Convolutional Codes

A new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.

I. S. Reed↗

An assessment of 'shuffle algorithm' collision mechanics for particle simulations

Among the algorithms for collision mechanics used at present, the 'shuffle algorithm' of Baganoff (McDonald and Baganoff, 1988; Baganoff and McDonald, 1990) not only allows efficient vectorization, but also discretizes the possible outcomes of a collision. To assess the applicability of the shuffle algorithm, a simulation was performed of flows in monoatomic gases and the calculated characteristics of shock waves was compared with those obtained using a commonly employed isotropic scattering law. It is shown that, in general, the shuffle algorithm adequately represents the collision mechanics in cases when the goal of calculations are mean profiles of density and temperature.

Feiereisen, William J.↗

Orthogonal series generalized likelihood ratio test for failure detection and isolation

A new failure detection and isolation algorithm for linear dynamic systems is presented. This algorithm, the Orthogonal Series Generalized Likelihood Ratio (OSGLR) test, is based on the assumption that the failure modes of interest can be represented by truncated series expansions. This assumption leads to a failure detection algorithm with several desirable properties. Computer simulation results are presented for the detection of the failures of actuators and sensors of a C-130 aircraft. The results show that the OSGLR test generally performs as well as the GLR test in terms of time to detect a failure and is more robust to failure mode uncertainty. However, the OSGLR test is also somewhat more sensitive to modeling errors than the GLR test.

Hall, Steven R.↗

Time-Domain Simulation of RF Couplers

We have developed a finite-difference time-domain (FDTD) fluid-like approach to integrated plasma-and-coupler simulation [1], and show how it can be used to model LH and ICRF couplers in the MST and larger tokamaks.[2] This approach permits very accurate 3-D representation of coupler geometry, and easily includes non-axi-symmetry in vessel wall, magnetic equilibrium, and plasma density. The plasma is integrated with the FDTD Maxwell solver in an implicit solve that steps over electron time-scales, and permits tenuous plasma in the coupler itself, without any need to distinguish or interface between different regions of vacuum and/or plasma. The FDTD algorithm is also generalized to incorporate a time-domain sheath potential [3] on metal structures within the simulation, to look for situations where the sheath potential might generate local sputtering opportunities. Benchmarking of the time-domain sheath algorithm has been reported in the references. Finally, the time-domain software [4] permits the use of particles, either as field diagnostic (test particles) or to self-consistently compute plasma current from the applied RF power.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗