Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5

Improved algorithms for mapping pipelined and parallel computations

Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm3) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm2) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.

Nicol, David M.↗

A parameter-estimation subroutine package

Estimation subroutine package comprises fast, efficient, and simple least-squares data-processing algorithms for use in orbit determination and related analyses. Very reliable and general algorithms have been documented. Package contains collection of streamlined subroutines that can be used to solve large variety of parameter-estimation and filtering problems. Special routines are included for problems with colored process noise and covariance (factor) mapping.

Bierman, G.↗

Know how to maximize maintenance spending

Solomon has developed a methodology to determine a large optimum point where availability meets maintenance spending for Powder River Basin (PRB) coal-fired units. Using a database of sufficient size and composition across various operating ranges, Solomon generated an algorithm that predicts the relationship between maintenance spending and availability. Coupling this generalized algorithm with a unit-specific market-loss curve determines the optimum spending for a facility. The article presents the results of the analysis, how this methodology can be applied to develop optimum operating and financial targets for specific units and markets and a process to achieve those targets. It also describes how this methodology can be used for other types of fossil-fired technologies and future enhancements to the analysis. 5 figs.

20 FOSSIL-FUELED POWER PLANTS↗

The method of transition boundary for the solution of diffraction problems

A new method, which enables one to solve some diffraction problems, is put forth. The technique is based on a relation between the diffracted and scattered geometric optics waves at the transition boundaries. The concept of initial waves is also used instead of the incident field. The general algorithm of the method is outlined and applied to the diffraction problems of waves by perfect electric conductor half-screen, resistive half-plane and impedance sheet junction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Killing tensors, warped products and the orthogonal separation of the Hamilton-Jacobi equation

We study Killing tensors in the context of warped products and apply the results to the problem of orthogonal separation of the Hamilton-Jacobi equation. This work is motivated primarily by the case of spaces of constant curvature where warped products are abundant. We first characterize Killing tensors which have a natural algebraic decomposition in warped products. We then apply this result to show how one can obtain the Killing-Stäckel space (KS-space) for separable coordinate systems decomposable in warped products. This result in combination with Benenti's theory for constructing the KS-space of certain special separable coordinates can be used to obtain the KS-space for all orthogonal separable coordinates found by Kalnins and Miller in Riemannian spaces of constant curvature. Next we characterize when a natural Hamiltonian is separable in coordinates decomposable in a warped product by showing that the conditions originally given by Benenti can be reduced. Finally, we use this characterization and concircular tensors (a special type of torsionless conformal Killing tensor) to develop a general algorithm to determine when a natural Hamiltonian is separable in a special class of separable coordinates which include all orthogonal separable coordinates in spaces of constant curvature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improvement of Aerosol Optical Depth Retrieval from MODIS Spectral Reflectance over the Global Ocean Using New Aerosol Models Archived from AERONET Inversion Data and Tri-axial Ellipsoidal Dust Database

New over-ocean aerosol models are developed by integrating the inversion data from the Aerosol Robotic Network (AERONET) sun/sky radiometers with a database for the optical properties of tri-axial ellipsoid particles. The new aerosol models allow more accurate retrieval of aerosol optical depth (AOD) from the Moderate Resolution Imaging Spectroradiometer (MODIS) in the case of high AOD (AOD greater than 0.3). The aerosol models are categorized by using the fine-mode fraction (FMF) at 550 nm and the singlescattering albedo (SSA) at 440 nm from the AERONET inversion data to include a variety of aerosol types found around the globe. For each aerosol model, the changes in the aerosol optical properties (AOPs) as functions of AOD are considered to better represent aerosol characteristics. Comparisons of AODs between AERONET and MODIS for the period from 2003 to 2010 show that the use of the new aerosol models enhances the AOD accuracy with a Pearson coefficient of 0.93 and a regression slope of 0.99 compared to 0.92 and 0.85 calculated using the MODIS Collection 5 data. Moreover, the percentage of data within an expected error of +/-(0.03 + 0.05xAOD) is increased from 62 percent to 64 percent for overall data and from 39 percent to 51 percent for AOD greater than 0.3. Errors in the retrieved AOD are further characterized with respect to the Angstrom exponent (AE), scattering angle, SSA, and air mass factor (AMF). Due to more realistic AOPs assumptions, the new algorithm generally reduces systematic errors in the retrieved AODs compared with the current operational algorithm. In particular, the underestimation of fine-dominated AOD and the scattering angle dependence of dust-dominated AOD are significantly mitigated as results of the new algorithm's improved treatment of aerosol size distribution and dust particle nonsphericity.

