Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector programs”

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 253 records · Page 14

Development of a unified guidance system for geocentric transfer

A method is presented for open loop guidance of a solar electric propulsion spacecraft to geosynchronous orbit. The method consists of determining the thrust vector profiles on the ground with an optimization computer program, and performing updates based on the difference between the actual trajectory and that predicted with a precision simulation computer program. The motivation for performing the guidance analysis during the mission planning phase is discussed, and a spacecraft design option that employs attitude orientation constraints is presented. The improvements required in both the optimization program and simulation program are set forth, together with the efforts to integrate the programs into the ground support software for the guidance system.

Cake, J. E.↗

STAR adaptation of QR algorithm

The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.

Shah, S. N.↗

Spatial data software integration - Merging CAD/CAM/mapping with GIS and image processing

The integration of CAD/CAM/mapping with image processing using geographic information systems (GISs) as the interface is examined. Particular emphasis is given to the development of software interfaces between JPL's Video Image Communication and Retrieval (VICAR)/Imaged Based Information System (IBIS) raster-based GIS and the CAD/CAM/mapping system. The design and functions of the VICAR and IBIS are described. Vector data capture and editing are studied. Various software programs for interfacing between the VICAR/IBIS and CAD/CAM/mapping are presented and analyzed.

Logan, Thomas L.↗

Use of ILTV Control Laws for LaNCETS Flight Research

A report discusses the Lift and Nozzle Change Effects on Tail Shock (LaNCETS) test to investigate the effects of lift distribution and nozzle-area ratio changes on tail shock strength of an F-15 aircraft. Specific research objectives are to obtain inflight shock strength for multiple combinations of nozzle-area ratio and lift distribution; compare results with preflight prediction tools; and update predictive tools with flight results. The objectives from a stability and control perspective are to ensure adequate aircraft stability for the changes in lift distribution and plume shape, and ensure manageable transient from engaging and disengaging the ILTV research control laws. In order to change the lift distribution and plume shape of the F-15 aircraft, a decade-old Inner Loop Thrust Vectoring (ILTV) research control law was used. Flight envelope expansion was performed for the test configuration and flight conditions prior to the probing test points. The approach for achieving the research objectives was to utilize the unique capabilities of NASA's NF-15B-837 aircraft to allow the adjustment of the nozzle-area ratio and/or canard positions by engaging the ILTV research control laws. The ILTV control laws provide the ability to add trim command biases to canard positions, nozzle area ratios, and thrust vectoring through the use of datasets. Datasets consist of programmed test inputs (PTIs) that define trims to change the nozzle-area ratio and/or canard positions. The trims are applied as increments to the normally commanded positions. A LaNCETS non-linear, six-degrees-of-freedom simulation capable of realtime pilot-in-the-loop, hardware-in-the-loop, and non-real-time batch support was developed and validated. Prior to first flight, extensive simulation analyses were performed to show adequate stability margins with the changes in lift distribution and plume shape. Additionally, engagement/disengagement transient analysis was also performed to show manageable transients.

Moua, Cheng↗

Optical Communication Link Atmospheric Attenuation Model

The Space Communications and Navigation (SCaN) Center for Networking, Integration, and Communications (SCENIC) user interface, which provides web accessible space mission simulation and communication system analysis capabilities using verified and validated analysis algorithms, can execute analyses including, but not limited to, line-of-sight, orbit propagation, and dynamic link budget calculations between sets of missions and/or assets. SCENIC's purpose is to provide NASA civil servants and contractors a user-friendly tool, integrated with model data, that can simulate and analyze a range of space mission architectures without the need for repeated and redundant modeling. Given the abundance and further future development of free space optical (FSO) communication channels within modern space infrastructure, the availability of a reliable optical link analysis capability is crucial for SCENIC users. The efforts outlined in this paper aim to provide a model for atmospheric attenuation of FSO communication links, both due to absorption/scattering and turbulence, to increase the accuracy of SCENIC's optical link assessment capabilities. A previous model existed for optical absorption/scattering within the SCaN Link Budget Tool, but it was not location specific for the Earth ground-based nodes, nor was the model optimized for run-time. The new model utilizes years of National Oceanic and Atmospheric Administration (NOAA) visibility data from ground station locations around the world. Visibility, along with the wavelength of the optical signal, are input parameters to calculate the optical specific attenuation, which is a parameter in the calculation of the slant-path attenuation. A final FSO atmospheric attenuation value is comprised of the absorption/scattering attenuation and the turbulence attenuation. A run-time efficient algorithm for the model was then developed and programmed in MATLAB ® . Due to the simple model and vectorization possible in MATLAB, the algorithm has an average run-time of less than one fourth of the run-time of the previous implementation.

