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 829 records · Page 46

Comparison of Orbiter PRCS Plume Flow Fields Using CFD and Modified Source Flow Codes

The Space Shuttle Orbiter will use Reaction Control System (RCS) jets for docking with the planned International Space Station (ISS). During approach and backout maneuvers, plumes from these jets could cause high pressure, heating, and thermal loads on ISS components. The object of this paper is to present comparisons of RCS plume flow fields used to calculate these ISS environments. Because of the complexities of 3-D plumes with variable scarf-angle and multi-jet combinations, NASA/JSC developed a plume flow-field methodology for all of these Orbiter jets. The RCS Plume Model (RPM), which includes effects of scarfed nozzles and dual jets, was developed as a modified source-flow engineering tool to rapidly generate plume properties and impingement environments on ISS components. This paper presents flow-field properties from four PRCS jets: F3U low scarf-angle single jet, F3F high scarf-angle single jet, DTU zero scarf-angle dual jet, and F1F/F2F high scarf-angle dual jet. The RPM results compared well with plume flow fields using four CFD programs: General Aerodynamic Simulation Program (GASP), Cartesian (CART), Unified Solution Algorithm (USA), and Reacting and Multi-phase Program (RAMP). Good comparisons of predicted pressures are shown with STS 64 Shuttle Plume Impingement Flight Experiment (SPIFEX) data.

Rochelle, Wm. C.↗

Snow and Ice Applications of AVHRR in Polar Regions: Report of a Workshop

The third symposium on Remote Sensing of Snow and Ice, organized by the International Glaciological Society, took place in Boulder, Colorado, 17-22 May 1992. As part of this meeting a total of 21 papers was presented on snow and ice applications of Advanced Very High Resolution Radiometer (AVHRR) satellite data in polar regions. Also during this meeting a NASA sponsored Workshop was held to review the status of polar surface measurements from AVHRR. In the following we have summarized the ideas and recommendations from the workshop, and the conclusions of relevant papers given during the regular symposium sessions. The seven topics discussed include cloud masking, ice surface temperature, narrow-band albedo, ice concentration, lead statistics, sea-ice motion and ice-sheet studies with specifics on applications, algorithms and accuracy, following recommendations for future improvements. In general, we can affirm the strong potential of AVHRR for studying sea ice and snow covered surfaces, and we highly recommend this satellite data set for long-term monitoring of polar process studies. However, progress is needed to reduce the uncertainty of the retrieved parameters for all of the above mentioned topics to make this data set useful for direct climate applications such as heat balance studies and others. Further, the acquisition and processing of polar AVHRR data must become better coordinated between receiving stations, data centers and funding agencies to guarantee a long-term commitment to the collection and distribution of high quality data.

Steffen, K.↗

Advances in Application of Fast Semidirect Computational Methods in Transonic Flow

This paper is intended as a review and summary of the advances made in a recently developed approach for rapid numerical solution of the equations of inviscid transonic aerodynamics. The investigation has been limited to two-dimensional, steady, inviscid flow over airfoils in a subsonic free stream, with emphasis on development of a rapid computational technique, rather than on generality of application. The approach uses finite-difference algorithms called "fast direct elliptic solvers" within an iteration scheme. "Direct" means that the entire computation field is solved at once, rather than in successive traverses over the field as in a point- or line-relaxation method. Such an iterative method is referred to as "semidirect." The iterative convergence can be faster than in other relaxation methods because changes are felt simultaneously at all points in each succeeding iteration. Direct elliptic solvers and semidirect methods have restrictions, but these are gradually being removed. Direct solvers were first developed for solving Poisson's equation on a rectangle without interior boundaries. A method to treat first-order systems, a direct Cauchy-Riemann solver has also been developed. Numerical treatment of part of a system of nonlinear equations by a Poisson solver has been reported. Also Poisson solvers in semidirect methods were used for nonseparable elliptic equations. The semidirect method was extended to the solution of a problem of mixed type, where the improved Murman-Cole transonic small-disturbance difference equations were solved. A slightly supercritical flow over a biconvex airfoil was treated successfully, but the iterations did not converge for more strongly supercritical conditions In another work the addition of terms ot both sides of the difference equations stabilized the iteration for supercritical conditions with large supersonic zones. For this, the Cauchy-Riemann solver was revised to incl,ude the needed terms. Most recently, the evaluation of parameters for rapid convergence and comparisons, with Murman's line-relaxation method was described. The method was extended to full second order accuracy in a fully conservative formulation in another work.