aerosol optical depth↗

Poster — Thur Eve — 07: Simultaneous reconstruction of both true and scattered coincidences using a Generalized Scatter reconstruction algorithm in PET

Introduction: Scattered coincidences in PET are generally taken as noise, which reduces image contrast and compromises quantification. We have developed a method, with promising results, to reconstruct activity distribution from scattered PET events instead of simply correcting for them. The implementation of this method on clinical PET scanners is however limited by the currently available detector energy resolution. With low energy resolution we lose the ability to distinguish scattered coincidences from true events based on the measured photon energy. In addition the two circular arcs used to confine the source position for a scattered event cannot be accurately defined. Method: This paper presents a modification to this approach which accounts for limited energy resolution. A measured event is split into a true and a scattered component each with different probabilities based on the position of the pair of photon energies in the energy spectrum. For the scattered component, we model the photon energy with a Gaussian distribution and the upper and lower energy limits can be estimated and used to define inner and outer circular arcs to confine the source position. The true and scattered components for each measured event were reconstructed using our Generalized Scatter reconstruction algorithm. Results and Conclusion: The results show that the contrast and noise properties were improved by 6–9% and 2–4% respectively. This demonstrates that the performance of the algorithm is less sensitive to the energy resolution and that incorporating scattered photons into reconstruction brings more benefits than simply rejecting them.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Extracting dynamical frequencies from invariants of motion in finite-dimensional nonlinear integrable systems

Integrable dynamical systems play an important role in many areas of science, including accelerator and plasma physics. An integrable dynamical system with n degrees of freedom possesses n nontrivial integrals of motion, and can be solved, in principle, by covering the phase space with one or more charts in which the dynamics can be described using action-angle coordinates. To obtain the frequencies of motion, both the transformation to action-angle coordinates and its inverse must be known in explicit form. However, no general algorithm exists for constructing this transformation explicitly from a set of n known (and generally coupled) integrals of motion. In this study we describe how one can determine the dynamical frequencies of the motion as functions of these n integrals in the absence of explicitly known action-angle variables, and we provide several examples.

43 PARTICLE ACCELERATORS↗

Dirac matrices for Chern-Simons gravity

