Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hierarchy problem”

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 379 records · Page 21

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗

Design of Flight Vehicle Management Systems

As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possess much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.

Meyer, George↗

Nonlinear Control and Discrete Event Systems

As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possesses much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.

Meyer, George↗

New Approach to the {mu}-B{sub {mu}} Problem of Gauge-Mediated Supersymmetry Breaking

We present a new approach to the {mu}-B{sub {mu}} problem of gauge-mediated supersymmetry breaking. Rather than reducing the generically large contribution to B{sub {mu}} we point out that acceptable electroweak symmetry breaking can be achieved with {mu}{sup 2}<<B{sub {mu}} if at the same time B{sub {mu}}<<m{sub H{sub d}}{sup 2}. This hierarchy can easily appear in models where the Higgs fields are directly coupled to the supersymmetry breaking sector. Such models can yield novel electroweak symmetry breaking vacua, can deal with the supersymmetric flavor and CP problems, allow for gauge coupling unification, and result in distinct phenomenological predictions for the spectrum of superparticles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Spatial Correlations of the Poisson Model for Radiation Transport

Characterizing the relationship between bulk physical properties and mixing in randomly heterogeneous media is a central challenge across many areas of science and engineering. A benchmark model for such studies is the Poisson model, a random tessellation of space by a Poisson process of hyperplanes. In radiation transport studies, the lack of exact expressions for the Poisson model’s spatial multipoint functions has led to approximate methods being used, introducing unquantified sources of error. Here, we recently introduced an exact solution for the Poisson model’s multipoint functions and closely related conditional probability functions (CPFs), providing a new opportunity to understand and reduce these sources of error. In this paper, we enable a more rigorous investigation of radiation transport in stochastic media by applying the recently introduced exact solution for the Poisson model’s CPFs. This paper consists of three main contributions. First, we introduce a unified framework for CPFs of the Poisson model, encompassing the recently introduced exact CPFs as well as the previously introduced atomic mix, nearest-neighbor, and combination CPFs. This framework also includes existing pruning techniques for the approximate CPFs, such as angular exclusion, as well as a novel form of angular exclusion suitable for the exact CPFs. Second, we use the exact CPFs to characterize the spatial regions where each approximate three-point CPF is most accurate, thereby explaining the observed hierarchy of accuracy among the approximate models. Finally, we evaluate material transmittance, reflectance, and flux in a three-dimensional test problem using conditional point sampling, demonstrating the relationship between CPF accuracy and transport simulation accuracy.

Poisson model↗

Complexity in scalable computing.

The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity. This special issue grapples with two facets of this complexity: scalable execution and scalable development. The former results from efficient programming of novel hardware with increasing numbers of processing units (e.g., cores, processors, threads or processes). The latter results from efficient development of robust, flexible software with increasing numbers of programming units (e.g., procedures, classes, components or developers). The progression in the above two parenthetical lists goes from the lowest levels of abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Research and Development Department at Sandia National Laboratories in Livermore, CA. Their co-authors hail from other parts of Sandia, other national laboratories and academia. Their research sponsors include several programs within the Department of Energy's Office of Advanced Scientific Computing Research and its National Nuclear Security Administration, along with Sandia's Laboratory Directed Research and Development program and the Office of Naval Research. The breadth of interests of these authors and their customers reflects in the breadth of applications this issue covers. This article demonstrates how to obtain scalable execution on the increasingly dominant high-performance computing platform: a Linux cluster with multicore chips. The authors describe how deep memory hierarchies necessitate reducing communication overhead by using threads to exploit shared register and cache memory. On a matrix-matrix multiplication problem, they achieve up to 96% parallel efficiency with a three-part strategy: intra-node multithreading, non-blocking inter-node message passing, and a dedicated communications thread to facilitate concurrent communications and computations. On a quantum chemistry problem, they spawn multiple computation threads and communication threads on each node and use one-sided communications between nodes to minimize wait times. They reduce software complexity by evolving a multi-threaded factory pattern in C++ from a working, message-passing program in C.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Developing A Navier-Stokes Algorithm For Supercomputers

