Search NASA⌕ Search

SEARCH · Search NASA

Results for “block 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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

Directed Gas-Phase Formation of the 1-Cyanovinyl Radical (H 2 CCCN, X 2 A′) in the Interstellar Medium

The formation pathways to nitrogen-containing molecules and radicals are crucial to the understanding of the carbon–nitrogen chemistry in interstellar and atmospheric environments. While over 65 nitrogen-containing neutral species have been observed in deep space to date, their formation mechanisms─in particular, those of radical species─remain largely speculative. The crossed molecular beam technique in conjunction with electronic structure and statistical calculations was utilized to offer a detailed overview of the fundamental pathways in the gas-phase bimolecular reaction of ground-state atomic carbon (C, 3 P) with acetonitrile-d 3 (CD 3 CN, X 1 A 1 ) under single-collision conditions leading to the formation of the 1-cyanovinyl radical (D 2 CCCN, X 2 A′) coupled with deuterium atom loss. Here, the indirect reaction was initiated by barrierless carbon-atom addition, with the most probable route involving carbon addition across the carbon–nitrogen nitrile triple bond of acetonitrile, forming a three-membered ring intermediate followed by ring-opening and unimolecular decomposition via atomic deuterium loss from the C3 carbon atom. The reaction was overall exoergic, and intermediates and transition states lie lower in energy than the separated reactants, unlocking the reaction of carbon with acetonitrile in low-temperature environments such as cold molecular clouds, e.g., Taurus Molecular Cloud (TMC-1), and planetary atmospheres, e.g., Saturn’s moon Titan. In these environments, the 1-cyanovinyl radical may act as a building block for cyano-substituted polycyclic aromatic hydrocarbons and N-heterocycles, thus furthering our understanding of the complex carbon–nitrogen chemistry in deep space.

Chemical reactions↗

Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations

We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.

Barth, Timothy J.↗

Viscous flow simulations of internal store carriage and separation

The internal carriage of stores by the military aircraft is an option for possible reductions in the aerodynamic drag and the observability. Trade studies of this option require considering the aircraft and the stores together. In an effort to develop a computational fluid dynamic (CFD) code for such studies, an investigation was conducted from 1986 to 1990. The study was divided into five building-block steps. First, a full Navier-Stokes code was developed to simulate the unsteady, three-dimensional cavity flow. As the second step, this code was then used to simulate the flows past various missile configurations at angles of attack up to 44 deg. The effects of incidence as well as the turbulence on the leeside flows were computationally captured. The objective of this study has involved the interference flows of rather complex configurations with multiple, joint or disjoint, components of nonsimilar geometries. Hence, a hybrid domain decomposition (HDD) method was developed as the third step of the investigation. The strengths of the multiblock, zonal, and overlapped grids were judiciously combined and employed for the present problem. In the fourth step, the interference flow past a missile near a flat-plate wing was simulated using the HDD method. Finally, the fifth step involved the simulation of the internal store carriage and separation. Four different cases for two different configurations were simulated. The computational results of all five steps were successfully compared with the available wind tunnel test data. The unsteady aerodynamic forces on the separating store were computationally predicted. The CFD code developed for this project is called Viscous Internal Store Carriage Code (VISCC).

Baysal, Oktay↗

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗

Principal modes of atmospheric circulation anomalies associated with global angular momentum fluctuations

This paper provides a description of the variability of global atmospheric angular momentum (GAM) and its relationship with principal modes of three-dimensional atmospheric circulation anomalies. The data used are 5-day mean global wind fields from the European Centre for Medium-Range Weather Forecasts initialized dataset for 1980-1989. Significant seasonal variation of GAM is observed with maxima in April and November and a minimum during late July. The amplitude of the annual cycle is largest in the upper troposphere and decreases toward the surface. Although the lower tropospheric contribution to the total angular momentum is relatively small, its annual cycle is out of phase with those of the upper atmosphere and GAM. Also identified is a distinct semiannual component, with double peaks appearing in April and November. This signal is most noticeable in the upper troposphere above the 300-mb level. The principal modes of zonal-mean angular momentum and meridional circulation anomalies and their coupled modes are obtained by using empirical orthogonal function analysis and singular value decomposition. It is shown that the leading modes of the angular momentum and meridional circulation are coupled with each other and are responsible for much of the variability in GAM. The coupled modes represent fluctuations of upper-level subtropical zonal flow, which are linked to the modulation of Hadley circulation intensity in both hemispheres. It is found that GAM is highly correlated with the first eigenvector of upper-level streamfunction anomalies, which consists of a superrotational flow in the tropics and subtropics, except over the central Pacific where a 'blocked' flow with two subtropical anticyclonic circulation cells straddling the equator is found. Much of the blocked flow is due to the establishment of dipole anomalies in the velocity potential with centers over the central Pacific and the Maritime Continent on the interannual time scale. On the intraseasonal time scale, GAM fluctuation is dominated by superrotational flow in the tropics, with the blocked flow present to a much lesser extent. The associated velocity potential anomaly has a weak dipole structure with centers over the Indian Ocean and the eastern Pacific. The implications of the above results on the total angular momentum balance of the earth-atmosphere system are also discussed.

