Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discrete”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

On equivalence of discrete-discrete and continuum-discrete design sensitivity analysis

Developments in design sensitivity analysis (DSA) method have been made using two fundamentally different approaches as shown. In the first approach, a discretized structural finite element model is used to carry out DSA. There are three different methods in the discrete DSA approach: finite difference, semi-analytical, and analytical methods. The finite difference method is a popular one due to its simplicity, but a serious shortcoming of the method is the uncertainty in the choice of a perturbation step size of design variables. In the semi-analytical method, the derivatives of stiffness matrix is computed by finite differences, whereas in the analytical method, the derivatives are obtained analytically. For the shape design variable, computation of analytical derivative of stiffness matrix is quite costly. Because of this, the semi-analytical method is a popular choice in discrete shape DSA approach. However, recently, Barthelemy and Haftka presented that the semi-analytical method can have serious accuracy problems for shape design variables in structures modeled by beam, plate, truss, frame, and solid elements. They found that accuracy problems occur even for a simple cantilever beam. In the second approach, a continuum model of the structure is used to carry out DSA.

Choi, Kyung K.↗
NASA NTRS2016

First-Principles Modeling Of Electromagnetic Scattering By Discrete and Discretely Heterogeneous Random Media

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell- Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of the first principles formalism enabling accurate calculations of monochromatic and quasi-monochromatic scattering by static and randomly varying multiparticle groups. We illustrate how this general framework can be coupled with state-of-the-art computer solvers of the Maxwell equations and applied to direct modeling of electromagnetic scattering by representative random multi-particle groups with arbitrary packing densities. This first-principles modeling yields general physical insights unavailable with phenomenological approaches. We discuss how the first-order-scattering approximation, the radiative transfer theory, and the theory of weak localization of electromagnetic waves can be derived as immediate corollaries of the Maxwell equations for very specific and well-defined kinds of particulate medium. These recent developments confirm the mesoscopic origin of the radiative transfer, weak localization, and effective-medium regimes and help evaluate the numerical accuracy of widely used approximate modeling methodologies.

Michael I Mishchenko↗
NASA NTRS2004

Radiative Transfer Modeling of a Large Pool Fire by Discrete Ordinates, Discrete Transfer, Ray Tracing, Monte Carlo and Moment Methods

Five computational methods for solution of the radiative transfer equation in an absorbing-emitting and non-scattering gray medium were compared on a 2 m JP-8 pool fire. The temperature and absorption coefficient fields were taken from a synthetic fire due to the lack of a complete set of experimental data for fires of this size. These quantities were generated by a code that has been shown to agree well with the limited quantity of relevant data in the literature. Reference solutions to the governing equation were determined using the Monte Carlo method and a ray tracing scheme with high angular resolution. Solutions using the discrete transfer method, the discrete ordinate method (DOM) with both S(sub 4) and LC(sub 11) quadratures, and moment model using the M(sub 1) closure were compared to the reference solutions in both isotropic and anisotropic regions of the computational domain. DOM LC(sub 11) is shown to be the more accurate than the commonly used S(sub 4) quadrature technique, especially in anisotropic regions of the fire domain. This represents the first study where the M(sub 1) method was applied to a combustion problem occurring in a complex three-dimensional geometry. The M(sub 1) results agree well with other solution techniques, which is encouraging for future applications to similar problems since it is computationally the least expensive solution technique. Moreover, M(sub 1) results are comparable to DOM S(sub 4).

Jensen, K. A.↗
NASA NTRS2017

Modeling of Electromagnetic Scattering by Discrete and Discretely Heterogeneous Random Media by Using Numerically Exact Solutions of the Maxwell Equations

In this paper, we discuss some aspects of numerical modeling of electromagnetic scattering by discrete random medium by using numerically exact solutions of the macroscopic Maxwell equations. Typical examples of such media are clouds of interstellar dust, clouds of interplanetary dust in the Solar system, dusty atmospheres of comets, particulate planetary rings, clouds in planetary atmospheres, aerosol particles with numerous inclusions and so on. Our study is based on the results of extensive computations of different characteristics of electromagnetic scattering obtained by using the superposition T-matrix method which represents a direct computer solver of the macroscopic Maxwell equations for an arbitrary multisphere configuration. As a result, in particular, we clarify the range of applicability of the low-density theories of radiative transfer and coherent backscattering as well as of widely used effective-medium approximations.

Dlugach, Janna M.↗
NASA NTRS1975

Time bases, discretes, and interrupts

The effort performed to assure proper flight program handling of time bases, discretes, and interrupts was discussed. The following time bases are used as key mission events: guidance reference release, liftoff, S-1B low level sensors dry, S-1B outboard engines cutoff, S-IVB cutoff, and S-IVB de-orbit DCS command. The five discrete outputs in the discrete output register were verified for proper setting. Each discrete input is honored in the proper time frame by forcing each discrete in the following intervals: before the discrete is enabled, after the discrete has been detected, and after the discrete has been disabled. As an assurance that an interrupt is honored only in the proper time frames, each interrupt was forced during the following intervals: prior to the specified enable time, after the interrupt has been honored, after the interrupt has been disabled.

Source record↗
NASA NTRS2002

Bell-Curve Genetic Algorithm for Mixed Continuous and Discrete Optimization Problems