Report discusses development of algorithm for solution of Navier-Stokes equations of flow on parallel-processing supercomputers. Involves combination of prior techniques to form algorithm to compute flows in complicated three-dimensional configurations. Includes explicit finite-difference numerical-integration scheme applicable to flows represented by hierarchy of mathematical models ranging from Euler to full Navier-Stokes. Of interest to researchers looking for ways to structure problems for greater computational efficiency.

Swisshelm, Julie M.↗

Radiation/convection coupling in rocket motors and plumes

The three commonly used propellant systems - H2/O2, RP-1/O2, and solid propellants - primarily radiate as molecular emitters, non-scattering small particles, and scattering larger particles, respectively. Present technology has accepted the uncoupling of the radiation analysis from that of the flowfield. This approximation becomes increasingly inaccurate as one considers plumes, interior rocket chambers, and nuclear rocket propulsion devices. This study will develop a hierarchy of methods which will address radiation/convection coupling in all of the aforementioned propulsion systems. The nature of the radiation/convection coupled problem is that the divergence of the radiative heat flux must be included in the energy equation and that the local, volume-averaged intensity of the radiation must be determined by a solution of the radiative transfer equation (RTE). The intensity is approximated by solving the RTE along several lines of sight (LOS) for each point in the flowfield. Such a procedure is extremely costly; therefore, further approximations are needed. Modified differential approximations are being developed for this purpose. It is not obvious which order of approximations are required for a given rocket motor analysis. Therefore, LOS calculations have been made for typical rocket motor operating conditions in order to select the type approximations required. The results of these radiation calculations, and the interpretation of these intensity predictions are presented herein.

Farmer, R. C.↗

Reduced order models for thermal radiative transfer problems based on moment equations and data-driven approximations of the Eddington tensor

Here a new group of structure and asymptotic preserving reduced-order models (ROMs) for multidimensional nonlinear thermal radiative transfer (TRT) problems is presented. They are formulated by means of the nonlinear projective approach and data compression techniques. The nonlinear projection is applied to the Boltzmann transport equation (BTE) to derive a hierarchy of low-order moment equations. Approximation of the Eddington tensor that provides exact closure for the system of moment equations is found with projection-based data-driven methodologies. These include the (i) proper orthogonal decomposition (POD), (ii) dynamic mode decomposition (DMD) and (iii) a variant of the DMD. A parameterization is derived for this ROM for the temperature of radiation incoming to the problem domain (the radiation drive temperature). This parameterization is informed from results of a dimensionless study of the TRT problem. Analysis of the ROMs is performed on the classical Fleck-Cummings TRT multigroup test problem in 2D geometry with a radiation-driven Marshak wave. Numerical results are presented to demonstrate the performance of these ROMs for the simulation of evolving radiation and heat waves. Results show these models to be sufficiently accurate for practical computations with rather low-rank representations of the Eddington tensor. As the rank of the approximation is increased, the errors of solutions generated by the ROMs gradually decreases.

42 ENGINEERING↗

Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states

Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One powerful example of such a hybrid quantum-classical approach optimized for classically intractable eigenvalue problems is the variational quantum eigensolver, built to utilize quantum resources for the solution of eigenvalue problems and optimizations with minimal coherence time requirements by leveraging classical computational resources. These algorithms have been placed as leaders among the candidates for the first to achieve supremacy over classical computation. Here, we provide evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channel model of variational state preparation. Moreover, we develop a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources. In conclusion, we demonstrate numerically on a sample electronic system that this method both allows for the accurate determination of excited electronic states as well as reduces the impact of decoherence, without using any additional quantum coherence time or formal error-correction codes.

McClean, Jarrod R.↗

Numerical methods for high-dimensional probability density function equations

