SEARCH · Search NASA

Results for “Domain decomposition”

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 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Global models: Robot sensing, control, and sensory-motor skills

Robotics research has begun to address the modeling and implementation of a wide variety of unstructured tasks. Examples include automated navigation, platform servicing, custom fabrication and repair, deployment and recovery, and science exploration. Such tasks are poorly described at onset; the workspace layout is partially unfamiliar, and the task control sequence is only qualitatively characterized. The robot must model the workspace, plan detailed physical actions from qualitative goals, and adapt its instantaneous control regimes to unpredicted events. Developing robust representations and computational approaches for these sensing, planning, and control functions is a major challenge. The underlying domain constraints are very general, and seem to offer little guidance for well-bounded approximation of object shape and motion, manipulation postures and trajectories, and the like. This generalized modeling problem is discussed, with an emphasis on the role of sensing. It is also discussed that unstructured tasks often have, in fact, a high degree of underlying physical symmetry, and such implicit knowledge should be drawn on to model task performance strategies in a methodological fashion. A group-theoretic decomposition of the workspace organization, task goals, and their admissible interactions are proposed. This group-mechanical approach to task representation helps to clarify the functional interplay of perception and control, in essence, describing what perception is specifically for, versus how it is generically modeled. One also gains insight how perception might logically evolve in response to needs of more complex motor skills. It is discussed why, of the many solutions that are often mathematically admissible to a given sensory motor-coordination problem, one may be preferred over others.

Schenker, Paul S.↗

NASA NTRS1997

An Algorithm for Integrated Subsystem Embodiment and System Synthesis

Consider the statement,'A system has two coupled subsystems, one of which dominates the design process. Each subsystem consists of discrete and continuous variables, and is solved using sequential analysis and solution.' To address this type of statement in the design of complex systems, three steps are required, namely, the embodiment of the statement in terms of entities on a computer, the mathematical formulation of subsystem models, and the resulting solution and system synthesis. In complex system decomposition, the subsystems are not isolated, self-supporting entities. Information such as constraints, goals, and design variables may be shared between entities. But many times in engineering problems, full communication and cooperation does not exist, information is incomplete, or one subsystem may dominate the design. Additionally, these engineering problems give rise to mathematical models involving nonlinear functions of both discrete and continuous design variables. In this dissertation an algorithm is developed to handle these types of scenarios for the domain-independent integration of subsystem embodiment, coordination, and system synthesis using constructs from Decision-Based Design, Game Theory, and Multidisciplinary Design Optimization. Implementation of the concept in this dissertation involves testing of the hypotheses using example problems and a motivating case study involving the design of a subsonic passenger aircraft.

Lewis, Kemper↗

NASA NTRS1998

A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft

The New Millennium Remote Agent (NMRA) will be the first AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic recoveries and robust concurrent execution, all in the presence of tight real-time deadlines, changing goals, scarce resource constraints, and a wide variety of possible failures. To achieve this level of execution robustness, we have integrated a procedural executive based on generic procedures with a deductive model-based executive. A procedural executive provides sophisticated control constructs such as loops, parallel activity, locks, and synchronization which are used for robust schedule execution, hierarchical task decomposition, and routine configuration management. A deductive executive provides algorithms for sophisticated state inference and optimal failure recover), planning. The integrated executive enables designers to code knowledge via a combination of procedures and declarative models, yielding a rich modeling capability suitable to the challenges of real spacecraft control. The interface between the two executives ensures both that recovery sequences are smoothly merged into high-level schedule execution and that a high degree of reactivity is retained to effectively handle additional failures during recovery.

Pell, Barney↗

NASA NTRS1995

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗

DOE OSTI2025

Tale of Two Domains: Cyber - Physical