Kang, In-Sik↗

A VLSI decomposition of the deBruijn graph

A new Viterbi decoder for convolutional codes with constraint lengths up to 15, called the Big Viterbi Decoder, is under development for the Deep Space Network. It will be demonstrated by decoding data from the Galileo spacecraft, which has a rate 1/4, constraint-length 15 convolutional encoder on board. Here, the mathematical theory underlying the design of the very-large-scale-integrated (VLSI) chips that are being used to build this decoder is explained. The deBruijn graph B sub n describes the topology of a fully parallel, rate 1/v, constraint length n+2 Viterbi decoder, and it is shown that B sub n can be built by appropriately wiring together (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph called a B sub n building block. The efficiency of such a building block is defined as the fraction of the edges in B sub n that are present in the copies of the building block. It is shown, among other things, that for any alpha less than 1, there exists a graph G which is a B sub n building block of efficiency greater than alpha for all sufficiently large n. These results are illustrated by describing a special hierarchical family of deBruijn building blocks, which has led to the design of the gate-array chips being used in the Big Viterbi Decoder.

Collins, O.↗

A Data Type for Efficient Representation of Other Data Types

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

James, Mark↗

Decomposition Algorithm for Global Reachability Analysis on a Time-Varying Graph with an Application to Planetary Exploration

Hot air (Montgolfiere) balloons represent a promising vehicle system for possible future exploration of planets and moons with thick atmospheres such as Venus and Titan. To go to a desired location, this vehicle can primarily use the horizontal wind that varies with altitude, with a small help of its own actuation. A main challenge is how to plan such trajectory in a highly nonlinear and time-varying wind field. This paper poses this trajectory planning as a graph search on the space-time grid and addresses its computational aspects. When capturing various time scales involved in the wind field over the duration of long exploration mission, the size of the graph becomes excessively large. We show that the adjacency matrix of the graph is block-triangular, and by exploiting this structure, we decompose the large planning problem into several smaller subproblems, whose memory requirement stays almost constant as the problem size grows. The approach is demonstrated on a global reachability analysis of a possible Titan mission scenario.

Dijkstra's algorithm↗

Multidisciplinary optimization applied to a transport aircraft

Decomposition of a large optimization problem into several smaller subproblems has been proposed as an approach to making large-scale optimization problems tractable. To date, the characteristics of this approach have been tested on problems of limited complexity. The objective of the effort is to demonstrate the application of this multilevel optimization method on a large-scale design study using analytical models comparable to those currently being used in the aircraft industry. The purpose of the design study which is underway to provide this demonstration is to generate a wing design for a transport aircraft which will perform a specified mission with minimum block fuel. A definition of the problem; a discussion of the multilevel composition which is used for an aircraft wing; descriptions of analysis and optimization procedures used at each level; and numerical results obtained to date are included. Computational times required to perform various steps in the process are also given. Finally, a summary of the current status and plans for continuation of this development effort are given.

Giles, G. L.↗

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗

Landform Degradation and Slope Processes on Io: The Galileo View

The Galileo mission has revealed remarkable evidence of mass movement and landform degradation on Io. We recognize four major slope types observed on a number of intermediate resolution (250 m/pixel) images and several additional textures on very high resolution (10 m/pixel) images. Slopes and scarps on Io often show evidence of erosion, seen in the simplest form as alcove-carving slumps and slides at all scales. Many of the mass movement deposits on Io are probably mostly the consequence of block release and brittle slope failure. Sputtering plays no significant role. Sapping as envisioned by McCauley et al. remains viable. We speculate that alcove-lined canyons seen in one observation and lobed deposits seen along the bases of scarps in several locations may reflect the plastic deformation and 'glacial' flow of interstitial volatiles (e.g., SO2) heated by locally high geothermal energy to mobilize the volatile. The appearance of some slopes and near-slope surface textures seen in very high resolution images is consistent with erosion from sublimation-degradation. However, a suitable volatile (e.g., H2S) that can sublimate fast enough to alter Io's youthful surface has not been identified. Disaggregation from chemical decomposition of solid S2O and other polysulfur oxides may conceivably operate on Io. This mechanism could degrade landforms in a manner that resembles degradation from sublimation, and at a rate that can compete with resurfacing.

Moore, Jeffrey M.↗

Multiscale Characterization of Electrode-Induced Degradation in Perovskite Solar Cells

The stability of metal-halide-perovskite (MHP) solar cells must be understood and improved for the commercial viability of MHP technologies. Here, we apply multiscale characterization methods to study degradation modes, specifically electrode corrosion, for p-i-n MHP partial device stacks and full devices that are stored in the dark under an inert atmosphere. Our multiscale characterization approaches include full-device electro-optical performance using current-voltage (JV) curves and spatial imaging with electroluminescence (EL) and photoluminescence (PL). We further correlate interface properties using cross-sectional Kelvin probe force microscopy, which maps the nanoscale electric field properties, and electron microscopy, which demonstrates structural and chemical features. Devices stored as a full device stack degrade primarily by metal (Ag) electrode diffusion into the absorber, with formation of AgI byproducts and Ag accumulation near the indium tin oxide (ITO) contact. This causes decomposition of the perovskite absorber domains, loss of the potential drop at the electron transport layer (ETL)/perovskite interface near the metal contact, and increased equivalent resistance at the perovskite/hole transport layer (HTL) interface near the ITO contact. The devices stored without metal show a different degradation pathway dominated by corrosion of the ITO, creating voids at the ITO electrode surface with diffusion of In and Sn into the absorber. We conclude that metal electrode-induced degradation is the most severe degradation pathway under dark storage, but that ITO corrosion and absorber instability must also be mitigated. We further demonstrate mitigation of these degradation pathways by changes to the device stack, including a SnO x blocking layer at the ETL side and replacing ITO with FTO at the HTL side. These results provide a useful demonstration of specific dark degradation pathways at each electrode interface, as well as a unique multiscale example that links degradation of chemical, structural, and electrical interface properties to the full-device electro-optical characteristics.

14 SOLAR ENERGY↗

Energy Transfer and Triadic Interactions in Compressible Turbulence

Using a two-point closure theory, the Eddy-Damped-Quasi-Normal-Markovian (EDQNM) approximation, we have investigated the energy transfer process and triadic interactions of compressible turbulence. In order to analyze the compressible mode directly, the Helmholtz decomposition is used. The following issues were addressed: (1) What is the mechanism of energy exchange between the solenoidal and compressible modes, and (2) Is there an energy cascade in the compressible energy transfer process? It is concluded that the compressible energy is transferred locally from the solenoidal part to the compressible part. It is also found that there is an energy cascade of the compressible mode for high turbulent Mach number (M(sub t) greater than or equal to 0.5). Since we assume that the compressibility is weak, the magnitude of the compressible (radiative or cascade) transfer is much smaller than that of solenoidal cascade. These results are further confirmed by studying the triadic energy transfer function, the most fundamental building block of the energy transfer.

Bataille, F.↗

3D Navier-Stokes Time Accurate Solutions Using Multipartitioning Parallel Computation Methodology

A parallel CFD code solving 3D time accurate Navier-Stokes equations with multipartitioning parallel Methodology is being developed in collaboration with Ohio State University within the Air Vehicle Directorate, at Wright Patterson Air Force Base. The advantage of the multipartitioning parallel method is that the domain decomposition will not introduce domain boundaries for the implicit operators. A ring structure data communication is employed so that the implicit time accurate method can be implemented for multi-processors with the same accuracy as for the single processor. No sub-iteration is needed at the domain boundaries. The code has been validated for some typical unsteady flows, which include Coutte Flow, flow passing a cylinder. The code now is being employed for a large scale time accurate wall jet transient flow computation. 'ne preliminary results are promising. The mesh has been refined to capture more details of the flow field. The mesh refinement computation is in progress and would be difficult to successfully implement without the parallel computation techniques used. A modified version of the code with more efficient inversion of the diagonalized block matrix is currently being tested.

Zha, Ge-Cheng↗

Lunar and Planetary Science XXXV: Impacts: Modeling and Observations

This document covers the following topics: Cratering on Titan: Projectiles, Craters and Impact Melt; The Cratering Database: Making Code Jockeys Honest; Popigai Impact Structure Modeling: Morphology and Worldwide Ejecta; Anhydrite EOS and Phase Diagram in Relation to Shock Decomposition; Computational Investigations of the Chesapeake Bay Impact Structure; Hydrocode Simulations of the Chesapeake Bay Impact; Lockne Crater as a Result of Oblique Impact; The Influence of a Deep Shelf Sea on the Excavation and Modification of a Marine-Target Crater, the Lockne Crater, Central Sweden; Pre-Drilling Investigation of the Lake Bosumtwi Impact Crater: Constraints from Geophysics and Numerical Modelling; Central Uplift Formation at the Middlesboro Impact Structure, Kentucky, USA; A SRTM Investigation of Serra da Cangalho Impact Structure, Brazil; Brazilian Impact Craters: A Review; Flynn Creek Impact Structure: New Insights from Breccias, Melt Features, Shatter Cones, and Remote Sensing; The Howell Structure, Lincoln County, Tennessee: A Review of Past and Current Research; After the Chicxulub Impact: Control on Depositional and Diagenetic History of the Cenozoic Carbonate Formations of the Northwestern Yucatan Peninsula, Mexico; Ni Contents by Non-Destructive In-Situ XRF Method of Takamatsu-Kagawa Crater District in Japan; and Akiyoshi Limestone Blocks Transported by the P/T Boundary Event to Japan Islands.

Source record↗

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

A simple hyperbolic model for communication in parallel processing environments

We introduce a model for communication costs in parallel processing environments called the 'hyperbolic model,' which generalizes two-parameter dedicated-link models in an analytically simple way. Dedicated interprocessor links parameterized by a latency and a transfer rate that are independent of load are assumed by many existing communication models; such models are unrealistic for workstation networks. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes that initiate the sending and receiving of the information and in which internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. The direction of graph edges specifies the flow of the information carried through messages. Each CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. The parameters are evaluated in the limits of very large and very small messages. Rules are given for reducing a communication graph consisting of many to an equivalent two-parameter form, while maintaining an approximation for the service time that is exact in both large and small limits. The model is validated on a dedicated Ethernet network of workstations by experiments with communication subprograms arising in scientific applications, for which a tight fit of the model predictions with actual measurements of the communication and synchronization time between end processes is demonstrated. The model is then used to evaluate the performance of two simple parallel scientific applications from partial differential equations: domain decomposition and time-parallel multigrid. In an appropriate limit, we also show the compatibility of the hyperbolic model with the recently proposed LogP model.

Stoica, Ion↗

Block-Structured Operator Inference for Coupled Multiphysics Model Reduction

This work presents a block-structured formulation of Operator Inference as a way to learn structured reduced-order models for multiphysics systems. The approach specifies the governing equation structure for each physics component and the structure of the coupling terms. Once the multiphysics structure is specified, the reduced-order model is learned from snapshot data following the nonintrusive Operator Inference methodology. In addition to preserving physical system structure, which in turn permits preservation of system properties such as stability and second-order structure, the block-structured approach has the advantages of reducing the overall dimensionality of the learning problem and admitting tailored regularization for each physics component. The numerical advantages of the block-structured formulation over a monolithic Operator Inference formulation are demonstrated for aeroelastic analysis, which couples aerodynamic and structural models. For the benchmark test case of the AGARD 445.6 wing, block-structured Operator Inference provides an average 20% online prediction speedup over monolithic Operator Inference across subsonic and supersonic flow conditions in both the stable and fluttering parameter regimes while preserving the accuracy achieved with monolithic Operator Inference.

42 ENGINEERING↗