In this paper we address the problem of computing the numerical solution to kinetic partial differential equations involving many phase variables. These types of equations arise naturally in many different areas of mathematical physics, e.g., in particle systems (Liouville and Boltzmann equations), stochastic dynamical systems (Fokker–Planck and Dostupov–Pugachev equations), random wave theory (Malakhov–Saichev equations) and coarse-grained stochastic systems (Mori–Zwanzig equations). We propose three different classes of new algorithms addressing high-dimensionality: The first one is based on separated series expansions resulting in a sequence of low-dimensional problems that can be solved recursively and in parallel by using alternating direction methods. The second class of algorithms relies on truncation of interaction in low-orders that resembles the Bogoliubov–Born–Green–Kirkwood–Yvon (BBGKY) framework of kinetic gas theory and it yields a hierarchy of coupled probability density function equations. The third class of algorithms is based on high-dimensional model representations, e.g., the ANOVA method and probabilistic collocation methods. A common feature of all these approaches is that they are reducible to the problem of computing the solution to high-dimensional equations via a sequence of low-dimensional problems. The effectiveness of the new algorithms is demonstrated in numerical examples involving nonlinear stochastic dynamical systems and partial differential equations, with up to 120 variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imagine Moving Off the Planet

Moving off the planet will be a defining moment of this century as landing on the Moon was in the last. For that to happen for humans to go where humans cannot go-- simulation is the sole solution. NASA supports simulation for life-cycle activities: design, analysis, test, checkout, operations, review and training. We contemplate time spans of a century and more, teams dispersed to different planets and the need for systems that endure or adapt as missions, teams and technology change. Without imagination such goals are impossible. But with imagination we can go outside our present perception of reality to think about and take action on what has been, is and, especially, what might be. Consciously maturing an imagined, possibly workable, idea through framing it to optimization to design, and building the product provides us with a new approach to innovation and simulation fidelity. We address options, analyze, test and make improvements in how we think and work. Each step includes increasingly exact information about costs, schedule, who will be needed, where, when and how. NASA i integrating such thinking into its Exploration Product Realization Hierarchy for simulation and analysis, test and verification, and stimulus response goals. Technically NASA follows a timeline of studies, analysis, definition, design, development and operations with concurrent documentation. We have matched this Product Realization Hierarchy with a continuum from image to realization that incorporates commitment, current and needed research and communication to ensure superior and creative problem solving as well as advances in simulation. One result is a new approach to collaborative systems. Another is a distributed observer network prototyped using game engine technology bringing advanced 3-D simulation of a simulation to the desktop enabling people to develop shared consensus of its meaning. Much of the value of simulation comes from developing in people their ability to make good decisions and reflexes supporting impressive achievement. Synthesizing imagination systematically into our work - and thus our success - is a challenge. NASA engineers have inventive minds, and the task is determining how best to enable them to devise the simulation and other innovations that will make a story so clear and so intellectually sound that people can carry out the mission for 50-100 years. This demands skills and knowledge traditionally under-respected and under-represented in technology organizations. But we are beginning to see that the process encourages efficiency and enables us to attain more effective results. We have to elicit imaginative, intelligent and effective ways to make better use than ever of the minds we have and will have available. We have to accept the challenge to accomplish tasks among dispersed interdisciplinary teams who must overcome changing priorities and technology, time and distance in order to maximize interactivity and innovation as never before. Attention to the process of innovation is a practical means to increase the efficiency of our intelligence. We have an obligation to reexamine and improve the process by which we approach and exercise innovation as we accept the charge to move off the planet.

Elfrey, Priscilla R.↗

Multi-level Hybrid Cache: Impact and Feasibility

