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

HYDRA: High Speed Simulation Architecture for Precision Spacecraft Formation Flying

This viewgraph presentation describes HYDRA, which is architecture to facilitate high-fidelity and real-time simulation of formation flying missions. The contents include: 1) Motivation; 2) Objective; 3) HYDRA-Description and Overview; 4) HYDRA-Hierarchy; 5) Communication in HYDRA; 6) Simulation Specific Concerns in HYDRA; 7) Example application (Formation Acquisition); and 8) Sample Problem Results.

simpulations↗

A Novel Matching Formulation for Startup Costs in Unit Commitment

We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Source record↗

Hedberg Research Conference on Fundamental Controls on Flow in Carbonates: Request for Travel Support for Post-Doctoral Fellows

Carbonate reservoirs pose a scientific and engineering challenge to geophysical prediction and monitoring of fluid flow in the subsurface. Difficulties in interpreting hydrological, reservoir and other exploration data arise because carbonates are composed of a hierarchy of geological structures, constituents and processes that span a wide spectrum of length and time scales. What makes this problem particularly challenging is that length scales associated with physical structure and processes are often not discrete, but overlap, preventing the definition of discrete elements at one scale to become the building blocks of the next scale. This is particularly true for carbonates where complicated depositional environments, subsequent post-deposition diagenesis and geochemical interactions result in pores that vary in scale from submicron to centimeters to fractures, variation in fabric composition with fossils, minerals and cement, as well as variations in structural features (e.g., oriented inter- and intra layered - interlaced bedding and/or discontinuous rock units). In addition, this complexity is altered by natural and anthropogenic processes such as changes in stress, fluid content, reactive fluid flow, etc. Thus an accurate geophysical assessment of the flow behavior of carbonate reservoirs requires a fundamental understanding of the interplay of textural and structural features subjected to physical processes that affect and occur on various length and time scales. To address this complexity related to carbonates, a Hedberg conference on “Fundamental Controls on Flow in Carbonates” was held July 8 to 13, 2012, to bring together industry and academic scientists to stimulate innovative ideas that can accelerate research advances related to flow prediction and recovery in carbonate reservoirs. Participants included scientist and engineers from multiple disciplines (such as hydrology, structural geology, geochemistry, reservoir engineering, geophysics, geomechanics, numerical modeling, physical experiments, sedimentology, well-testing, statistics, mathematics, visualization, etc.) who encompass experience as well as the latest advances in these multi-faceted fields. One of the goals was to include early career scientists and engineers (post-doctoral fellows, assistant professors, etc.). With this grant 10 early career scientists and engineers were supported to attend the conference. This reports contains a brief overview of the conference and the list of support participants supported by this grant. Full details of the outcomes of the conference are given in the publication found in the Attachment section of this report.

58 GEOSCIENCES↗

Structurally flexible cloud microphysics, observationally constrained at all scales via ML-accelerated Bayesian inference

We discuss the challenge of developing observationally informed parameterizations of microphysics for use at a hierarchy of modeling scales. Our proposed approach is applicable to any domain that suffers from a two-fold parameterization problem, where physical processes are not resolved at the model scale (the first problem), and those processes are uncertain at any scale (the second problem). For such problems, a physical approach facilitates modeling across scales, as well as systematic observational inference accelerated by machine learning (ML) surrogate models, and quantification of physical uncertainties.

54 ENVIRONMENTAL SCIENCES↗

On a production system using default reasoning for pattern classification

This paper addresses an unconventional application of a production system to a problem involving belief specialization. The production system reduces a large quantity of low-level descriptions into just a few higher-level descriptions that encompass the problem space in a more tractable fashion. This classification process utilizes a set of descriptions generated by combining the component hierarchy of a physical system with the semantics of the terminology employed in its operation. The paper describes an application of this process in a program, constructed in C and CLIPS, that classifies signatures of electromechanical system configurations. The program compares two independent classifications, describing the actual and expected system configurations, in order to generate a set of contradictions between the two.

Barry, Matthew R.↗

Search for New Physics at the Tevatron

We report on selected recent results from the CDF and D0 experiments on searches for physics beyond the Standard Model using data from the Tevatron collider running p{bar p} collisions at {radical}s = 1960 GeV. Over the past decades the Standard Model (SM) of particle physics has been surprisingly successful. Although the precision of experimental tests improved by orders of magnitude no significant deviation from the SM predictions has been observed so far. Still, there are many questions that the Standard Model does not answer and problems it can not solve. Among the most important ones are the origin of the electro-weak symmetry breaking, hierarchy of scales, unification of fundamental forces and the nature of gravity. Recent cosmological observations indicates that the SM particles only account for 4% of the matter of the Universe. Many extensions of the SM (Beyond the Standard Model, BSM) have been proposed to make the theory more complete and solve some of the above puzzles. Some of these extension includes SuperSymmetry (SUSY), Grand Unification Theory (GUT) and Extra Dimensions. At CDF and D0 we search for evidence of such processes in proton-antiproton collisions at {radical}(s) = 1960 GeV. The phenomenology of these models is very rich, although the cross sections for most of these exotic processes is often very small compared to those of SM processes at hadron colliders. It is then necessary to devise analysis strategies that would allow to disentangle the small interesting signals, often buried under heavy instrumental and/or physics background. Two main approaches to search for physics beyond the Standard Model are used in a complementary fashion: model-based analyses and signature based studies. In the more traditional model-driven approach, one picks a favorite theoretical model and/or a process, and the best signature is chosen. The selection cuts are optimized based on acceptance studies performed using simulated signal events. The expected background is calculated from data and/or Monte Carlo and, based on the number of events observed in the data, a discovery is made or the best limit on the new signal is set. In a signature-based approach a specific signature is picked (i.e. dileptons+X) and the data sample is defined in terms of known SM processes. A signal region (blind box) might be defined with cuts which are kept as loose as possible and the background predictions in the signal region are often extrapolated from control regions. Inconsistencies with the SM predictions will provide indication of possible new physics. As the cuts and acceptances are often calculated independently from a model, different models can be tested against the data sample. It should be noticed that the comparison with a specific model implies calculating optimized acceptances for a specific BSM signal. In signature-based searches, there is no such an optimization. Both the experiments have followed a somehow natural approach in pursuing analysis looking at final state signatures characterized by relatively simple physics objects (for example lepton-only final state, where the selection of the leptons is straightforward and can be easily checked with the measurement of electroweak boson production cross sections) and proceeding onto more complex final state, including jets and heavy flavor. Here more sophisticated identification techniques need to be used and issues like jet energy scale calibration play an important role in determining the final result. Given the limited space available for this proceeding, we will focus here on few selected results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Source record↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Barker, Andrew T.↗

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↗