In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.

Kincaid, Rex K.↗
NASA NTRS1979

Choice of method for discretization of continuous systems

The paper discusses and compares several common methods of discretizing the transfer function of a continuous control system so that a digital computer can be used. The discretization effect on the frequency response attenuation of the simple transfer function G(s) = 1/(s + 1) is illustrated for the Tusting, Boxer-Thaler, Madwed, linear segment approximation, and stair-step with half period advanced methods. The input frequency must be significantly lower than one-half the sampling error to have negligible discretization error. Phase differences due to discretization are also plotted, and it is seen that the zero-order hold contributes much more phase shift than that due to discretization. In situations where zero-order hold must follow a computer, the method of discretization of a continuous system is not a major factor if phase shift is important.

Mcvey, E. S.↗
NASA NTRS1989

On discrete control of nonlinear systems with applications to robotics

Much progress has been reported in the areas of modeling and control of nonlinear dynamic systems in a continuous-time framework. From implementation point of view, however, it is essential to study these nonlinear systems directly in a discrete setting that is amenable for interfacing with digital computers. But to develop discrete models and discrete controllers for a nonlinear system such as robot is a nontrivial task. Robot is also inherently a variable-inertia dynamic system involving additional complications. Not only the computer-oriented models of these systems must satisfy the usual requirements for such models, but these must also be compatible with the inherent capabilities of computers and must preserve the fundamental physical characteristics of continuous-time systems such as the conservation of energy and/or momentum. Preliminary issues regarding discrete systems in general and discrete models of a typical industrial robot that is developed with full consideration of the principle of conservation of energy are presented. Some research on the pertinent tactile information processing is reviewed. Finally, system control methods and how to integrate these issues in order to complete the task of discrete control of a robot manipulator are also reviewed.

Eslami, Mansour↗
NASA NTRS2010

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗
NASA NTRS2023

Interactions Between Thresholds and Spatial Discretizations of Snow: Insights From Estimates of Wolverine Denning Habitat in the Colorado Rocky Mountains

Thresholds can be used to interpret environmental data in a way that is easily communicated and useful for decision making purposes. However, thresholds are often developed for specific data products and time periods, changing findings when the same threshold is applied to datasets or periods with different characteristics. Here, we test the impact of different spatial discretizations of snow on annual estimates of wolverine denning opportunities in the Colorado Rocky Mountains, defined using a snow water equivalent (SWE) threshold (0.20 m) and threshold date (15 May) from previous habitat assessments. Annual potential wolverine denning area (PWDA) was thresholded from a 36-year (1985 – 2020) snow reanalysis model with three different spatial discretizations: 1) 480 m grid cells (D480), 2) 90 m grid cells (D90), and 3) 480 m grid cells with implicit representations of subgrid snow spatial heterogeneity (S480). Relative to the D480 and S480 discretizations, D90 resolved shallower snow deposits on slopes between 3050 and 3350 m elevation, decreasing PWDA by 10%, on average. In years with warmer and/or drier winters, S480 discretizations with subgrid representations of snow heterogeneity increased PWDA, even within grid cells where mean 15 May SWE was less than the SWE threshold. These simulations increased PWDA by upwards of 30% in low snow years, as compared to the D480 and D90 simulations without subgrid snow heterogeneity. Despite PWDA sensitivity to different snow spatial discretizations, PWDA was controlled more by annual variations in winter precipitation and temperature. However, small changes to the SWE threshold (± 0.07 m) and threshold date (± 2 weeks) also affected PWDA by as much as 82%. Across these threshold ranges, PWDA was approximately 18% more sensitive to the SWE threshold than the threshold date. However, the sensitivity to the threshold date was larger in years with late spring snowfall, when PWDA depended on whether modeled SWE was thresholded before, during, or after spring snow accumulation. Our results demonstrate that snow thresholds are useful but may not always provide a complete picture of the annual variability in snow-adapted wildlife denning opportunities. Studies thresholding spatiotemporal datasets could be improved by including 1) information about the fidelity of thresholds across multiple spatial discretizations, and 2) uncertainties related to ranges of realistic thresholds.

Justin M. Pflug↗
NASA NTRS1980

Discrete-continuous variable structural synthesis using dual methods

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Schmit, L. A.↗
NASA NTRS1992

Discrete modes and continuous spectra in supersonic boundary layers

The disturbance field induced due to a harmonic point source consists of discrete eigenmodes and a continuous spectrum; these are studied by using generalized Fourier transform techniques. For a supersonic boundary layer, there exist seven branches of the continuous spectrum in the complex wavenumber space, four of which (two acoustic waves, one vorticity wave and one entropy wave) contribute to the flowfield downstream of the source. The discrete eigenmodes spring off from these branches at some critical Reynolds numbers. The results for Mach 2 and 4.5 boundary layers show that the receptivity coefficients for the stable discrete modes are much larger than that for the unstable mode. Therefore, the flow very near the source is dominated by the continuous spectrum and the stable discrete modes. However, the unstable mode takes over sufficiently far away from the source. It is shown that it is only necessary to consider the first few discrete modes to construct the solution. Calculations also show that, in a supersonic boundary layer, upstream influence from a localized disturbance is minimal.

Balakumar, P.↗
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↗