Martin, E. Dale↗

Hydrometeor Profiles Derived from Airborne Radar and Wideband Radiometer Observations

A rich dataset was obtained with observations from the MIR (Millimeter-wave Imaging Radiometer, 89, 150, 183.3$\pm$1, 183.3$\pm$3,183.3$\pm$7, and 220 apprx.GHz), the AMPR (Advanced Microwave Precipitation Radiometer, 10.7, 19.35, 37, and 85 approx. GHz), and the EDOP (ER-2 Doppler Radar, 9.6 approx. GHz) on board the ER-2 aircraft during the CAMEX-3/TEFLUN-B (Convection and Moisture Experiment/Texas and Florida Underflights) TRMM (Tropical Rainfall Measuring Mission) field campaign. Measurements over the ocean from these three instruments on 26 August 1998 were used in our iterative retrieval algorithm to estimate hydrometeor drop size profiles, The algorithm attempts to minimize the difference between the observations and forward radiometer and radar calculations based on the estimated profile. The high frequency MIR observations provide detailed information about the high altitude ice microphysics, while the AMPR is mostly used to define liquid hydrometeor characteristics. The EDOP provides an initial estimate of the profile and as a consistency check throughout the iterative cycle. The retrieval algorithm, specific results for convective and anvil cases, and general implications of this work will be presented.

Skofronick-Jackson, G. M.↗

Optimal Prediction of Clocks from Finite Data

This talk is about optimal linear prediction of processes with stationary dth increments, which serve as a class of models for random clock disturbances. The predictor is obtained by orthogonal projection on the affine space of estimators whose errors are invariant to additive polynomials of degree < d. The projection conditions give a system of linear equations thatcan be solved straightforwardly for the regression coefficients. If the data are equally spaced, then the predictor can be obtained by an extension of Levinson's algorithm.

stationary increments↗

Slicing AADL Specifications for Model Checking

To combat the state-space explosion problem in model checking larger systems, abstraction techniques can be employed. Here, methods that operate on the system specification before constructing its state space are preferable to those that try to minimize the resulting transition system as they generally reduce peak memory requirements. We sketch a slicing algorithm for system specifications written in (a variant of) the Architecture Analysis and Design Language (AADL). Given a specification and a property to be verified, it automatically removes those parts of the specification that are irrelevant for model checking the property, thus reducing the size of the corresponding transition system. The applicability and effectiveness of our approach is demonstrated by analyzing the state-space reduction for an example, employing a translator from AADL to Promela, the input language of the SPIN model checker.

Odenbrett, Maximilian↗

Exploiting Quantum Resonance to Solve Combinatorial Problems

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Zak, Michail↗

Experimental Validation of L1 Adaptive Control: Rohrs' Counterexample in Flight

The paper presents new results on the verification and in-flight validation of an L1 adaptive flight control system, and proposes a general methodology for verification and validation of adaptive flight control algorithms. The proposed framework is based on Rohrs counterexample, a benchmark problem presented in the early 80s to show the limitations of adaptive controllers developed at that time. In this paper, the framework is used to evaluate the performance and robustness characteristics of an L1 adaptive control augmentation loop implemented onboard a small unmanned aerial vehicle. Hardware-in-the-loop simulations and flight test results confirm the ability of the L1 adaptive controller to maintain stability and predictable performance of the closed loop adaptive system in the presence of general (artificially injected) unmodeled dynamics. The results demonstrate the advantages of L1 adaptive control as a verifiable robust adaptive control architecture with the potential of reducing flight control design costs and facilitating the transition of adaptive control into advanced flight control systems.

