Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Discrete Roughness Effects on Shuttle Orbiter at Mach 6

Discrete roughness boundary layer transition results on a Shuttle Orbiter model in the NASA Langley Research Center 20-Inch Mach 6 Air Tunnel have been reanalyzed with new boundary layer calculations to provide consistency for comparison to other published results. The experimental results were previously obtained utilizing the phosphor thermography system to monitor the status of the boundary layer via global heat transfer images of the Orbiter windward surface. The size and location of discrete roughness elements were systematically varied along the centerline of the 0.0075-scale model at an angle of attack of 40 deg and the boundary layer response recorded. Various correlative approaches were attempted, with the roughness transition correlations based on edge properties providing the most reliable results. When a consistent computational method is used to compute edge conditions, transition datasets for different configurations at several angles of attack have been shown to collapse to a well-behaved correlation.

Berry, Scott A.↗
NASA NTRS2003

Multiple Autonomous Discrete Event Controllers for Constellations

The Multiple Autonomous Discrete Event Controllers for Constellations (MADECC) project is an effort within the National Aeronautics and Space Administration Goddard Space Flight Center's (NASA/GSFC) Information Systems Division to develop autonomous positioning and attitude control for constellation satellites. It will be accomplished using traditional control theory and advanced coordination algorithms developed by the Johns Hopkins University Applied Physics Laboratory (JHU/APL). This capability will be demonstrated in the discrete event control test-bed located at JHU/APL. This project will be modeled for the Leonardo constellation mission, but is intended to be adaptable to any constellation mission. To develop a common software architecture. the controllers will only model very high-level responses. For instance, after determining that a maneuver must be made. the MADECC system will output B (Delta)V (velocity change) value. Lower level systems must then decide which thrusters to fire and for how long to achieve that (Delta)V.

Esposito, Timothy C.↗
NASA NTRS2003

A Discrete Analysis of Non-reflecting Boundary Conditions for Discontinuous Galerkin Method

We present a discrete analysis of non-reflecting boundary conditions for the discontinuous Galerkin method. The boundary conditions considered in this paper include the recently proposed Perfectly Matched Layer absorbing boundary condition for the linearized Euler equation and two non-reflecting boundary conditions based on the characteristic decomposition of the flux on the boundary. The analyses for the three boundary conditions are carried out in a unifled way. In each case, eigensolutions of the discrete system are obtained and applied to compute the numerical reflection coefficients of a specified out-going wave. The dependencies of the reflections at the boundary on the out-going wave angle and frequency as well as the mesh sizes arc? studied. Comparisons with direct numerical simulation results are also presented.

Hu, Fang Q.↗
NASA NTRS2003

Hybrid Discrete-Continuous Markov Decision Processes

This paper proposes a Markov decision process (MDP) model that features both discrete and continuous state variables. We extend previous work by Boyan and Littman on the mono-dimensional time-dependent MDP to multiple dimensions. We present the principle of lazy discretization, and piecewise constant and linear approximations of the model. Having to deal with several continuous dimensions raises several new problems that require new solutions. In the (piecewise) linear case, we use techniques from partially- observable MDPs (POMDPS) to represent value functions as sets of linear functions attached to different partitions of the state space.

Feng, Zhengzhu↗
NASA NTRS2003

A Discrete Constraint for Entropy Conservation and Sound Waves in Cloud-Resolving Modeling

Ideal cloud-resolving models contain little-accumulative errors. When their domain is so large that synoptic large-scale circulations are accommodated, they can be used for the simulation of the interaction between convective clouds and the large-scale circulations. This paper sets up a framework for the models, using moist entropy as a prognostic variable and employing conservative numerical schemes. The models possess no accumulative errors of thermodynamic variables when they comply with a discrete constraint on entropy conservation and sound waves. Alternatively speaking, the discrete constraint is related to the correct representation of the large-scale convergence and advection of moist entropy. Since air density is involved in entropy conservation and sound waves, the challenge is how to compute sound waves efficiently under the constraint. To address the challenge, a compensation method is introduced on the basis of a reference isothermal atmosphere whose governing equations are solved analytically. Stability analysis and numerical experiments show that the method allows the models to integrate efficiently with a large time step.

Zeng, Xi-Ping↗
NASA NTRS2004

Discrete X-Ray Source Populations and Star-Formation History in Nearby Galaxies