As devices and systems continue to modernize and adopt integrated circuits, the use of cyber technology to deploy an application is the expectation. This deployment through cyber assets brings new cyber risk and cybersecurity is the practice of managing this risk. Cyber-risk is constantly changing due to the speed of technology advancement and the changing quality of the adversary. Cyber-Informed Engineering (CIE) mitigates cyber-risk through engineering controls where as the traditional practice of cybersecurity mitigates cyber-risk through cybersecurity controls. By clearly defining the cyber-physical boundary, engineering controls and cybersecurity controls can clearly demonstrate their complementary nature to provide layered defenses and successfully mitigate cyber-risk through independent controls. In this paper, a layered model of device decomposition of the the cyber-physical boundary is presented to provide clarity where engineering controls are used to reduce cyber-risk within the physics, functional materials, electronic, or integrated circuit layers and where cybersecurity controls are used to reduce cyber-risk within the machine code and application layers. By implementing both traditional cybersecurity controls and engineering controls, a more holistic approach to cybersecurity is achieved in protecting modern devices and systems, as well as a clear awareness in identifying, documenting, and authorizing the system’s cybersecurity protection scheme is achieved.

42 - ENGINEERING↗

NASA NTRS1991

An equivalent domain integral method for three-dimensional mixed-mode fracture problems

A general formulation of the equivalent domain integral (EDI) method for mixed mode fracture problems in cracked solids is presented. The method is discussed in the context of a 3-D finite element analysis. The J integral consists of two parts: the volume integral of the crack front potential over a torus enclosing the crack front and the crack surface integral due to the crack front potential plus the crack face loading. In mixed mode crack problems the total J integral is split into J sub I, J sub II, and J sub III representing the severity of the crack front in three modes of deformations. The direct and decomposition methods are used to separate the modes. These two methods were applied to several mixed mode fracture problems, were analyzed, and results were found to agree well with those available in the literature. The method lends itself to be used as a post-processing subroutine in a general purpose finite element program.

Shivakumar, K. N.↗

NASA NTRS1992

An equivalent domain integral method for three-dimensional mixed-mode fracture problems

Shivakumar, K. N.↗

NASA NTRS1988

Subharmonic resonance in a mixing layer

The subharmonic resonance phenomenon in a spatially evolving mixing layer is studied using direct simulations of the 2-D Navier-Stokes equations. The computational domain extends to + or - infinity in the cross-stream direction with U(1) = 1.25 and U(2) = 0.25 imposed at + infinity and - infinity respectively. The domain is finite in the streamwise direction with inflow and outflow boundary conditions imposed at x/delta sub omega = 0 and 100, respectively. A hyperbolic-tangent mean velocity profile is assumed at the inlet and the Reynolds number based on the inlet vorticity thickness and velocity difference is Re = 600. It is observed that the phase angle between the fundamental and its subharmonic plays a key role in the spatial development of these modes. Contour plots of vorticity show that varying the phase will have a dramatic effect on the dynamics of the vortices. Pairing or shredding is observed depending on the phase. Fourier decomposition of the time traces show that the fundamental grows, saturates and decays with the downstream distance. The subharmonic has a similar behavior. However, the level at which the modes will saturate is affected by the phase. At 0 deg phase, it was found that as the fundamental saturates, the growth rate of the subharmonic is enhanced. At 90 deg phase, it was found that as the fundamental saturates, the growth rate of the subharmonic is inhibited. In the later case, the growth rate of the subharmonic recovers after saturation of the fundamental. These results are in qualitative agreement with experimental data.

Mansour, N. N.↗

NASA NTRS1985

The numerical simulation of steady transonic rotational flow using a dual potential formulation

A finite-difference method is presented that simulates steady transonic rotational flow of an inviscid fluid by representing the velocity field as the sum of scalar and vector potentials. This dual potential velocity decomposition extends the validity of the scalar (full) velocity potential to include vorticity. The inclusion of a vector potential also permits an alternate treatment of lift that does not require a circulation wake cut. This is accomplished by specifying the vector potential as a constant on the airfoil surface in order to satisfy a Kutta condition. The governing equations are solved as iteratively decoupled scalar equations using approximate factorization techniques, and the overall efficiency approaches that of the full potential equation. The governing equations are able to convect entropy and vorticity throughout the flow field and are equivalent to the Euler equations in continuous flow domains, however at shocks the Rankine-Hugoniot entropy jump must be supplied. An entropy correction method is presented and verified with transonic airfoil solutions of the Euler equations.

Chaderjian, N. M.↗

NASA NTRS1989

Direct simulation of compressible turbulence

