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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1994

Active control of turbomachine discrete tones

This paper was directed at active control of discrete frequency noise generated by subsonic blade rows through cancellation of the blade row interaction generated propagating acoustic waves. First discrete frequency noise generated by a rotor and stator in a duct was analyzed to determine the propagating acoustic pressure waves. Then a mathematical model was developed to analyze and predict the active control of discrete frequency noise generated by subsonic blade rows through cancellation of the propagating acoustic waves, accomplished by utilizing oscillating airfoil surfaces to generate additional control propagating pressure waves. These control waves interact with the propagating acoustic waves, thereby, in principle, canceling the acoustic waves and thus, the far field discrete frequency tones. This model was then applied to a fan exit guide vane to investigate active airfoil surface techniques for control of the propagating acoustic waves, and thus the far field discrete frequency tones, generated by blade row interactions.

Fleeter, Sanford↗

NASA NTRS1994

Discrete-Layer Piezoelectric Plate and Shell Models for Active Tip-Clearance Control

The objectives of this work were to develop computational tools for the analysis of active-sensory composite structures with added or embedded piezoelectric layers. The targeted application for this class of smart composite laminates and the analytical development is the accomplishment of active tip-clearance control in turbomachinery components. Two distinct theories and analytical models were developed and explored under this contract: (1) a discrete-layer plate theory and corresponding computational models, and (2) a three dimensional general discrete-layer element generated in curvilinear coordinates for modeling laminated composite piezoelectric shells. Both models were developed from the complete electromechanical constitutive relations of piezoelectric materials, and incorporate both displacements and potentials as state variables. This report describes the development and results of these models. The discrete-layer theories imply that the displacement field and electrostatic potential through-the-thickness of the laminate are described over an individual layer rather than as a smeared function over the thickness of the entire plate or shell thickness. This is especially crucial for composites with embedded piezoelectric layers, as the actuating and sensing elements within these layers are poorly represented by effective or smeared properties. Linear Lagrange interpolation polynomials were used to describe the through-thickness laminate behavior. Both analytic and finite element approximations were used in the plane or surface of the structure. In this context, theoretical developments are presented for the discrete-layer plate theory, the discrete-layer shell theory, and the formulation of an exact solution for simply-supported piezoelectric plates. Finally, evaluations and results from a number of separate examples are presented for the static and dynamic analysis of the plate geometry. Comparisons between the different approaches are provided when possible, and initial conclusions regarding the accuracy and limitations of these models are given.

Heyliger, P. R.↗

NASA NTRS2001

Distributed Relaxation for Conservative Discretizations

A multigrid method is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work that is a small (less than 10) multiple of the operation count in one target-grid residual evaluation. The way to achieve this efficiency is the distributed relaxation approach. TME solvers employing distributed relaxation have already been demonstrated for nonconservative formulations of high-Reynolds-number viscous incompressible and subsonic compressible flow regimes. The purpose of this paper is to provide foundations for applications of distributed relaxation to conservative discretizations. A direct correspondence between the primitive variable interpolations for calculating fluxes in conservative finite-volume discretizations and stencils of the discretized derivatives in the nonconservative formulation has been established. Based on this correspondence, one can arrive at a conservative discretization which is very efficiently solved with a nonconservative relaxation scheme and this is demonstrated for conservative discretization of the quasi one-dimensional Euler equations. Formulations for both staggered and collocated grid arrangements are considered and extensions of the general procedure to multiple dimensions are discussed.

Diskin, Boris↗

NASA NTRS1995

On the Importance of the Dynamics of Discretizations

It has been realized recently that the discrete maps resulting from numerical discretizations of differential equations can possess asymptotic dynamical behavior quite different from that of the original systems. This is the case not only for systems of Ordinary Differential Equations (ODEs) but in a more complicated manner for Partial Differential Equations (PDEs) used to model complex physics. The impact of the modified dynamics may be mild and even not observed for some numerical methods. For other classes of discretizations the impact may be pronounced, but not always obvious depending on the nonlinear model equations, the time steps, the grid spacings and the initial conditions. Non-convergence or convergence to periodic solutions might be easily recognizable but convergence to incorrect but plausible solutions may not be so obvious - even for discretized parameters within the linearized stability constraint. Based on our past four years of research, we will illustrate some of the pathology of the dynamics of discretizations, its possible impact and the usage of these schemes for model nonlinear ODEs, convection-diffusion equations and grid adaptations.