Jack L Green↗

Boson–Boson Interactions at the LHC

Vector boson scattering is a key production process to probe the electroweak symmetry breaking of the Standard Model and is one of the most important topics of the physics program for the HL-LHC since it involves both self-couplings of vector bosons and their coupling with the Higgs boson. If the Higgs mechanism is not the sole source of electroweak symmetry breaking, the scattering amplitude deviates from the Standard Model prediction at high scattering energy. Moreover, deviations may be detectable even if a New Physics scale is higher than the reach of direct searches. In this review, the most recent experimental measurements of the production cross sections of vector boson pairs in association with two jets in proton–proton collisions at $\sqrt{s}$ = 13 TeV at the LHC are reported, using data sets recorded by the ATLAS and CMS detectors. Applications to searches for New Physics, as well as prospects for measuring the electroweak vector boson scattering processes with larger data samples, are also summarized.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimizing fusion PIC code performance at scale on Cori Phase 2

In this paper we present the results of optimizing the performance of the gyrokinetic full-f fusion PIC code XGC1 on the Cori Phase Two Knights Landing system. The code has undergone substantial development to enable the use of vector instructions in its most expensive kernels within the NERSC Exascale Science Applications Program. We study the single-node performance of the code on an absolute scale using the roofline methodology to guide optimization efforts. We have obtained 2x speedups in single node performance due to enabling vectorization and performing memory layout optimizations. On multiple nodes, the code is shown to scale well up to 4000 nodes, near half the size of the machine. We discuss some communication bottlenecks that were identified and resolved during the work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Oceanographic and meteorological research based on the data products of SEASAT

De-aliased SEASAT SASS vector winds obtained during the GOASEX (Gulf of Alaska SEASAT Experiment) program were processed to obtain superobservations centered on a one degree by one degree grid. The results provide values for the combined effects of mesoscale variability and communication noise on the individual SASS winds. Each grid point of the synoptic field provides the mean synoptic east-west and north-south wind components plus estimates of the standard deviations of these means. These superobservations winds are then processed further to obtain synoptic scale vector winds stress fiels, the horizontal divergence of the wind, the curl of the wind stress and the vertical velocity at 200 m above the sea surface, each with appropriate standard deviations for each grid point value. The resulting fields appear to be consistant over large distances and to agree with, for example, geostationary cloud images obtained concurrently. Their quality is far superior to that of analyses based on conventional data.

Pierson, W. J.↗

Vectors of Efficiency in Hybrid Poplar Genotype Testing

