Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 811 records · Page 45

A computer-aided regulator design.

A unified computer-aided method for the design of linear and nonlinear regulators is discussed. The general mathematical programming approach considered involves the determination of a vector that solves the problem of minimizing the objective function subject to constraints. Classical design problems stated are related to stability design, dominant mode design, and comprehensive design. A computer algorithm is also developed.

Karmarkar, J. S.↗

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗

Flexible body stability analysis of Space Shuttle ascent flight control system by using lambda matrix solution techniques

A lambda matrix solution technique is being developed to perform an open loop frequency analysis of a high order dynamic system. The procedure evaluates the right and left latent vectors corresponding to the respective latent roots. The latent vectors are used to evaluate the partial fraction expansion formulation required to compute the flexible body open loop feedback gains for the Space Shuttle Digital Ascent Flight Control System. The algorithm is in the final stages of development and will be used to insure that the feedback gains meet the design specification.

Bown, R. L.↗

First Scientific Working Group Meeting of Airborne Doppler Lidar Wind Velocity Measurement Program, appendix C

The problem is to operate on two scalar fields to produce a vector field, to produce user products from the vector field, and to establish reliability of results. Data problems encountered include sparse measurements, irregular distribution, varying quality, imperfect orthogonality, aliasing due to sampling volume, and measurements not simultaneous. Desired algorithm characteristics, solution elements, and characteristics of the model are listed. The seven simulation elements, eight algorithm steps and the required user inputs are given.

Lee, R. W.↗

Reduction methods for nonlinear steady-state thermal analysis

Hybrid analysis techniques and a problem adaptive computational algorithm are presented for predicting the nonlinear steady state temperature distribution in structures and solids. In the proposed techniques, the structure is discretized by using the finite element method. The vector of nodal temperatures is then expressed as a linear combination of a small number of global temperature modes (or basis vectors), and the Bubnov Galerkin technique is used to compute the amplitudes of the global modes. The global temperature modes (or basis vectors) are chosen to include the various order derivatives of the nodal temperature vector with respect to preselected path parameter(s). The potential of the proposed reduction methods for solution of large scale, nonlinear thermal problems is discussed and the effectiveness of the methods is demonstrated by means of numerical examples, including steady state conduction, convection, and radiation modes of heat transfer.

Noor, A. K.↗

Three-dimensional flow over a conical afterbody containing a centered propulsive jet - A numerical simulation

The supersonic flow field over a body of revolution incident to the free stream is simulated numerically on a large, array processor (the CDC Cyber 205). The configuration is composed of a cone-cylinder forebody followed by a conical afterbody from which emanates a centered, supersonic propulsive jet. The free-stream Mach number is 2, the jet-exit Mach number is 2.5, and the jet-to-free-stream static pressure ratio is 3. Both the external flow and the exhaust are ideal air at a common total temperature. The thin-layer approximation to the time-dependent, compressible, Reynolds-averaged Navier-Stokes equations are solved using an implicit finite-difference algorithm. The data base, of 5 million words, is structured in a 'pencil' format so that efficient use of the array processor can be realized. The computer code is completely vectorized to take advantage of the data structure. Turbulence closure is achieved using an empirical algebraic eddy-viscosity model. The configuration and flow conditions correspond to published experimental tests and the computed solutions are consistent with the experimental data.

Deiwert, G. S.↗

Time controlled descent guidance algorithm for simulation of advanced ATC systems

Concepts and computer algorithms for generating time controlled four dimensional descent trajectories are described. The algorithms were implemented in the air traffic control simulator and used by experienced controllers in studies of advanced air traffic flow management procedures. A time controlled descent trajectory comprises a vector function of time, including position, altitude, and heading, that starts at the initial position of the aircraft and ends at touchdown. The trajectory provides a four dimensional reference path which will cause an aircraft tracking it to touchdown at a predetermined time with a minimum of fuel consumption. The problem of constructing such trajectories is divided into three subproblems involving synthesis of horizontal, vertical, and speed profiles. The horizontal profile is constructed as a sequence of turns and straight lines passing through a specified set of waypoints. The vertical profile consists of a sequence of level flight and constant descent angle segments defined by altitude waypoints. The speed profile is synthesized as a sequence of constant Mach number, constant indicated airspeed, and acceleration/deceleration legs. It is generated by integrating point mass differential equations of motion, which include the thrust and drag models of the aircraft.

