Search NASA⌕ Search

SEARCH · Search NASA

Results for “DISCRETE FUNCTION”

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 199 records · Page 11

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗

Polynomial Transformations For Discrete-Time Linear Systems

Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.

Baram, Yoram↗

The phase-integral method for radiative transfer problems with highly-peaked phase functions

Complete solutions to the radiative transfer equation, including both azimuth and depth dependence, are provided by the discrete-ordinate method of Chandrasekhar, but these solutions are often limited because of large computer requirements. This paper presents a 'phase-integral' method which greatly reduces the number of discrete ordinates needed in the solution for highly peaked phase functions. A composite quadrature method is shown to be effective in further reducing the number of discrete ordinates required for highly anisotropic phase functions. Examples are given to indicate convergence requirements and expected accuracy in the complete solution for Henyey-Greenstein and cloud-type phase functions.

Fricke, C. L.↗

Automated generation of influence functions for planar crack problems

A numerical procedure for the generation of influence functions for Mode I planar problems is described. The resulting influence functions are in a form for convenient evaluation of stress-intensity factors for complex stress distributions. Crack surface displacements are obtained by a least-squares solution of the Williams eigenfunction expansion for displacements in a cracked body. Discrete values of the influence function, evaluated using the crack surface displacements, are curve fit using an assumed functional form. The assumed functional form includes appropriate limit-behavior terms for very deep and very shallow cracks. Continuous representation of the influence function provides a convenient means for evaluating stress-intensity factors for arbitrary stress distributions by numerical integration. The procedure is demonstrated for an edge-cracked strip and a radially cracked disk. Comparisons with available published results demonstrate the accuracy of the procedure.

Sire, Robert A.↗

Velocity-space synthesis of ISEE-1 measurements of the three dimensional electron distribution function

A computer package which produces contour plots of the three dimensional electron distribution function measured by an electron spectrometer aboard ISEE-1 is described. Examples of the contour plots and an explanation of how to use the program, including the necessary computer code for running the program on the GSFC 360/91 computer is presented. The method by which the discrete measurements of the distribution function, given by points on the four dimensional surface are synthesized into a smooth surface in a three dimensional space which can be contoured is described. The velocity components are parallel and perpendicular to the magnetic field, respectively, in the proper frame of the electrons.

Fitzenreiter, R. J.↗

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.↗

Discrete event simulation and the resultant data storage system response in the operational mission environment of Jupiter-Saturn /Voyager/ spacecraft

The Data Storage Subsystem Simulator (DSSSIM) simulating (by ground software) occurrence of discrete events in the Voyager mission is described. Functional requirements for Data Storage Subsystems (DSS) simulation are discussed, and discrete event simulation/DSSSIM processing is covered. Four types of outputs associated with a typical DSSSIM run are presented, and DSSSIM limitations and constraints are outlined.

Mukhopadhyay, A. K.↗

Investigating the Numerical Stability of Using an Impedance Boundary Condition to Model Broadband Noise Scattering With Acoustic Liners

Reducing aircraft noise is a major objective in the field of computational aeroacoustics. When designing next generation quiet aircraft, it is important to be able to accurately and efficiently predict the acoustic scattering by an aircraft body from a given noise source. Acoustic liners are an effective tool for achieving aircraft noise reduction and are characterized by a frequency-dependent impedance value. Converted into the time-domain using Fourier transforms, an impedance boundary condition can be used to simulate the acoustic wave scattering by geometric bodies treated with acoustic liners. A Broadband Impedance Model will be discussed in which the liner impedance is specified along a wide range of frequencies. The liner impedance boundary condition will be derived and coupled with a time-domain boundary integral equation to model acoustic scattering by a flat plate consisting of both un-lined and lined surfaces. The scattering solution will be obtained iteratively using both spatial and temporal basis functions and the stability will be demonstrated through eigenvalue analysis. Stability will be assessed for its dependence on time step, spatial discretization, as well as temporal basis function order. Both second- and third-order Lagrange temporal basis functions are considered.

acoustics↗

Investigating the Numerical Stability of Using an Impedance Boundary Condition to Model Broadband Noise Scattering With Acoustic Liners