Sweby, Peter K.↗

NASA NTRS2003

Discrete Abstractions of Hybrid Systems: Verification of Safety and Application to User-Interface Design

Human interaction with a complex control system involves the user, the automation’s discrete mode logic, and the underlying continuous dynamics of the physical system. The user-interface of such systems always displays a reduced set of information about the entire system. Designing interfaces such that all the pertinent information is available and assuring that this information is correct is important for any user-interface, but especially so for safety-critical systems such as automotive systems and autopilots. Here we describe a methodology for the analysis of hybrid control systems that incorporate user interaction, with the goal of assuring that the information provided to the user is correct. That is, the user-interface must contain all information necessary to safely complete a desired procedure or task. We begin with a hybrid system model which incorporates discrete mode logic as well as nonlinear continuous dynamics. Using a hybrid computational tool for reachability, we find the largest region of the state-space in which we can guarantee the state of the system can always remain – this is the safe region of operation. By implementing a controller for safety which arises from this computation, we mathematically guarantee that this safe region is invariant, meaning that the system will always remain within the safe region if the determined controller is used on the boundary of the safe region. Verification within a hybrid framework allows us to account for the continuous dynamics underlying the discrete representations displayed to the user. Using the computed invariant regions as discrete states, we can abstract a discrete event system from this hybrid system with safety restrictions. This abstraction can be used to determine what information must be provided on the display. Furthermore, in cases in which an interface already exists, the abstraction provides the necessary input into existing interface verification methods. We provide two examples: a car traveling through a yellow light at an intersection and an aircraft autopilot in an automatic landing/go-around maneuver. The examples demonstrate the applicability of this methodology to hybrid systems that have operational constraints we can pose in terms of safety. This methodology differs from existing work in hybrid system verification in that we directly account for the user’s interactions with the system.

Meeko Oishi↗

NASA NTRS2004

A Two-Timescale Discretization Scheme for Collocation

The development of a two-timescale discretization scheme for collocation is presented. This scheme allows a larger discretization to be utilized for smoothly varying state variables and a second finer discretization to be utilized for state variables having higher frequency dynamics. As such. the discretization scheme can be tailored to the dynamics of the particular state variables. In so doing. the size of the overall Nonlinear Programming (NLP) problem can be reduced significantly. Two two-timescale discretization architecture schemes are described. Comparison of results between the two-timescale method and conventional collocation show very good agreement. Differences of less than 0.5 percent are observed. Consequently. a significant reduction (by two-thirds) in the number of NLP parameters and iterations required for convergence can be achieved without sacrificing solution accuracy.

Desai, Prasun↗

NASA NTRS2010

Accuracy Analysis for Finite-Volume Discretization Schemes on Irregular Grids

A new computational analysis tool, downscaling test, is introduced and applied for studying the convergence rates of truncation and discretization errors of nite-volume discretization schemes on general irregular (e.g., unstructured) grids. The study shows that the design-order convergence of discretization errors can be achieved even when truncation errors exhibit a lower-order convergence or, in some cases, do not converge at all. The downscaling test is a general, efficient, accurate, and practical tool, enabling straightforward extension of verification and validation to general unstructured grid formulations. It also allows separate analysis of the interior, boundaries, and singularities that could be useful even in structured-grid settings. There are several new findings arising from the use of the downscaling test analysis. It is shown that the discretization accuracy of a common node-centered nite-volume scheme, known to be second-order accurate for inviscid equations on triangular grids, degenerates to first order for mixed grids. Alternative node-centered schemes are presented and demonstrated to provide second and third order accuracies on general mixed grids. The local accuracy deterioration at intersections of tangency and in flow/outflow boundaries is demonstrated using the DS tests tailored to examining the local behavior of the boundary conditions. The discretization-error order reduction within inviscid stagnation regions is demonstrated. The accuracy deterioration is local, affecting mainly the velocity components, but applies to any order scheme.