Lee, H. Q.↗

Identification of nonlinear system parameters in joints using the force-state mapping technique

A procedure is presented for identifying the potentially strong nonlinear properties of structural members, such as joints, by expressing the force transmitted by the member as a function of its mechanical state. By explicitly including position and rate dependent effects, the surface of transmitted force versus state, the force-state map, has distinct, unique, superposable features for common structural nonlinearities, even those which appear to indicate hysteresis on a force-stroke presentation. An analysis is performed on the influence of true memory effects, transient response, and uncertainty in the measurements and system mass on the precision of the procedure. The successful identification of simulated data verifies the accuracy of the identification algorithm. Tests are then conducted on three actual joint models, with incomplete state measurements typical of an actual testing environment. The ability of the procedure to estimate the complete state vector and to analyze and reconstruct the measured nonlinear characteristics is demonstrated.

Crawley, E. F.↗

Unsymmetric Lanczos model reduction and linear state function observer for flexible structures

This report summarizes part of the research work accomplished during the second year of a two-year grant. The research, entitled 'Application of Lanczos Vectors to Control Design of Flexible Structures' concerns various ways to use Lanczos vectors and Krylov vectors to obtain reduced-order mathematical models for use in the dynamic response analyses and in control design studies. This report presents a one-sided, unsymmetric block Lanczos algorithm for model reduction of structural dynamics systems with unsymmetric damping matrix, and a control design procedure based on the theory of linear state function observers to design low-order controllers for flexible structures.

Su, Tzu-Jeng↗

Vector quantizer designs for joint compression and terrain categorization of multispectral imagery

Two vector quantizer designs for compression of multispectral imagery and their impact on terrain categorization performance are evaluated. The mean-squared error (MSE) and classification performance of the two quantizers are compared, and it is shown that a simple two-stage design minimizing MSE subject to a constraint on classification performance has a significantly better classification performance than a standard MSE-based tree-structured vector quantizer followed by maximum likelihood classification. This improvement in classification performance is obtained with minimal loss in MSE performance. The results show that it is advantageous to tailor compression algorithm designs to the required data exploitation tasks. Applications of joint compression/classification include compression for the archival or transmission of Landsat imagery that is later used for land utility surveys and/or radiometric analysis.

Gorman, John D.↗

Scan patterns and accuracy of a Radar Wind Sensor (RAWS)

The Radar Wind Sensor (RAWS) was proposed as a complement to laser wind sensors, allowing coverage in cloudy regions excluded from laser coverage. Previous University of Kansas studies showed the feasibility of the wind measurement at various levels in the atmosphere and indicated that RAWS can also measure rain rates and ocean-surface winds. Here we discuss measurement of the wind vector in terms of the scan patterns for a conically scanned antenna. By using many measurements from cells about 66 km square and 132 km square, a least-squares algorithm gives results that are reasonable for insertion into global atmospheric models. For RAWS to be used successfully as a complement to a laser wind sensor, the design of the two sensors should be integrated and radial velocity measurements in a given atmospheric cell should be combined to get the most accurate results.

Song, Shuxian↗

Flow Applications of the Least Squares Finite Element Method