Several direct simulations of 3-D homogeneous, compressible turbulence are presented with emphasis on the differences with incompressible turbulent simulations. A fully spectral collocation algorithm, periodic in all directions coupled with a 3rd order Runge-Kutta time discretization scheme is sufficient to produce well-resolved flows at Taylor Reynolds numbers below 40 on grids of 128x128x128. A Helmholtz decomposition of velocity is useful to differentiate between the purely compressible effects and those effects solely due to vorticity production. In the context of homogeneous flows, this decomposition in unique. Time-dependent energy and dissipation spectra of the compressible and solenoidal velocity components indicate the presence of localized small scale structures. These structures are strongly a function of the initial conditions. Researchers concentrate on a regime characterized by very small fluctuating Mach numbers Ma (on the order of 0.03) and density and temperature fluctuations much greater than sq Ma. This leads to a state in which more than 70 percent of the kinetic energy is contained in the so-called compressible component of the velocity. Furthermore, these conditions lead to the formation of curved weak shocks (or shocklets) which travel at approximately the sound speed across the physical domain. Various terms in the vorticity and divergence of velocity production equations are plotted versus time to gain some understanding of how small scales are actually formed. Possible links with Burger turbulence are examined. To visualize better the dynamics of the flow, new graphic visualization techniques have been developed. The 3-D structure of the shocks are visualized with the help of volume rendering algorithms developed in-house. A combination of stereographic projection and animation greatly increase the number of visual cues necessary to properly interpret the complex flow.

Zang, T. A.↗

NASA NTRS1993

Interannual Sea Level Variations in the Tropical Indian Ocean from Geosat and Shallow Water Simulations

Sea level variations of the Indian Ocean north of 20 deg S are analyzed from Geosat satellite altimeter data over April 1985-September 1989. These variations are compared and interpreted with numerical simulations derived from a reduced gravity model forced by FSU observed winds over the same period. After decomposition into complex empirical orthogonal functions, the low-frequency anomalies are described by the first two modes for observations as well as for simulations. The sums of the two modes contain 34% and 40% of the observed and simulated variances, respectively. Averaged over the basin, the observed and simulated sea level changes are correlated by 0.92 over 1985-1988. The strongest change happens during the El Ninio 1986-1987: between winter 1986 and summer 1987 the basin-averaged sea level rises by approx. 1 cm. These low-frequency variations can partly be explained by changes in the Sverdrup circulation. The southern tropical Indian Ocean between 1O deg and 20 deg S is the domain where those changes are strongest: the averaged sea level rises by approx. 4.5 cm between winter 1986 and winter 1987. There, the signal propagates southwestward across the basin at a speed similar to free Rossby waves. Sensitivity of observed anomalies is examined over 1987-1988, with different orbit ephemeris, tropospheric corrections, and error reduction processes. The uncertainty of the basin-averaged sea level estimates is mostly due to the way the orbit error is reduced and reaches approx. 1 cm. Nonetheless, spatial correlation is good between the various observations and better than between observations and simulations. Sensitivity of simulated anomalies to the wind uncertainty, examined with Former Soviet Union (FSU) and European Center for Medium-Range Weather Forecasting (ECMWF) forcings over 1985-1988, shows that the variance of the simulations driven by ECMWF is 52% smaller, as FSU winds are stronger than ECMWF. Results show that the wind strength also affects the dynamic response of the ocean: anomalies propagate westward across the basin more than twice as fast with FSU than with ECMWF. It is found that the discrepancy is larger between ECMWF and FSU simulations than between observations and FSU simulations.

Perigaud, Claire↗

NASA NTRS2011

Feature Acquisition with Imbalanced Training Data

This work considers cost-sensitive feature acquisition that attempts to classify a candidate datapoint from incomplete information. In this task, an agent acquires features of the datapoint using one or more costly diagnostic tests, and eventually ascribes a classification label. A cost function describes both the penalties for feature acquisition, as well as misclassification errors. A common solution is a Cost Sensitive Decision Tree (CSDT), a branching sequence of tests with features acquired at interior decision points and class assignment at the leaves. CSDT's can incorporate a wide range of diagnostic tests and can reflect arbitrary cost structures. They are particularly useful for online applications due to their low computational overhead. In this innovation, CSDT's are applied to cost-sensitive feature acquisition where the goal is to recognize very rare or unique phenomena in real time. Example applications from this domain include four areas. In stream processing, one seeks unique events in a real time data stream that is too large to store. In fault protection, a system must adapt quickly to react to anticipated errors by triggering repair activities or follow- up diagnostics. With real-time sensor networks, one seeks to classify unique, new events as they occur. With observational sciences, a new generation of instrumentation seeks unique events through online analysis of large observational datasets. This work presents a solution based on transfer learning principles that permits principled CSDT learning while exploiting any prior knowledge of the designer to correct both between-class and withinclass imbalance. Training examples are adaptively reweighted based on a decomposition of the data attributes. The result is a new, nonparametric representation that matches the anticipated attribute distribution for the target events.