Reducing aircraft noise is a major objective in the field of computational aeroacoustics. When designing next generation quiet aircraft, it is important to be able to accurately and efficiently predict the acoustic scattering by an aircraft body from a given noise source. Acoustic liners are an effective tool for achieving aircraft noise reduction and are characterized by a frequency-dependent impedance value. Converted into the time-domain using Fourier transforms, an impedance boundary condition can be used to simulate the acoustic wave scattering by geometric bodies treated with acoustic liners. A Broadband Impedance Model will be discussed in which the liner impedance is specified along a wide range of frequencies. The liner impedance boundary condition will be derived and coupled with a time-domain boundary integral equation to model acoustic scattering by a flat plate consisting of both un-lined and lined surfaces. The scattering solution will be obtained iteratively using both spatial and temporal basis functions and the stability will be demonstrated through eigenvalue analysis. Stability will be assessed for its dependence on time step, spatial discretization, as well as temporal basis function order. Both second- and third-order Lagrange temporal basis functions are considered.

acoustics↗

Demonstration of prominent actin filaments in the root columella

The distribution of actin filaments within the gravity-sensing columella cells of plant roots remains poorly understood, with studies over numerous years providing inconsistent descriptions of actin organization in these cells. This uncertainty in actin organization, and thus in actin's role in graviperception and gravisignaling, has led us to investigate actin arrangements in the columella cells of Zea mays L., Medicago truncatula Gaertn., Linum usitatissiilium L. and Nicotianla benthamiana Domin. Actin organization was examined using a combination of optimized immunofluorescence techniques, and an improved fluorochrome-conjugated phalloidin labeling method reliant on 3-maleimidobenzoyl-N-hydroxy-succinimide ester (MBS) cross-linking combined with glycerol permeabilization. Confocal microscopy of root sections labeled with anti-actin antibodies revealed patterns suggestive of actin throughout the columella region. These patterns included short and fragmented actin bundles, fluorescent rings around amyloplasts and intense fluorescence originating from the nucleus. Additionally, confocal microscopy of MBS-stabilized and Alexa Fluor-phalloidin-labeled root sections revealed a previously undetected state of actin organization in the columella. Discrete actin structures surrounded the amyloplasts and prominent actin cables radiated from the nuclear surface toward the cell periphery. Furthermore, the cortex of the columella cells contained fine actin bundles (or single filaments) that had a predominant transverse orientation. We also used confocal microscopy of plant roots expressing endoplasmic reticulum (ER)-targeted green fluorescent protein to demonstrate rapid ER movements within the columella cells, suggesting that the imaged actin network is functional. The successful identification of discrete actin structures in the root columella cells forms the perception and signaling.

Non-NASA Center↗

G(sup 4)FET Implementations of Some Logic Circuits

Some logic circuits have been built and demonstrated to work substantially as intended, all as part of a continuing effort to exploit the high degrees of design flexibility and functionality of the electronic devices known as G(sup 4)FETs and described below. These logic circuits are intended to serve as prototypes of more complex advanced programmable-logicdevice-type integrated circuits, including field-programmable gate arrays (FPGAs). In comparison with prior FPGAs, these advanced FPGAs could be much more efficient because the functionality of G(sup 4)FETs is such that fewer discrete components are needed to perform a given logic function in G(sup 4)FET circuitry than are needed perform the same logic function in conventional transistor-based circuitry. The underlying concept of using G(sup 4)FETs as building blocks of programmable logic circuitry was also described, from a different perspective, in G(sup 4)FETs as Universal and Programmable Logic Gates (NPO-41698), NASA Tech Briefs, Vol. 31, No. 7 (July 2007), page 44. A G(sup 4)FET can be characterized as an accumulation-mode silicon-on-insulator (SOI) metal oxide/semiconductor field-effect transistor (MOSFET) featuring two junction field-effect transistor (JFET) gates. The structure of a G(sup 4)FET (see Figure 1) is the same as that of a p-channel inversion-mode SOI MOSFET with two body contacts on each side of the channel. The top gate (G1), the substrate emulating a back gate (G2), and the junction gates (JG1 and JG2) can be biased independently of each other and, hence, each can be used to independently control some aspects of the conduction characteristics of the transistor. The independence of the actions of the four gates is what affords the enhanced functionality and design flexibility of G(sup 4)FETs. The present G(sup 4)FET logic circuits include an adjustable-threshold inverter, a real-time-reconfigurable logic gate, and a dynamic random-access memory (DRAM) cell (see Figure 2). The configuration of the adjustable-threshold inverter is similar to that of an ordinary complementary metal oxide semiconductor (CMOS) inverter except that an NMOSFET (a MOSFET having an n-doped channel and a p-doped Si substrate) is replaced by an n-channel G(sup 4)FET

Mojarradi, Mohammad↗

Survey of multi-function display and control technology