The main thrust of the effort has been towards the development, analysis and implementation of the least-squares finite element method (LSFEM) for fluid dynamics and electromagnetics applications. In the past year, there were four major accomplishments: 1) special treatments in computational fluid dynamics and computational electromagnetics, such as upwinding, numerical dissipation, staggered grid, non-equal order elements, operator splitting and preconditioning, edge elements, and vector potential are unnecessary; 2) the analysis of the LSFEM for most partial differential equations can be based on the bounded inverse theorem; 3) the finite difference and finite volume algorithms solve only two Maxwell equations and ignore the divergence equations; and 4) the first numerical simulation of three-dimensional Marangoni-Benard convection was performed using the LSFEM.

Jiang, Bo-Nan↗

Diurnal Cycle of ASCAT-Identified Cold Pools and Associated Convective Systems in the Maritime Continent and South China Sea

Mesoscale convective cold pools are known to alter the turbulent air-sea fluxes in the regions of active convection such as maritime tropics. Satellite-based Ocean Vector Wind instruments have proven to be useful in observing these mesoscale outflows corresponding to convective cold pools. A new storm-centric, tensor-based wind-gradient identification algorithm identifies gradients associated with convective cold pools and other boundaries such as land-sea breeze fronts. We term these as Gradient Features or GFs; analyzed over tropical oceans (2007-2018) using horizontal winds from Advanced Scatterometer (ASCAT-A).

Nesbitt, Stephen W.↗

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗

Krylov subspace methods on supercomputers

A short survey of recent research on Krylov subspace methods with emphasis on implementation on vector and parallel computers is presented. Conjugate gradient methods have proven very useful on traditional scalar computers, and their popularity is likely to increase as three-dimensional models gain importance. A conservative approach to derive effective iterative techniques for supercomputers has been to find efficient parallel/vector implementations of the standard algorithms. The main source of difficulty in the incomplete factorization preconditionings is in the solution of the triangular systems at each step. A few approaches consisting of implementing efficient forward and backward triangular solutions are described in detail. Polynomial preconditioning as an alternative to standard incomplete factorization techniques is also discussed. Another efficient approach is to reorder the equations so as to improve the structure of the matrix to achieve better parallelism or vectorization. An overview of these and other ideas and their effectiveness or potential for different types of architectures is given.

Saad, Youcef↗

Exploring the Use of Alfven Waves in Magnetometer Calibration at Geosynchronous Orbit

An Alfven wave is a type magnetohydrodynamicwave that travels through a conducting fluid under the influence of a magnetic field. Researchers have successfully calculated offset vectors of magnetometers in interplanetary space by optimizing the offset to maximize certain Alfvenic properties of observed waves (Leinweber, Belcher). If suitable Alfven waves can be found in the magnetosphere at geosynchronous altitude then these techniques could be used to augment the overall calibration plan for magnetometers in this region such as on the GOES spacecraft, possibly increasing the time between regular maneuvers. Calibration maneuvers may be undesirable because they disrupt the activities of other instruments. Various algorithms to calculate an offset using Alfven waves were considered. A new variation of the Davis-Smith method was derived because it can be mathematically shown that the Davis-Smith method tolerates filtered data, which expands potential applications. The variant developed was designed to find only the offset in the plane normal to the main field because the overall direction of Earth's magnetic field rarely changes, and theory suggests the Alfvenic disturbances occur transverse to the main field. Other variations of the Davis-Smith method encounter problems with data containing waves that propagate in mostly the same direction. A searching algorithm was then designed to look for periods of time with potential Alfven waves in GOES 15 data based on parameters requiring that disturbances be normal to the main field and not change field magnitude. Final waves for calculation were hand-selected. These waves produced credible two-dimensional offset vectors when input to the Davis-Smith method. Multiple two-dimensional solutions in different planes can be combined to get a measurement of the complete offset. The resulting three dimensional offset did not show sufficient precision over several years to be used as a primary calibration method, but reflected changes in the offset fairly well, suggesting that the method could be helpful in monitoring trends of the offset vector when maneuvers cannot be used.

calibration↗

A portable MPI-based parallel vector template library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

A Portable MPI-Based Parallel Vector Template Library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