Thompson, David R.↗

DOE OSTI2026

Composite-dimensional topological codes with boundaries and defects

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and 0D defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing nontranslationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of ℤ4 is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our codes' performance with that of standard surface codes. To do so, we introduce a composite-dimensional belief-propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for higher-dimensional codes to be discovered and implemented in near-future architectures that take advantage of various hardware platforms.

Mousa, Mohamad [Purdue University]↗

DOE OSTI2026

Rapidity-dependent spin decomposition of the nucleon

We revisit the two-dimensional Fourier transform of generalized parton distributions (GPDs) at nonzero skewness. At 𝜂 = 0 it reduces to the standard impact-parameter density, while at 𝜂 ≠ 0 it is an off-forward amplitude that we interpret as a genuine parton–nucleon correlation. Its overall strength (the transverse-plane integral of the density) is fixed by the GPD at the kinematic point 𝑡 =−𝑐 𝜂 =−4⁢𝜂 2 ⁢𝑚$^{2}_{𝑁}$/(1 − 𝜂 2 ) and decreases monotonically with the rapidity gap Δ⁢𝑦 = ln⁡[(1+𝜂)/(1−𝜂)] = 2 artanh⁡(𝜂). This rapidity dependence implies rapidity-modified Ji identities that connect helicity, orbital, and total angular momenta of the correlation in closed form. To quantify these effects, we construct leading-twist quark and gluon GPDs in a string-based conformal framework: conformal moments are parametrized by linear open- and closed-string Regge trajectories with slopes constrained by parton distribution functions (PDFs), hadron/glueball spectroscopy, and form-factor data, and GPDs are reconstructed over the full (𝑥,𝜂,𝑡) domain by Mellin-Barnes inversion with next-to-leading order evolution. We find qualitative agreement (and fair quantitative agreement within quoted uncertainties) for several moments and selected nonsinglet 𝑥-space channels at 𝜇 = 2 GeV when compared with lattice QCD, while we also identify channels with visible tension and discuss likely sources (PDF priors and 𝑡-slope systematics).

Gauge-gravity dualities↗

NASA NTRS2010

ICER-3D Hyperspectral Image Compression Software

Software has been developed to implement the ICER-3D algorithm. ICER-3D effects progressive, three-dimensional (3D), wavelet-based compression of hyperspectral images. If a compressed data stream is truncated, the progressive nature of the algorithm enables reconstruction of hyperspectral data at fidelity commensurate with the given data volume. The ICER-3D software is capable of providing either lossless or lossy compression, and incorporates an error-containment scheme to limit the effects of data loss during transmission. The compression algorithm, which was derived from the ICER image compression algorithm, includes wavelet-transform, context-modeling, and entropy coding subalgorithms. The 3D wavelet decomposition structure used by ICER-3D exploits correlations in all three dimensions of sets of hyperspectral image data, while facilitating elimination of spectral ringing artifacts, using a technique summarized in "Improving 3D Wavelet-Based Compression of Spectral Images" (NPO-41381), NASA Tech Briefs, Vol. 33, No. 3 (March 2009), page 7a. Correlation is further exploited by a context-modeling subalgorithm, which exploits spectral dependencies in the wavelet-transformed hyperspectral data, using an algorithm that is summarized in "Context Modeler for Wavelet Compression of Hyperspectral Images" (NPO-43239), which follows this article. An important feature of ICER-3D is a scheme for limiting the adverse effects of loss of data during transmission. In this scheme, as in the similar scheme used by ICER, the spatial-frequency domain is partitioned into rectangular error-containment regions. In ICER-3D, the partitions extend through all the wavelength bands. The data in each partition are compressed independently of those in the other partitions, so that loss or corruption of data from any partition does not affect the other partitions. Furthermore, because compression is progressive within each partition, when data are lost, any data from that partition received prior to the loss can be used to reconstruct that partition at lower fidelity. By virtue of the compression improvement it achieves relative to previous means of onboard data compression, this software enables (1) increased return of hyperspectral scientific data in the presence of limits on the rates of transmission of data from spacecraft to Earth via radio communication links and/or (2) reduction in spacecraft radio-communication power and/or cost through reduction in the amounts of data required to be downlinked and stored onboard prior to downlink. The software is also suitable for compressing hyperspectral images for ground storage or archival purposes.