The NASA orbiter spacecraft incorporates a complex array of systems, displays and controls. The incorporation of discrete dedicated controls into a multi-function display and control system (MFDCS) offers the potential for savings in weight, power, panel space and crew training time. The technology applicable to the development of a MFDCS for orbiter application is surveyed. Technology thought to be applicable presently or in the next five years is highlighted. Areas discussed include display media, data handling and processing, controls and operator interactions and the human factors considerations which are involved in a MFDCS design. Several examples of applicable MFDCS technology are described.

Spiger, R. J.↗

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗

Calculation of power spectrums from digital time series with missing data points

Two algorithms are developed for calculating power spectrums from the autocorrelation function when there are missing data points in the time series. Both methods use an average sampling interval to compute lagged products. One method, the correlation function power spectrum, takes the discrete Fourier transform of the lagged products directly to obtain the spectrum, while the other, the modified Blackman-Tukey power spectrum, takes the Fourier transform of the mean lagged products. Both techniques require fewer calculations than other procedures since only 50% to 80% of the maximum lags need be calculated. The algorithms are compared with the Fourier transform power spectrum and two least squares procedures (all for an arbitrary data spacing). Examples are given showing recovery of frequency components from simulated periodic data where portions of the time series are missing and random noise has been added to both the time points and to values of the function. In addition the methods are compared using real data. All procedures performed equally well in detecting periodicities in the data.

Murray, C. W., Jr.↗

Variable-Domain Displacement Transfer Functions for Converting Surface Strains into Deflections for Structural Deformed Shape Predictions

Variable-Domain Displacement Transfer Functions were formulated for shape predictions of complex wing structures, for which surface strain-sensing stations must be properly distributed to avoid jointed junctures, and must be increased in the high strain gradient region. Each embedded beam (depth-wise cross section of structure along a surface strain-sensing line) was discretized into small variable domains. Thus, the surface strain distribution can be described with a piecewise linear or a piecewise nonlinear function. Through discretization, the embedded beam curvature equation can be piece-wisely integrated to obtain the Variable-Domain Displacement Transfer Functions (for each embedded beam), which are expressed in terms of geometrical parameters of the embedded beam and the surface strains along the strain-sensing line. By inputting the surface strain data into the Displacement Transfer Functions, slopes and deflections along each embedded beam can be calculated for mapping out overall structural deformed shapes. A long tapered cantilever tubular beam was chosen for shape prediction analysis. The input surface strains were analytically generated from finite-element analysis. The shape prediction accuracies of the Variable- Domain Displacement Transfer Functions were then determined in light of the finite-element generated slopes and deflections, and were fofound to be comparable to the accuracies of the constant-domain Displacement Transfer Functions

displacement transfer functions↗

Finite element solution for energy conservation using a highly stable explicit integration algorithm

Theoretical derivation of a finite element solution algorithm for the transient energy conservation equation in multidimensional, stationary multi-media continua with irregular solution domain closure is considered. The complete finite element matrix forms for arbitrarily irregular discretizations are established, using natural coordinate function representations. The algorithm is embodied into a user-oriented computer program (COMOC) which obtains transient temperature distributions at the node points of the finite element discretization using a highly stable explicit integration procedure with automatic error control features. The finite element algorithm is shown to posses convergence with discretization for a transient sample problem. The condensed form for the specific heat element matrix is shown to be preferable to the consistent form. Computed results for diverse problems illustrate the versatility of COMOC, and easily prepared output subroutines are shown to allow quick engineering assessment of solution behavior.

Baker, A. J.↗

Vision based obstacle detection and grouping for helicopter guidance

Electro-optical sensors can be used to compute range to objects in the flight path of a helicopter. The computation is based on the optical flow/motion at different points in the image. The motion algorithms provide a sparse set of ranges to discrete features in the image sequence as a function of azimuth and elevation. For obstacle avoidance guidance and display purposes, these discrete set of ranges, varying from a few hundreds to several thousands, need to be grouped into sets which correspond to objects in the real world. This paper presents a new method for object segmentation based on clustering the sparse range information provided by motion algorithms together with the spatial relation provided by the static image. The range values are initially grouped into clusters based on depth. Subsequently, the clusters are modified by using the K-means algorithm in the inertial horizontal plane and the minimum spanning tree algorithms in the image plane. The object grouping allows interpolation within a group and enables the creation of dense range maps. Researchers in robotics have used densely scanned sequence of laser range images to build three-dimensional representation of the outside world. Thus, modeling techniques developed for dense range images can be extended to sparse range images. The paper presents object segmentation results for a sequence of flight images.

Sridhar, Banavar↗