Abstract The Natural Resources Research Institute Hybrid Poplar Program breeds and tests genetically improved clones for bio-mass production and environmental services. The testing process progresses from Nursery Progeny Tests (NPT) to Family Field Trials (FFT) to Clone Trials (CT) to Yield Blocks (YB), with limited replication of many clones in FFT and CT and a limited number of highly selected clones set out in monoclonal blocks (YB) to approximate the conditions of commercial plantations. We used correlation vectors, R 2 (coefficient of determination) and r s (Spearman’s Coefficient) for growth (DBH 2 ) and McFadden’s Pseudo R 2 for canker severity score, to determine where testing times could be altered (age – age correlations) and whole testing steps eliminated. FFT can be shortened from 5 years to 4 years. In CT, rank correlations between age 5 (half-rotation) and age 9/10 (full rotation) were significant (R 2 = 0.39 – 0.72), but age 5 selection missed 44 % of the top ten clones at age 9/10. Clone rank in CT at full, but not half, rotation was correlated with rank at full rotation in YB. Choosing clones at 9 years in CT adds 4 years but allows possible elimination of YB for clone selection. Both FFT and CT are necessary. Canker abundance and severity in CT at full rotation cannot be determined at earlier ages. An aggressive strategy saves 6 years of testing.

Forestry↗

Performance of an Astrophysical Radiation Hydrodynamics Code under Scalable Vector Extension Optimization

We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.

79 ASTRONOMY AND ASTROPHYSICS↗

High Performance Programming Using Explicit Shared Memory Model on Cray T3D1

The Cray T3D system is the first-phase system in Cray Research, Inc.'s (CRI) three-phase massively parallel processing (MPP) program. This system features a heterogeneous architecture that closely couples DEC's Alpha microprocessors and CRI's parallel-vector technology, i.e., the Cray Y-MP and Cray C90. An overview of the Cray T3D hardware and available programming models is presented. Under Cray Research adaptive Fortran (CRAFT) model four programming methods (data parallel, work sharing, message-passing using PVM, and explicit shared memory model) are available to the users. However, at this time data parallel and work sharing programming models are not available to the user community. The differences between standard PVM and CRI's PVM are highlighted with performance measurements such as latencies and communication bandwidths. We have found that the performance of neither standard PVM nor CRI s PVM exploits the hardware capabilities of the T3D. The reasons for the bad performance of PVM as a native message-passing library are presented. This is illustrated by the performance of NAS Parallel Benchmarks (NPB) programmed in explicit shared memory model on Cray T3D. In general, the performance of standard PVM is about 4 to 5 times less than obtained by using explicit shared memory model. This degradation in performance is also seen on CM-5 where the performance of applications using native message-passing library CMMD on CM-5 is also about 4 to 5 times less than using data parallel methods. The issues involved (such as barriers, synchronization, invalidating data cache, aligning data cache etc.) while programming in explicit shared memory model are discussed. Comparative performance of NPB using explicit shared memory programming model on the Cray T3D and other highly parallel systems such as the TMC CM-5, Intel Paragon, Cray C90, IBM-SP1, etc. is presented.

Simon, Horst D.↗

Unsteady turbomachinery flow simulations on massively parallel architectures

The accurate numerical simulation of unsteady, three-dimensional viscous flow in turbomachines is computationally very intensive, requiring prohibitively large amounts of computer time on current vector supercomputers. In recent years, computer systems based on massively parallel architectures have been developed that offer the promise of meeting the computational power requirements of such large-scale simulations. However, a rethinking of existing algorithms and methodology is required in order to fully harness the computational power of such architectures. In this paper the capabilities of the Connection Machine (CM-2) in predicting unsteady flows in turbomachines are evaluated. The implementation on the CM-2 of an implicit, time-accurate, zonal algorithm for the Navier-Stokes equations in two dimensions is described. Programming issues and modifications made to the original algorithm (developed for vector, pipelined supercomputers) in order to improve performance on the CM-2 are outlined. Algorithm performance is evaluated and compared with a functionally equivalent code for the CRAY-YMP.

Madavan, N. K.↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

Automatic recognition of vector and parallel operations in a higher level language

A compiler for recognizing statements of a FORTRAN program which are suited for fast execution on a parallel or pipeline machine such as Illiac-4, Star or ASC is described. The technique employs interval analysis to provide flow information to the vector/parallel recognizer. Where profitable the compiler changes scalar variables to subscripted variables. The output of the compiler is an extension to FORTRAN which shows parallel and vector operations explicitly.

Schneck, P. B.↗