Xie, Hua↗

NASA NTRS1992

Near-wall reconstruction of higher order moments and length scales using the POD

An analysis of the near-wall behavior of the proper orthogonal decomposition (POD) eigenfunctions derived from direct numerical simulation (DNS) of channel flow is performed. Consistent with previous studies, a low order multi-mode reconstruction of the kinetic energy and Reynolds shear stress suffices. A similar reconstruction of the isotropic dissipation rate is shown to be insufficient, however. An analysis is performed of the multi-mode composition of the dissipation rate in the near-wall region, and it is shown that a significant number of higher-order modes are required to achieve the correct asymptotic consistency in the near-wall region. In an attempt to avoid this problem, a length scale definition is proposed in terms of an integration of the correlation tensor which factors in the presence of the wall. The wall is accounted for by only integrating out to 2y(+) and not over the entire domain. Viscous and inviscid estimates for the dissipation were used in the near-wall and core regions respectively, in conjunction with this length scale representation to obtain an estimate of the dissipation throughout the domain. The resulting dissipation exhibits the proper behavior near the wall and in the inertial layer. A 1 POD mode estimate of the length scale is computed and found to agree quite well with the length scale obtained when the entire correlation tensor is used.

Glauser, Mark N.↗

NASA NTRSDate not supplied

Stability Analysis of the Flow Over a Swept Forward-Facing Step Using PIV Base Flows

Step excrescences are a type of surface imperfection encountered on swept wings of commercial aircraft, commonly because accessibility requirements prevent creating the wing’s surface from a single panel. If the step height is too large, super-critical, the flow can undergo an early transition to turbulence, which can be highly detrimental for the performance of the wing. In the case of a forward-facing step on a swept wing in a low-disturbance environment, stationary crossflow vortices can develop a significant amplitude upstream of the step and hence dominate the structure of the boundary-layer flow over the step. The main goal of the present investigation is to illuminate the path to transition supported by the fascinatingly complex flow field in the direct downstream vicinity of a step with a super critical height. The high-resolution, stereographic Particle Image Velocimetry (PIV) measurement dataset presently available for this flow field provides a complete description of the laminar flow for the execution of BiGlobal stability analysis in a plane parallel to the step. Although the notorious sensitivity of stability results to the description of the base flow demands a very careful uncertainty analysis of those results, it is argued that this very fact can be leveraged to produce new insight into the supported perturbation dynamics. In performing the analysis, several unsteady mode families are discovered that display the explosive perturbation expected for early transition to be induced. In considering domain widths equal to an integer-multiple of the incident crossflow-vortex wavelength and analyzing an extent of 5 crossflow-vortex wavelengths parallel to the step, it is found that the stability results converge while increasing the domain width. It is demonstrated, moreover, that the results for the wider domains can be approximated by appropriately averaging the results on neighboring single-crossflow-vortex-wavelength domains covering the same region. Besides being useful for computational purposes, this observed property suggests interpreting the instability mechanism as a distorted primary mechanism rather than a “proper” secondary mechanism. This follows in the context of the secondary in-stability analysis of three-dimensional boundary layers, because the secondary mechanism is usually characterized by being localized in a pocket of strong shear, while the distorted primary mechanism typically has an infinite support in the direction parallel to the step. Even though the growth rates are found to be sensitive to the interrogation-window size inherent to the PIV post-processing procedure, the spatial structure of the eigenfunctions is found to be relatively insensitive. Lastly, the spatial structure of the eigenfunctions corresponding to all velocity components are matched with the shape functions determined by computing the Spectral Proper Orthogonal Decomposition (SPOD) of a time-resolved measurement of the perturbation content.

forward-facing step↗

NASA NTRS2005

Efficient Credit Assignment through Evaluation Function Decomposition

Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.

Agogino, Adrian↗