A genuine gauge theory for the Poincare, de Sitter or anti-de Sitter algebras can be constructed in (2n- 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices {Gamma}{sub ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices {Gamma}{sub ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient {alpha}{sub s}. We then give a general algorithm that computes the {alpha}-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B{sup ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, 'minimal' algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A General Event Location Algorithm with Applications to Eclispe and Station Line-of-Sight

A general-purpose algorithm for the detection and location of orbital events is developed. The proposed algorithm reduces the problem to a global root-finding problem by mapping events of interest (such as eclipses, station access events, etc.) to continuous, differentiable event functions. A stepping algorithm and a bracketing algorithm are used to detect and locate the roots. Examples of event functions and the stepping/bracketing algorithms are discussed, along with results indicating performance and accuracy in comparison to commercial tools across a variety of trajectories.

Parker, Joel J. K.↗

A General Event Location Algorithm with Applications to Eclipse and Station Line-of-Sight

A general-purpose algorithm for the detection and location of orbital events is developed. The proposed algorithm reduces the problem to a global root-finding problem by mapping events of interest (such as eclipses, station access events, etc.) to continuous, differentiable event functions. A stepping algorithm and a bracketing algorithm are used to detect and locate the roots. Examples of event functions and the stepping/bracketing algorithms are discussed, along with results indicating performance and accuracy in comparison to commercial tools across a variety of trajectories.

Parker, Joel J. K.↗

General CMB and primordial trispectrum estimation

In this paper we present trispectrum estimation methods which can be applied to general nonseparable primordial and CMB trispectra. We review the relationship between the reduced CMB trispectrum and the reduced primordial trispectrum. We present a general optimal estimator for the connected part of the trispectrum, for which we derive a quadratic term to incorporate the effects of inhomogeneous noise and masking. We describe a general algorithm for creating simulated maps with given arbitrary (and independent) power spectra, bispectra, and trispectra. We propose a universal definition of the trispectrum parameter T{sub NL}, so that the integrated trispectrum on the observational domain can be consistently compared between theoretical models. We define a shape function for the primordial trispectrum, together with a shape correlator and a useful parametrization for visualizing the trispectrum; these methods might also be applied to the late-time trispectrum for large-scale structure. We derive separable analytic CMB solutions in the large-angle limit for constant and local models. We present separable mode decompositions which can be used to describe any primordial or CMB trispectra on their respective wave number or multipole domains. By extracting coefficients of these separable basis functions from an observational map, we are able to present an efficient estimator for any given theoretical model with a nonseparable trispectrum. The estimator has two manifestations, comparing the theoretical and observed coefficients at either primordial or late times, thus encompassing a wider range of models, such as secondary anisotropies, lensing, and cosmic strings. We show that these mode decomposition methods are numerically tractable with order l{sup 5} operations for the CMB estimator and approximately order l{sup 6} for the general primordial estimator (reducing to order l{sup 3} in both cases for a special class of models). We also demonstrate how the trispectrum can be reconstructed from observational maps using these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Evaluation of a Flight Deck Interval Management Algorithm Including Delayed Target Trajectories

NASA's first Air Traffic Management (ATM) Technology Demonstration (ATD-1) was created to facilitate the transition of mature air traffic management technologies from the laboratory to operational use. The technologies selected for demonstration are the Traffic Management Advisor with Terminal Metering (TMA-TM), which provides precise timebased scheduling in the terminal airspace; Controller Managed Spacing (CMS), which provides controllers with decision support tools enabling precise schedule conformance; and Interval Management (IM), which consists of flight deck automation that enables aircraft to achieve or maintain precise in-trail spacing. During high demand operations, TMA-TM may produce a schedule and corresponding aircraft trajectories that include delay to ensure that a particular aircraft will be properly spaced from other aircraft at each schedule waypoint. These delayed trajectories are not communicated to the automation onboard the aircraft, forcing the IM aircraft to use the published speeds to estimate the target aircraft's estimated time of arrival. As a result, the aircraft performing IM operations may follow an aircraft whose TMA-TM generated trajectories have substantial speed deviations from the speeds expected by the spacing algorithm. Previous spacing algorithms were not designed to handle this magnitude of uncertainty. A simulation was conducted to examine a modified spacing algorithm with the ability to follow aircraft flying delayed trajectories. The simulation investigated the use of the new spacing algorithm with various delayed speed profiles and wind conditions, as well as several other variables designed to simulate real-life variability. The results and conclusions of this study indicate that the new spacing algorithm generally exhibits good performance; however, some types of target aircraft speed profiles can cause the spacing algorithm to command less than optimal speed control behavior.

Swieringa, Kurt A.↗

Single-shot Quantum Signal Processing Interferometry

Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing at the fundamental limits of quantum mechanics by generalizing Ramsey-type interferometry. Our QSPI sensing protocol relies on performing nonlinear polynomial transformations on the oscillator's quadrature operators by generalizing quantum signal processing (QSP) from qubits to hybrid qubit-oscillator systems. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit. Theoretical analysis suggests the sensing accuracy, given a single-shot qubit measurement, scales inversely with the sensing time or circuit depth of the algorithm. We further concatenate a series of such binary decisions to perform parameter estimation in a bit-by-bit fashion. Numerical simulations are performed to support these statements. Our QSPI protocol offers a unified framework for quantum sensing using continuous-variable bosonic systems beyond parameter estimation and establishes a promising avenue toward efficient and scalable quantum control and quantum sensing schemes beyond the NISQ era.

Physics↗

An intrinsically n-dimensional generalized flux vector splitting implicit finite element Euler algorithm

A generalized flux-vector splitting implicit Galerkin finite-element algorithm for the Euler equations in curvilinear coordinates for ideal and reacting gases is derived. For an arbitrary equation of state, the curvilinear-coordinate flux vector is split in kinematic and kinetic components, and the associated jacobian matrix eigenvalues explicitly depend on the metric data. After directional semidiscretization, the terminal ordinary differential-equation system is solved via a nonlinearly stable implicit Runge-Kutta scheme in concert with an accurate tensor matrix product factorization. The results for selected two-dimensional supersonic and axisymmetric hypersonic flows validate the algorithm and verify its robustness for curvilinear-coordinate computations. The evolution towards a steady state is achieved for large Courant numbers without indication of numerical instabilities.

Iannelli, G. S.↗

Development of activity pencil beam algorithm using measured distribution data of positron emitter nuclei generated by proton irradiation of targets containing {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei in preparation of clinical application

Purpose: The purpose of this study is to develop a new calculation algorithm that is satisfactory in terms of the requirements for both accuracy and calculation time for a simulation of imaging of the proton-irradiated volume in a patient body in clinical proton therapy. Methods: The activity pencil beam algorithm (APB algorithm), which is a new technique to apply the pencil beam algorithm generally used for proton dose calculations in proton therapy to the calculation of activity distributions, was developed as a calculation algorithm of the activity distributions formed by positron emitter nuclei generated from target nuclear fragment reactions. In the APB algorithm, activity distributions are calculated using an activity pencil beam kernel. In addition, the activity pencil beam kernel is constructed using measured activity distributions in the depth direction and calculations in the lateral direction. {sup 12}C, {sup 16}O, and {sup 40}Ca nuclei were determined as the major target nuclei that constitute a human body that are of relevance for calculation of activity distributions. In this study, ''virtual positron emitter nuclei'' was defined as the integral yield of various positron emitter nuclei generated from each target nucleus by target nuclear fragment reactions with irradiated proton beam. Compounds, namely, polyethylene, water (including some gelatin) and calcium oxide, which contain plenty of the target nuclei, were irradiated using a proton beam. In addition, depth activity distributions of virtual positron emitter nuclei generated in each compound from target nuclear fragment reactions were measured using a beam ON-LINE PET system mounted a rotating gantry port (BOLPs-RGp). The measured activity distributions depend on depth or, in other words, energy. The irradiated proton beam energies were 138, 179, and 223 MeV, and measurement time was about 5 h until the measured activity reached the background level. Furthermore, the activity pencil beam data were made using the activity pencil beam kernel, which was composed of the measured depth data and the lateral data including multiple Coulomb scattering approximated by the Gaussian function, and were used for calculating activity distributions. Results: The data of measured depth activity distributions for every target nucleus by proton beam energy were obtained using BOLPs-RGp. The form of the depth activity distribution was verified, and the data were made in consideration of the time-dependent change of the form. Time dependence of an activity distribution form could be represented by two half-lives. Gaussian form of the lateral distribution of the activity pencil beam kernel was decided by the effect of multiple Coulomb scattering. Thus, the data of activity pencil beam involving time dependence could be obtained in this study. Conclusions: The simulation of imaging of the proton-irradiated volume in a patient body using target nuclear fragment reactions was feasible with the developed APB algorithm taking time dependence into account. With the use of the APB algorithm, it was suggested that a system of simulation of activity distributions that has levels of both accuracy and calculation time appropriate for clinical use can be constructed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem

This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.

Ward, R. C.↗