The Navier-Stokes computer

The Navier-Stokes computer (NSC) has been developed for solving problems in fluid mechanics involving complex flow simulations that require more speed and capacity than provided by current and proposed Class VI supercomputers. The machine is a parallel processing supercomputer with several new architectural elements which can be programmed to address a wide range of problems meeting the following criteria: (1) the problem is numerically intensive, and (2) the code makes use of long vectors. A simulation of two-dimensional nonsteady viscous flows is presented to illustrate the architecture, programming, and some of the capabilities of the NSC.

Nosenchuck, D. M.↗

AN INTEGRATED BIOLOGICAL CONTROL SYSTEM AT HANFORD

In 1999 an integrated biological control system was instituted at the U.S. Department of Energy's Hanford Site. Successes and changes to the program needed to be communicated to a large and diverse mix of organizations and individuals. Efforts at communication are directed toward the following: Hanford Contractors (Liquid or Tank Waste, Solid Waste, Environmental Restoration, Science and Technology, Site Infrastructure), General Hanford Employees, and Hanford Advisory Board (Native American Tribes, Environmental Groups, Local Citizens, Washington State and Oregon State regulatory agencies). Communication was done through direct interface meetings, individual communication, where appropriate, and broadly sharing program reports. The objectives of the communication efforts was to have the program well coordinated with Hanford contractors, and to have the program understood well enough that all stakeholders would have confidence in the work performed by the program to reduce or elimated spread of radioactive contamination by biotic vectors. Communication of successes and changes to an integrated biological control system instituted in 1999 at the Department of Energy's Hanford Site have required regular interfaces with not only a diverse group of Hanford contractors (i.e., those responsible for liquid or tank waste, solid wastes, environmental restoration, science and technology, and site infrastructure), and general Hanford employees, but also with a consortium of designated stake holders organized as the Hanford Advisory Board (i.e., Native American tribes, various environmental groups, local citizens, Washington state and Oregon regulatory agencies, etc.). Direct interface meetings, individual communication where appropriate, and transparency of the biological control program were the methods and outcome of this effort.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Given $\mathrm{X}\subset\mathbb{R}^n, ε \in (0,1)$, a parametrized family of probability distributions $(μ_a)_{a\in \mathrm{A}}$ on $\mathrm{Ω}\subset \mathbb{R}^p$, we consider the feasible set $\mathrm{X}^*_ε \subset\mathrm{X}$ associated with the distributionally robust chance-constraint $\mathrm{X}^*_ε = \mathrm{x \in X : Prob}_μ[f(\mathrm{x}, ω) >0] > 1 - ε, \forall μ \in \mathscr{M}_{\mathrm{a}}$}, where $\mathscr{M}_{\mathrm{a}}$ is the set of all possibles mixtures of distributions $μ_{\mathrm{a}}, \mathrm{a \in A}$. For instance and typically, the family $\mathscr{M}_{\mathrm{a}}$ is the set of all mixtures of Gaussian distributions on $\mathbb{R}$ with mean and standard deviation $\mathrm{a}=(a,σ)$ in some compact set $\mathrm{A}\subset \mathbb{R}^2$. We provide a sequence of inner approximations $\mathrm{X}^d_ε = {\mathrm{x \in X} : w_d(\mathrm{x}) < ε}, d \in \mathbb{N}$, where $w_d$ is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that $λ(\mathrm{X}^*_ε$\$\mathrm{X}^d_ε$) → 0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. Finally, there is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.

97 MATHEMATICS AND COMPUTING↗

Topological Link Models of Multipartite Entanglement

We introduce a novel model of multipartite entanglement based on topological links, generalizing the graph/hypergraph entropy cone program. We demonstrate that there exist link representations of entropy vectors which provably cannot be represented by graphs or hypergraphs. Furthermore, we show that the contraction map proof method generalizes to the topological setting, though now requiring oracular solutions to well-known but difficult problems in knot theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