This program aims in understanding the connection between the discrete X-ray source populations observed in nearby galaxies and the history of star-formation in these galaxies. The ultimate goal is to use this knowledge in order to constrain X-ray binary evolution channels. For this reason although the program is primarily observational it has a significant modeling component. During the first year of this study we focused on the definition of a pilot sample of galaxies with well know star-formation histories. A small part of this sample has already been observed and we performed initial analysis of the data. However, the majority of the objects in our sample either have not been observed at all, or the detection limit of the existing observations is not low enough to probe the bulk of their young X-ray binary populations. For this reason we successfully proposed for additional Chandra observations of three targets in Cycle-5. These observations are currently being performed. The analysis of the (limited) archival data for this sample indicated that the X-ray luminosity functions (XLF) of the discrete sources in these galaxies may not have the same shape as is widely suggested. However, any solid conclusions are hampered by the small number of detected sources. For this reason during the second year of this study, we will try to extend the sample in order to include more objects in each evolutionary stage. In addition we are completing the analysis of the Chandra monitoring observations of the Antennae galaxies. The results from this work, apart from important clues on the nature of the most luminous sources (Ultra-luminous X-ray sources; ULXs) provide evidence that source spectral and/or temporal variability does not significantly affect the shape of their X-ray luminosity functions. This is particularly important for comparisons between the XLFs of different galaxies and comparisons with predictions from theoretical models. Results from this work have been presented in several conferences. Refereed journal papers presenting these conclusions are currently in preparation. An important part of this study is the Chandra survey of the Small Magellanic Cloud, our second nearest star- forming galaxy. So far we have been awarded 5 Chandra observations of the central youngest part of the galaxy. These observations will help to study the very faint end of the young X-ray binary populations which is not possible to probe in more distant objects. Results from this study have been presented in several conferences and two papers are in preparation. In addition during year-2 we are planning of undertaking the task of identifying optical counterparts to the X-ray sources, which will help us to isolate interlopers (sources not associated with the SMC) and classify the X-ray binaries which are found to be associated with the SMC. In the theoretical front, the Star-Track X-ray binary population synthesis code which will be used for the modeling of the X-ray binary populations (led by co-I V. Kalogera and C. Belczynski), is complete. A first test using the XLF of the star-forming galaxy NGC-1569 showed remarkable agreement between the observed and the modeled XLF. These results are presented in an ApJ. Letters paper (Belczynski et al, 2004, 601, 147). During year-2 of this study we are planning of performing a parameter study in order to investigate which parameters are most important for the shape of the XLF. In addition we will perform comparisons with observations of other galaxies from our sample as they become available.

Zezas, Andreas↗
NASA NTRS2005

Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov s algorithm is compared with Clenshaw s algorithm for the computation of the DCT.

Aburdene, Maurice F.↗
NASA NTRS1998

Electrical signal transmission in a bone cell network: the influence of a discrete gap junction

A refined electrical cable model is formulated to investigate the role of a discrete gap junction in the intracellular transmission of electrical signals in an electrically coupled system of osteocytes and osteoblasts in an osteon. The model also examines the influence of the ratio q between the membrane's electrical time constant and the characteristic time of pore fluid pressure, the circular, cylindrical geometry of the osteon, and key simplifying assumptions in our earlier continuous cable model (see Zhang, D., S. C. Cowin, and S. Weinbaum. Electrical signal transmission and gap junction regulation in a bone cell network: A cable model for an osteon. Ann. Biomed. Eng. 25:379-396, 1997). Using this refined model, it is shown that (1) the intracellular potential amplitude at the osteoblastic end of the osteonal cable retains the character of a combination of a low-pass and a high-pass filter as the corner frequency varies in the physiological range; (2) the presence of a discrete gap junction near a resting osteoblast can lead to significant modulation of the intracellular potential and current in the osteoblast for measured values of the gap junction coupling strength; and (3) the circular, cylindrical geometry of the osteon is well simulated by the beam analogy used in Zhang et al.

Non-NASA Center↗
NASA NTRS2004

Hierarchical Discrete Event Supervisory Control of Aircraft Propulsion Systems

This paper presents a hierarchical application of Discrete Event Supervisory (DES) control theory for intelligent decision and control of a twin-engine aircraft propulsion system. A dual layer hierarchical DES controller is designed to supervise and coordinate the operation of two engines of the propulsion system. The two engines are individually controlled to achieve enhanced performance and reliability, necessary for fulfilling the mission objectives. Each engine is operated under a continuously varying control system that maintains the specified performance and a local discrete-event supervisor for condition monitoring and life extending control. A global upper level DES controller is designed for load balancing and overall health management of the propulsion system.