Xargay, Enric↗

Multiscale Dynamics of Solar Magnetic Structures

Multiscale topological complexity of the solar magnetic field is among the primary factors controlling energy release in the corona, including associated processes in the photospheric and chromospheric boundaries.We present a new approach for analyzing multiscale behavior of the photospheric magnetic flux underlying these dynamics as depicted by a sequence of high-resolution solar magnetograms. The approach involves two basic processing steps: (1) identification of timing and location of magnetic flux origin and demise events (as defined by DeForest et al.) by tracking spatiotemporal evolution of unipolar and bipolar photospheric regions, and (2) analysis of collective behavior of the detected magnetic events using a generalized version of the Grassberger-Procaccia correlation integral algorithm. The scale-free nature of the developed algorithms makes it possible to characterize the dynamics of the photospheric network across a wide range of distances and relaxation times. Three types of photospheric conditions are considered to test the method: a quiet photosphere, a solar active region (NOAA 10365) in a quiescent non-flaring state, and the same active region during a period of M-class flares. The results obtained show (1) the presence of a topologically complex asymmetrically fragmented magnetic network in the quiet photosphere driven by meso- and supergranulation, (2) the formation of non-potential magnetic structures with complex polarity separation lines inside the active region, and (3) statistical signatures of canceling bipolar magnetic structures coinciding with flaring activity in the active region. Each of these effects can represent an unstable magnetic configuration acting as an energy source for coronal dissipation and heating.

Magnetic fields↗

Retrieving Rain Drop Size Distribution Moments from GPM Dual-Frequency Precipitation Radar

A novel method for retrieving the moments of rain drop size distribution (DSD) from the dual-frequency precipitation radar (DPR) onboard the global precipitation mission satellite (GPM)is presented. The method involves the estimation of two chosen reference moments from two specific DPR products, namely the attenuation-corrected Ku-band radar reflectivity and (if made available) the specific attenuation at Ka-band. The reference moments are then combined with a function representing the underlying shape of the DSD based on the generalized gamma model. Simulations are performed to quantify the algorithm errors. The performance of methodology is assessed with two GPM-DPR overpass cases over disdrometer sites, one in Huntsville, Alabama and one in Delmarva peninsula, Virginia, both in the US. Results are promising and indicate that it is feasible to estimate DSD moments directly from DPR-based quantities.

Merhala Thurai↗

Validation of IMERG Oceanic Precipitation over Kwajalein

The integrated Multi-satellitE Retrievals for GPM (IMERG) Version V05B and V06B precipitation products from the Global Precipitation Measurement (GPM) mission are validated against ground-based observations from the Kwajalein Polarimetric S-band Weather Radar (KPOL) deployed at Kwajalein Atoll in the central Pacific Ocean. Such a validation is particularly important as comprehensive surface measurements over the oceans are practically infeasible, which hampers the identification of possible errors, and improvement of future versions of IMERG and other satellitebased retrieval algorithms. The V05B and V06B IMERG products are validated at their native 0.1°, 30 min resolution from 2014 to 2018 based on both volumetric and categorical metrics. This validation study indicates that precipitation rates from both IMERG V05B and V06B are underestimated with respect to radar surface estimates, but the underestimation is much reduced from V05B IMERG V06B outperforms V05B with reduced systematic bias and improved precipitation detectability. The IMERG performance is further traced back to its individual sensors and morphing-based algorithms. The overall underestimation in V05B is mainly driven by the negative relative biases from morphing-based algorithms which are largely corrected in V06B. Imagers perform generally better than sounders because of the usage of low-frequency channels in imagers which can better detect emission signals by the hydrometeors. Among imagers, the GPM Microwave Imager (GMI) and Advanced Microwave Scanning Radiometer Version 2 (AMSR2) are the best, followed by Special Sensor Microwave Imager/Sounder (SSMIS). Among sounders, the Microwave Humidity Sounder (MHS) is the best, followed by Advanced Technology Microwave Sounder (ATMS) and the Sounder for Atmospheric Profiling of Humidity in the Intertropics by Radiometry (SAPHIR) for V06B. Among all categories, morph-only and IR+morph only perform better than SAPHIR. SAPHIR shows the worst performance among all categories, likely due to its limited channel selection. It is envisaged that these results will improve our understanding of IMERG performance over oceans and aid in the improvement of future versions of IMERG.

