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 361 records · Page 20

Calculation of excitation energies from the CC2 linear response theory using Cholesky decomposition

A new implementation of the approximate coupled cluster singles and doubles CC2 linear response model is reported. It employs a Cholesky decomposition of the two-electron integrals that significantly reduces the computational cost and the storage requirements of the method compared to standard implementations. Our algorithm also exploits a partitioning form of the CC2 equations which reduces the dimension of the problem and avoids the storage of doubles amplitudes. We present calculation of excitation energies of benzene using a hierarchy of basis sets and compare the results with conventional CC2 calculations. The reduction of the scaling is evaluated as well as the effect of the Cholesky decomposition parameter on the quality of the results. The new algorithm is used to perform an extrapolation to complete basis set investigation on the spectroscopically interesting benzylallene conformers. A set of calculations on medium-sized molecules is carried out to check the dependence of the accuracy of the results on the decomposition thresholds. Moreover, CC2 singlet excitation energies of the free base porphin are also presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Less is More: Bigger Data from Compressive Measurements

Compressive sensing approaches are beginning to take hold in (scanning) transmission electron microscopy (S/TEM) [1,2,3]. Compressive sensing is a mathematical theory about acquiring signals in a compressed form (measurements) and the probability of recovering the original signal by solving an inverse problem [4]. The inverse problem is underdetermined (more unknowns than measurements), so it is not obvious that recovery is possible. Compression is achieved by taking inner products of the signal with measurement weight vectors. Both Gaussian random weights and Bernoulli (0,1) random weights form a large class of measurement vectors for which recovery is possible. The measurements can also be designed through an optimization process. The key insight for electron microscopists is that compressive sensing can be used to increase acquisition speed and reduce dose. Building on work initially developed for optical cameras, this new paradigm will allow electron microscopists to solve more problems in the engineering and life sciences. We will be collecting orders of magnitude more data than previously possible. The reason that we will have more data is because we will have increased temporal/spatial/spectral sampling rates, and we will be able ability to interrogate larger classes of samples that were previously too beam sensitive to survive the experiment. For example consider an in-situ experiment that takes 1 minute. With traditional sensing, we might collect 5 images per second for a total of 300 images. With compressive sensing, each of those 300 images can be expanded into 10 more images, making the collection rate 50 images per second, and the decompressed data a total of 3000 images [3]. But, what are the implications, in terms of data, for this new methodology? Acquisition of compressed data will require downstream reconstruction to be useful. The reconstructed data will be much larger than traditional data, we will need space to store the reconstructions during analysis, and the computational demands for analysis will be higher. Moreover, there will be time costs associated with reconstruction. Deep learning [5] is an approach to address these problems. Deep learning is a hierarchical approach to find useful (for a particular task) representations of data. Each layer of the hierarchy is intended to represent higher levels of abstraction. For example, a deep model of faces might have sinusoids, edges and gradients in the first layer; eyes, noses, and mouths in the second layer, and faces in the third layer. There has been significant effort recently in deep learning algorithms for tasks beyond image classification such as compressive reconstruction [6] and image segmentation [7]. A drawback of deep learning, however, is that training the model requires large datasets and dedicated computational resources (to reduce training time to a few days). A second issue is that deep learning is not user-friendly and the meaning behind the results is usually not interpretable. We have shown it is possible to reduce the data set size while maintaining model quality [8] and developed interpretable models for image classification [9], but the demands are still significant. The key to addressing these problems is to NOT reconstruct the data. Instead, we should design computational sensors that give answers to specific problems. A simple version of this idea is compressive classification [10], where the goal is to classify signal type from a small number of compressed measurements. Classification is a much simpler problem than reconstruction, so 1) much fewer measurements will be necessary, and 2) these measurements will probably not be useful for reconstruction. Other simple examples of computational sensing include determining object volume or the number of objects present in the field of view [11].

Stevens, Andrew↗

Impacts of Hybrid Parallelism and Vectorization on the Performance of Newton-Krylov Methods in Computational Aerodynamics

Finding the numerical solution of moderate and high-fidelity aerodynamics problems on modern computer architectures involves, 1) decomposing the domain into smaller regions of nearly equal size, and 2) allocating computational resources for calculations on each domain and communication between domains. Modern computer clusters are composed from hierarchies of processing, memory, and communication resources with varying capabilities and latencies.This paper focuses on the combination of domain decomposition provided by ParMETIS [1]and Newton-Krylov Methods [2–5] for the solution of Computational Aerodynamics problems of interest to NASA. Herein, trade-offs encountered when mapping aerodynamics problems to modern computer architectures are explored through examples and discussions of trade-offs in parallelism from MPI [6], Open MP [7], and vectorization as partition sizes and computational resources are varied. An example of the impact that domain decomposition and MPI+OpenMPresource allocation can have on an adjoint calculation is presented in this abstract. The full paper will include more detailed examples, discussions of difficulties and potential methods to overcome them, and topics identified for future study.