Diskin, Boris↗

NASA NTRS2012

Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries.

Diskin, Boris↗

DOE OSTI2025

A thermodynamically consistent discretization of 1D thermal-fluid models using their metriplectic 4-bracket structure

Thermodynamically consistent models in continuum physics, i.e. models which satisfy the first and second laws of thermodynamics, may be expressed using the metriplectic formalism. In this work, we leverage the structures underlying this modeling formalism to preserve thermodynamic consistency in discretizations of a fluid model. The procedure relies (1) on ensuring that the spatial semi-discretization retains certain symmetries and degeneracies of the Poisson and metriplectic 4-brackets, and (2) on the use of an appropriate energy conserving time-stepping method. Here, the minimally simple yet nontrivial example of a one-dimensional thermal-fluid model is treated. It is found that preservation of the requisite symmetries and degeneracies of the 4-bracket is relatively simple to ensure in Galerkin spatial discretizations, suggesting a path forward for thermodynamically consistent discretizations of more complex fluid models using more specialized Galerkin methods.

Hamiltonian structure↗

DOE OSTI2025

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗

NASA NTRS1974

Reduction in redundancy of multichannel telemetric information by the method of adaptive discretization with associative sorting

The method of adaptive discretization is the most promising for elimination of redundancy from telemetry messages characterized by signal shape. Adaptive discretization with associative sorting was considered as a way to avoid the shortcomings of adaptive discretization with buffer smoothing and adaptive discretization with logical switching in on-board information compression devices (OICD) in spacecraft. Mathematical investigations of OICD are presented.

Kantor, A. V.↗

NASA NTRS1976

A study of discrete control signal fault conditions in the shuttle DPS

An analysis of the effects of discrete failures on the data processing subsystem is presented. A functional description of each discrete together with a list of software modules that use this discrete are included. A qualitative description of the consequences that may ensue due to discrete failures is given followed by a probabilistic reliability analysis of the data processing subsystem. Based on the investigation conducted, recommendations were made to improve the reliability of the subsystem.

Reddi, S. S.↗

NASA NTRS1984

An association between discrete aurora and energetic particle boundaries

Low-altitude observations of the energy flux carried by precipitating auroral electrons are compared with simultaneous measurements of the more energetic particle population to determine the spatial relationships between discrete auroras and those regions where the ion population exhibits a full loss cone. Discrete auroras are identified as instances where large, spatially structured energy fluxes (in excess of 10 erg per sq cm s) are carried almost exclusively by precipitating electrons. This comparison makes it possible to infer a relation between discrete auroras and earthward streaming ions observed in the tail. Since discrete auroras occur in association with field-aligned currents, an evaluation is made of the suggestion that auroral field-aligned currents map to the outer boundary of the plasma sheet.

Lyons, L. R.↗

NASA NTRS1985

Discrete-ordinates finite-element method for atmospheric radiative transfer and remote sensing

The principal features of the discrete-ordinates finite-element method are reviewed, and the applicability of general-purpose discrete-ordinates codes to atmospheric radiative transfer and remote sensing problems is demonstrated. In particular, numerical results for typical problems arising in meteorology, climatology, and remote sensing are shown to be in good agreement with results from other methods and measurements. A sample two-dimensional calculation demonstrates that specific capabilities available in the discrete-ordinates code TWOTRAN can produce new results that are valuable in the characterization of atmospheric effects on remote sensing (e.g., the adjacency effect). The intrinsic limitations of the method are also considered, and it is concluded that the strengths of the discrete-ordinates finite-element method outweigh its weaknesses.

Gerstl, S. A. W.↗

NASA NTRS1985

A discrete control model of PLANT

A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

Mitchell, C. M.↗

NASA NTRS1988

Observability of discretized partial differential equations

It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

Cohn, Stephen E.↗

NASA NTRS1999

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

NASA NTRS2000

Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing

The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.

Jones, Robert L.↗