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 595 records · Page 33

Numerical solution of the Navier-Stokes equations for arbitrary blunt bodies in supersonic flows

A time-dependent, two-dimensional Navier-Stokes code employing the body-fitted coordinate technique has been developed for supersonic flows past blunt bodies of arbitrary shape. The computer program is based on the finite-difference approximation of the compressible Navier-Stokes equations transformed to nonorthogonal curvilinear coordinates with the contravariant components of the velocity vector as dependent variables. The bow shock ahead of the body is obtained as part of the solution, by 'shock capturing'. Numerical solutions of the complete equations are presented in detail for free-stream Mach number 4.6, Reynolds number 10,000, and an isothermal wall temperature of 556 K for a circular cylinder with the free-stream outer boundaries forming a hyperbola in the front and a circular arc in the back.

Warsi, Z. U. A.↗

Visualization software for a global three-dimensional upper atmosphere model

A software environment has been developed to assist in analysis and visualization of numerical outputs from NCAR's thermospheric general circulation models. The codes produce vector graphics, raster imagery, and time dependent animation of model results, with provision for comparison with empirical models and relevant data from satellite and ground based instruments. Separate programs are executed on the NCAR CRAY YMP8/864 and HAO divisional Sun workstations, providing both large volume highspeed batch and custom interactive computing environments. The visualization system assembles a suite of existing software packages including NCAR Graphics, IDL, netCDF, and the Xt intrinsics library with the Athena widget set.

Foster, Benjamin T.↗

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

traffic complexity↗

Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system

We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development and Test of a 1,000 Level 3C Fiber Optic Borehole Seismic Receiver Array Applied to Carbon Sequestration

To address the critical site characterization and monitoring needs for CCS programs, US Department of Energy (DOE) awarded Paulsson, Inc. in 2010 a contract to design, build and test a fiber optic based ultra-large bandwidth clamped borehole seismic vector array capable of deploying up to one thousand 3C sensor pods suitable for deployment into high temperature and high pressure boreholes. Paulsson, Inc. has completed a design or a unique borehole seismic system consisting of a novel drill pipe based deployment system that includes a hydraulic clamping mechanism for the sensor pods, a new sensor pod design and most important – a unique fiber optic seismic vector sensor with technical specifications and capabilities that far exceed the state of the art seismic sensor technologies. These novel technologies were all applied to the new borehole seismic system. In combination these technologies will allow for the deployment of up to 1,000 3C sensor pods in vertical, deviated or horizontal wells. Laboratory tests of the fiber optic seismic vector sensors developed during this project have shown that the new borehole seismic sensor technology is capable of generating outstanding high vector fidelity data with extremely large bandwidth: 0.01 – 6,000 Hz. Field tests have shown that the system can record events at magnitudes much smaller than M-2.3 at frequencies up to 2,000 Hz. The sensors have also proved to be about 100 times more sensitive than the regular coil geophones that are used in borehole seismic systems today. The fiber optic seismic sensors have furthermore been qualified to operate at temperatures over 300°C (572°F). The fibers used for the seismic sensors in the system are used to record Distributed Temperature Sensor (DTS) data allowing additional value added data to be recorded simultaneously with the seismic vector sensor data.

01 COAL, LIGNITE, AND PEAT↗

VTK-m User's Guide (V.1.6)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures.

97 MATHEMATICS AND COMPUTING↗

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.1.9)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.2.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

Piperitone ( p -Menth-1-En-3-One): A New Repellent for Tea Shot Hole Borer (Coleoptera: Curculionidae) in Florida Avocado Groves

The tea shot hole borer, Euwallacea perbrevis, has been recently established in Florida, USA, where it vectors fungal pathogens that cause Fusarium dieback in avocado. Pest monitoring uses a two-component lure containing quercivorol and α-copaene. Incorporation of a repellent into IPM programs may reduce the incidence of dieback in avocado groves, particularly if combined with lures in a push–pull system. This study evaluated piperitone and α-farnesene as potential repellents for E. perbrevis, comparing their efficacy to that of verbenone. Replicate 12-week field tests were conducted in commercial avocado groves. Each test compared beetle captures in traps baited with two-component lures versus captures in traps containing lures plus repellent. To complement field trials, Super-Q collections followed by GC analyses were performed to quantify emissions from repellent dispensers field-aged for 12 weeks. Electroantennography (EAG) was also used to measure beetle olfactory response to each repellent. Results indicated that α-farnesene was ineffective; however, piperitone and verbenone were comparable in repellency, achieving 50–70% reduction in captures, with longevity of 10–12 weeks. EAG responses to piperitone and verbenone were equivalent, and significantly greater than response to α-farnesene. Since piperitone is less expensive than verbenone, this study identifies a potential new E. perbrevis repellent.