Computational Aerodynamics, Hybrid Parallelism, Ve↗

Scaling to 150K cores: recent algorithm and performance engineering developments enabling XGC1 to run at scale

Particle-in-cell (PIC) methods have proven to be effective in discretizing the Vlasov-Maxwell system of equations describing the core of toroidal burning plasmas for many decades. Recent physical understanding of the importance of edge physics for stability and transport in tokamaks has lead to development of the fi rst fully toroidal edge PIC code - XGC1. The edge region poses special problems in meshing for PIC methods due to the lack of closed flux surfaces, which makes fi eld-line following meshes and coordinate systems problematic. We present a solution to this problem with a semi- field line following mesh method in a cylindrical coordinate system. Additionally, modern supercomputers require highly concurrent algorithms and implementations, with all levels of the memory hierarchy being effe ciently utilized to realize optimal code performance. This paper presents a mesh and particle partitioning method, suitable to our meshing strategy, for use on highly concurrent cache-based computing platforms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Kinetic theory of a two-dimensional magnetized plasma.

Several features of the equilibrium and nonequilibrium statistical mechanics of a two-dimensional plasma in a uniform dc magnetic field are investigated. The charges are assumed to interact only through electrostatic potentials. The problem is considered both with and without the guiding-center approximation. With the guiding-center approximation, an appropriate Liouville equation and BBGKY hierarchy predict no approach to thermal equilibrium for the spatially uniform case. For the spatially nonuniform situation, a guiding-center Vlasov equation is discussed and solved in special cases. For the nonequilibrium, nonguiding-center case, a Boltzmann equation, and a Fokker-Planck equation are derived in the appropriate limits. The latter is more tractable than the former, and can be shown to obey conservation laws and an H-theorem, but contains a divergent integral which must be cut off on physical grounds. Several unsolved problems are posed.

Vahala, G.↗

A novel matching formulation for startup costs in unit commitment

Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC 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 can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.

97 MATHEMATICS AND COMPUTING↗

Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts

Transient simulation in circuit simulation tools, such as SPICE and Xyce, depend on scalable and robust sparse LU factorizations for efficient numerical simulation of circuits and power grids. As the need for simulations of very large circuits grow, the prevalence of multicore architectures enable us to use shared memory parallel algorithms for such simulations. A parallel factorization is a critical component of such shared memory parallel simulations. We develop a parallel sparse factorization algorithm that can solve problems from circuit simulations efficiently, and map well to architectural features. This new factorization algorithm exposes hierarchical parallelism to accommodate irregular structure that arise in our target problems. It also uses a hierarchical two-dimensional data layout which reduces synchronization costs and maps to memory hierarchy found in multicore processors. We present an OpenMP based implementation of the parallel algorithm in a new multithreaded solver called Basker in the Trilinos framework. Here, we present performance evaluations of Basker on the Intel SandyBridge and Xeon Phi platforms using circuit and power grid matrices taken from the University of Florida sparse matrix collection and from Xyce circuit simulation. Basker achieves a geometric mean speedup of 5.91× on CPU (16 cores) and 7.4× on Xeon Phi (32 cores) relative to state-of-the-art solver KLU. Basker outperforms Intel MKL Pardiso solver (PMKL) by as much as 30× on CPU (16 cores) and 7.5× on Xeon Phi (32 cores) for low fill-in circuit matrices. Furthermore, Basker provides 5.4× speedup on a challenging matrix sequence taken from an actual Xyce simulation.

97 MATHEMATICS AND COMPUTING↗

On Certain Reductions of Integrable Equations on Symmetric Spaces

We derive a Z{sub 2}xZ{sub 2} reduced integrable system which is deeply connected with the famous Heisenberg ferromagnet equation. Its Lax pair is associated with the symmetric space SO(5)/SO(2)xSO(3). We study the spectral properties of the scattering operator, introduce the basic notions of its direct scattering problem and construct fundamental analytic solutions in terms of Volterra integral equations. We obtain recursion operator to describe the hierarchy of higher order equations associated with the same Lax operator L.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A representation for error detection and recovery in robot task plans

A general definition is given of the problem of error detection and recovery in robot assembly systems, and a general representation is developed for dealing with the problem. This invariant representation involves a monitoring process which is concurrent, with one monitor per task plan. A plan hierarchy is discussed, showing how diagnosis and recovery can be handled using the representation.

Lyons, D. M.↗

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.↗