Yasar, Murat↗
NASA NTRS2004

On the Total Variation of High-Order Semi-Discrete Central Schemes for Conservation Laws

We discuss a new fifth-order, semi-discrete, central-upwind scheme for solving one-dimensional systems of conservation laws. This scheme combines a fifth-order WENO reconstruction, a semi-discrete central-upwind numerical flux, and a strong stability preserving Runge-Kutta method. We test our method with various examples, and give particular attention to the evolution of the total variation of the approximations.

Bryson, Steve↗
NASA NTRS2006

Discovering Atypical Flights in Sequences of Discrete Flight Parameters

This paper describes the results of a novel research and development effort conducted at the NASA Ames Research Center for discovering anomalies in discrete parameter sequences recorded from flight data. Many of the discrete parameters that are recorded during the flight of a commercial airliner correspond to binary switches inside the cockpit. The inputs to our system are records from thousands of flights for a given class of aircraft and destination. The system delivers a list of potentially anomalous flights as well as reasons why the flight was tagged as anomalous. This output can be analyzed by safety experts to determine whether or not the anomalies are indicative of a problem that could be addressed with a human factors intervention. The final goal of the system is to help safety experts discover significant human factors issues such as pilot mode confusion, i.e., a flight in which a pilot has lost situational awareness as reflected in atypicality of the sequence of switches that he or she throws during descent compared to a population of similar flights. We view this work as an extension of Integrated System Health Management (ISHM) where the goal is to understand and evaluate the combined health of a class of aircraft ar a given destination.

Budalakoti, Suratna↗
NASA NTRS2006

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

White, Michael J.↗
NASA NTRS2005

HEALPix: A Framework for High-Resolution Discretization and Fast Analysis of Data Distributed on the Sphere

HEALPix the Hierarchical Equal Area isoLatitude Pixelization is a versatile structure for the pixelization of data on the sphere. An associated library of computational algorithms and visualization software supports fast scientific applications executable directly on discretized spherical maps generated from very large volumes of astronomical data. Originally developed to address the data processing and analysis needs of the present generation of cosmic microwave background experiments (e.g., BOOMERANG, WMAP), HEALPix can be expanded to meet many of the profound challenges that will arise in confrontation with the observational output of future missions and experiments, including, e.g., Planck, Herschel, SAFIR, and the Beyond Einstein inflation probe. In this paper we consider the requirements and implementation constraints on a framework that simultaneously enables an efficient discretization with associated hierarchical indexation and fast analysis/synthesis of functions defined on the sphere. We demonstrate how these are explicitly satisfied by HEALPix.

cosmic microwave background↗
NASA NTRS2007

The SMM Model as a Boundary Value Problem Using the Discrete Diffusion Equation

A generalized single step stepwise mutation model (SMM) is developed that takes into account an arbitrary initial state to a certain partial difference equation. This is solved in both the approximate continuum limit and the more exact discrete form. A time evolution model is developed for Y DNA or mtDNA that takes into account the reflective boundary modeling minimum microsatellite length and the original difference equation. A comparison is made between the more widely known continuum Gaussian model and a discrete model, which is based on modified Bessel functions of the first kind. A correction is made to the SMM model for the probability that two individuals are related that takes into account a reflecting boundary modeling minimum microsatellite length. This method is generalized to take into account the general n-step model and exact solutions are found. A new model is proposed for the step distribution.

Campbell, Joel↗
NASA NTRS2009

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗
NASA NTRS2000

Conditioning of the Stable, Discrete-time Lyapunov Operator

The Schatten p-norm condition of the discrete-time Lyapunov operator L(sub A) defined on matrices P is identical with R(sup n X n) by L(sub A) P is identical with P - APA(sup T) is studied for stable matrices A is a member of R(sup n X n). Bounds are obtained for the norm of L(sub A) and its inverse that depend on the spectrum, singular values and radius of stability of A. Since the solution P of the the discrete-time algebraic Lyapunov equation (DALE) L(sub A)P = Q can be ill-conditioned only when either L(sub A) or Q is ill-conditioned, these bounds are useful in determining whether P admits a low-rank approximation, which is important in the numerical solution of the DALE for large n.

Tippett, Michael K.↗