59 BASIC BIOLOGICAL SCIENCES↗

Performance characteristics of a wedge nozzle installed on an F-18 propulsion wind tunnel model

The results of two-dimensional wedge non-axisymmetric nozzle (2D-AIN) tests to determine its performance relative to the baseline axisymmetric nozzle using an F-18 jet effects wind tunnel model are presented. Configurations and test conditions simulated forward thrust-minus drag, thrust vectoring/induced lift, and thrust reversing flight conditions from Mach .6 to 1.20 and attack angles up to 10 degrees. Results of the model test program indicate that non-axisymmetric nozzles can be installed on a twin engine fighter aircraft model with equivalent thrust minus drag performance as the baseline axisymmetric nozzles. Thrust vectoring capability of the non-axisymmetric nozzles provided significant jet-induced lift on the nozzle/aftbody and horizontal tail surfaces. Thrust reversing panels deployed from the 2D-AIN centerbody wedge were very effective for static and inflight operation

Petit, J. E.↗

A fast radiation parameterization for atmospheric circulation models

Several currently available broadband parameterizations for longwave and shortwave radiation have been combined to produce a computationally fast radiation parameterization that is well suited for atmospheric circulation models. The main features of the parameterization are the ability to include overlapping partly cloudy layers in the longwave, the use of a delta-Eddington technique to treat clouds in the shortwave, and a computational structure that is amenable to vectorization on supercomputers. Selected results of off-line one-dimensional computations using the code have been compared with more rigorous methods as part of an international intercomparison program and found to be quite accurate.

HARSHVARDHAN↗

Reduction of solar vector magnetograph data using a microMSP array processor

The processing of raw data obtained by the solar vector magnetograph at NASA-Marshall requires extensive arithmetic operations on large arrays of real numbers. The objectives of this summer faculty fellowship study are to: (1) learn the programming language of the MicroMSP Array Processor and adapt some existing data reduction routines to exploit its capabilities; and (2) identify other applications and/or existing programs which lend themselves to array processor utilization which can be developed by undergraduate student programmers under the provisions of project JOVE.

Kineke, Jack↗

Improved visualization of flow field measurements

A capability was developed that makes it possible to apply to measured flow field data the visualization tools developed to display numerical solutions for computational fluid dynamic problems. The measurement monitor surface (MMS) procedure was applied to the analysis of flow field measurements within a low aspect ratio transonic axial flow fan rotor obtained with 2-D laser anemometry. The procedure generates input for the visualization tools developed to display numerical solutions for computational fluid dynamics problems. The relative Mach number contour plots obtained by this method resemble the conventional contour plots obtained by more traditional methods. The results show that the MMS procedure can be used to generate input for the multidimensional processing and analysis tools developed for data from numerical flow field simulations. They show that an experimenter can apply the MMS procedure to his data and then use an interactive graphics program to display scalar quantities like the Mach number by profiles, carpet plots, contour lines, and surfaces using various colors. Also, flow directionality can be shown by display of vector fields and particle traces.

Miles, Jeffrey Hilton↗

LDEF data: Comparisons with existing models

The relationship between the observed cratering impact damage on the Long Duration Exposure Facility (LDEF) versus the existing models for both the natural environment of micrometeoroids and the man-made debris was investigated. Experimental data was provided by several LDEF Principal Investigators, Meteoroid and Debris Special Investigation Group (M&D SIG) members, and by the Kennedy Space Center Analysis Team (KSC A-Team) members. These data were collected from various aluminum materials around the LDEF satellite. A PC (personal computer) computer program, SPENV, was written which incorporates the existing models of the Low Earth Orbit (LEO) environment. This program calculates the expected number of impacts per unit area as functions of altitude, orbital inclination, time in orbit, and direction of the spacecraft surface relative to the velocity vector, for both micrometeoroids and man-made debris. Since both particle models are couched in terms of impact fluxes versus impactor particle size, and much of the LDEF data is in the form of crater production rates, scaling laws have been used to relate the two. Also many hydrodynamic impact computer simulations were conducted, using CTH, of various impact events, that identified certain modes of response, including simple metallic target cratering, perforations and delamination effects of coatings.

Coombs, Cassandra R.↗