Storage class memories, including flash, has been attracting much attention as promising candidates fitting into in today's enterprise storage systems. In particular, since the cost and performance characteristics of flash are in-between those of DRAM and hard disks, it has been considered by many studies as an secondary caching layer underneath main memory cache. However, there has been a lack of studies of correlation and interdependency between DRAM and flash caching. This paper views this problem as a special form of multi-level caching, and tries to understand the benefits of this multi-level hybrid cache hierarchy. We reveal that significant costs could be saved by using Flash to reduce the size of DRAM cache, while maintaing the same performance. We also discuss design challenges of using flash in the caching hierarchy and present potential solutions.

99 GENERAL AND MISCELLANEOUS↗

A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks

Hyperbolic neural networks have recently gained significant attention due to their promising results on several graph problems including node classification and link prediction. The primary reason for this success is the effectiveness of hyperbolic space in capturing the inherent hierarchy of graph datasets. However, they are limited in terms of generalization, scalability, and have inferior performance when applied to non-hierarchical datasets. In this paper, we take a completely different perspective for modeling hyperbolic networks and answer the following question: is an Euclidean model able to approximate a function or behavior in the hyperbolic space? Extending the universal approximation theory developed for Euclidean models, We draw an analogy from the hyperbolic components to the Euclidean counterparts and conclude that, in order to capture hierarchical features, it is possible to generalize hyperbolic models to be a special case of Euclidean models with the proposed Pseudo-Poincaré technique. We applied our non-linear hyperbolic normalization to the current state-of-the-art homogeneous and multi-relational graph networks and demonstrate significant improvements in performance compared to both Euclidean and hyperbolic counterparts. The primary impact of this work lies in its ability to capture hierarchical features in the Euclidean space, and thus, can replace hyperbolic networks without any loss in performance metrics while simultaneously leveraging the power of Euclidean networks such as interpretability and efficient execution of various model components.

Khatir, Mehrdad↗

Viscous-fluid reaction to a torsionally oscillating spheroid Linearized steady-state weak-separation solution

For both the linearized prolate and oblate problems, perturbation series for all orders of eccentricity are obtained. The 'weak separation' method of solving partial-differential-equation boundary-value problems assumes that each linearly independent solution is a sum of products of single-variable functions. The method is applied to a hierarchy of partial differential equations. The weak-separation solutions are constructed by generalizing only the Bessel functions of the homogeneous solution.

Tompkins, D. R., Jr.↗

Reliable vision-guided grasping

Automated assembly of truss structures in space requires vision-guided servoing for grasping a strut when its position and orientation are uncertain. This paper presents a methodology for efficient and robust vision-guided robot grasping alignment. The vision-guided grasping problem is related to vision-guided 'docking' problems. It differs from other hand-in-eye visual servoing problems, such as tracking, in that the distance from the target is a relevant servo parameter. The methodology described in this paper is hierarchy of levels in which the vision/robot interface is decreasingly 'intelligent,' and increasingly fast. Speed is achieved primarily by information reduction. This reduction exploits the use of region-of-interest windows in the image plane and feature motion prediction. These reductions invariably require stringent assumptions about the image. Therefore, at a higher level, these assumptions are verified using slower, more reliable methods. This hierarchy provides for robust error recovery in that when a lower-level routine fails, the next-higher routine will be called and so on. A working system is described which visually aligns a robot to grasp a cylindrical strut. The system uses a single camera mounted on the end effector of a robot and requires only crude calibration parameters. The grasping procedure is fast and reliable, with a multi-level error recovery system.

Nicewarner, Keith E.↗

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

REYNO: A Reactive Hydrodynamics Modeling Suite

REYNO is a Python library that is primarily designed as a platform for the agile development and testing of novel reactive flow models. Equations of state and multi-step rate laws can be implemented using the provided class hierarchy with different thermodynamic closure conditions. The library includes a one-dimensional Lagrangian hydrodynamic solver to simulate multi-material reactive or inert problems in planar, cylindrical, or spherical coordinates. Custom time-dependent boundary conditions are also available for problems such as ramp compression. This document describes the different numerical methods and algorithms that are included in REYNO.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