KPOL↗

A superlinear interior points algorithm for engineering design optimization

We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.

Herskovits, J.↗

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗

Hypersonic blunt body computations including real gas effects

Various second-order explicit and implicit TVD shock-capturing methods, a generalization of Roe's approximate Riemann solver, and a generalized flux-vector splitting scheme are used to study two-dimensional hypersonic real-gas flows. Special attention is given to the identification of some of the elements and parameters which can affect the convergence rate for high Mach numbers or real gases, but have negligible effect for low Mach numbers, for cases involving steady-state inviscid blunt flows. Blunt body calculations at Mach numbers of greater than 15 are performed to treat real-gas effects, and impinging shock results are obtained to test the treatment of slip surfaces and complex structures. Even with the addition of improvements, the convergence rate of algorithms in the hypersonic flow regime is found to be generally slower for a real gas than for a perfect gas.

Montagne, J.-L.↗

Hardware Implementation of Lossless Adaptive and Scalable Hyperspectral Data Compression for Space

On-board lossless hyperspectral data compression reduces data volume in order to meet NASA and DoD limited downlink capabilities. The technique also improves signature extraction, object recognition and feature classification capabilities by providing exact reconstructed data on constrained downlink resources. At JPL a novel, adaptive and predictive technique for lossless compression of hyperspectral data was recently developed. This technique uses an adaptive filtering method and achieves a combination of low complexity and compression effectiveness that far exceeds state-of-the-art techniques currently in use. The JPL-developed 'Fast Lossless' algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. It is of low computational complexity and thus well-suited for implementation in hardware. A modified form of the algorithm that is better suited for data from pushbroom instruments is generally appropriate for flight implementation. A scalable field programmable gate array (FPGA) hardware implementation was developed. The FPGA implementation achieves a throughput performance of 58 Msamples/sec, which can be increased to over 100 Msamples/sec in a parallel implementation that uses twice the hardware resources This paper describes the hardware implementation of the 'Modified Fast Lossless' compression algorithm on an FPGA. The FPGA implementation targets the current state-of-the-art FPGAs (Xilinx Virtex IV and V families) and compresses one sample every clock cycle to provide a fast and practical real-time solution for space applications.

FPGA implementation↗

Verification of fault-tolerant clock synchronization systems

A critical function in a fault-tolerant computer architecture is the synchronization of the redundant computing elements. The synchronization algorithm must include safeguards to ensure that failed components do not corrupt the behavior of good clocks. Reasoning about fault-tolerant clock synchronization is difficult because of the possibility of subtle interactions involving failed components. Therefore, mechanical proof systems are used to ensure that the verification of the synchronization system is correct. In 1987, Schneider presented a general proof of correctness for several fault-tolerant clock synchronization algorithms. Subsequently, Shankar verified Schneider's proof by using the mechanical proof system EHDM. This proof ensures that any system satisfying its underlying assumptions will provide Byzantine fault-tolerant clock synchronization. The utility of Shankar's mechanization of Schneider's theory for the verification of clock synchronization systems is explored. Some limitations of Shankar's mechanically verified theory were encountered. With minor modifications to the theory, a mechanically checked proof is provided that removes these limitations. The revised theory also allows for proven recovery from transient faults. Use of the revised theory is illustrated with the verification of an abstract design of a clock synchronization system.

Miner, Paul S.↗

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗

Integration-free interval doubling for Riccati equation solutions

Various algorithms are given for the case of constant coefficients. The algorithms are based on two ideas: first, relate the Re solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration free superlinearly convergent iterative solution to the algebraic RE. The algorithm, arranged in square-root form, is thought to be numerically stable and competitive with other methods of solving the algebraic RE.

Bierman, G. J.↗