Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator 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 109 records · Page 6

Eigenmode analysis of the sheared-flow Z-pinch

Experiments have demonstrated that a Z-pinch can persist for thousands of times longer than the growth time of global magnetohydrodynamic (MHD) instabilities such as the m=0 sausage and m=1 kink modes. These modes have growth times on the order of ta=a/vi, where vi is the ion thermal speed and a is the pinch radius. Axial flows with duz/dr ≲ vi/a have been measured during the stable period, and the commonly accepted theory is that this amount of shear is sufficient to stabilize these modes as predicted by numerical studies using the ideal MHD equations. However, these studies only consider specific equilibrium profiles that typically have a modest magnitude for the logarithmic pressure gradient, qP≡d ln P/d ln r, and may not represent experimental conditions. Linear stability of the sheared-flow Z-pinch is studied here via a direct eigen-decomposition of the matrix operator obtained from the linear ideal MHD equations. Several equilibrium profiles with a large variation of qP are examined. Considering a practical range of k, 1/3 ≲ ka ≲ 10, it is shown that the shear required to stabilize m=0 modes can be expressed as duz/dr≥Cγ0/(ka)α. Here, γ0=γ0(ka) is the profile-specific growth rate in the absence of shear, which scales approximately with |qP|. Both C and α are profile-specific constants, but C is order unity and α≈1. It is further demonstrated that even a large value of shear, duz/dr=3vi/a, is not sufficient to provide linear stabilization of the m=1 kink mode for all profiles considered. This result is in contrast to the currently accepted theory predicting stabilization at much lower shear, duz/dr=0.1vi/a, and suggests that the experimentally observed stability cannot be explained within the linear ideal-MHD model.

Angus, J. R. (ORCID:0000000314740002)↗

Combined molecular dynamics-spin dynamics simulations of bcc iron

Using a classical model that treats translational and spin degrees of freedom on an equal footing, we study phonon-magnon interactions in BCC iron with combined molecular and spin dynamics methods. The atomic interactions are modeled via an empirical many-body potential while spin dependent interactions are established through a Hamiltonian of the Heisenberg form with a distance dependent magnetic exchange interaction obtained from first principles electronic structure calculations. The temporal evolution of translational and spin degrees of freedom was determined by numerically solving the coupled equations of motion, using an algorithm based on the second order Suzuki-Trotter decomposition of the exponential operators. By calculating Fourier transforms of space- and time-displaced correlation functions, we demonstrate that the the presence of lattice vibrations leads to noticeable softening and damping of spin wave modes. As a result of the interplay between lattice and spin subsystems, we also observe additional longitudinal spin wave excitations, with frequencies which coincide with that of the longitudinal lattice vibrations.

Perera, Meewanage Dilina↗

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Streaming Dynamic Mode Decomposition

We propose a reformulation of the streaming dynamic mode decomposition method that requires maintaining a single orthonormal basis, thereby reducing computational redundancy. The proposed efficient streaming dynamic mode decomposition method results in a constant-factor reduction in computational complexity and memory storage requirements. Numerical experiments on representative canonical dynamical systems show that the enhanced computational efficiency does not compromise the accuracy of the proposed method.

97 MATHEMATICS AND COMPUTING↗

On the scattering correction of fast-ion D-alpha signal on NSTX-U

Analysis of fast-ion D-alpha (FIDA) data on National Spherical Torus Experiment-Upgrade (NSTX-U) shows that the cold Dα line contaminates the FIDA baseline. The scattered light is comparable to the FIDA emission. A scattering correction is required to extract the FIDA signal. Two methods that relate the scattered light contamination to the intensity of the cold Dα line are employed. One method uses laboratory measurements with a calibration lamp; the other method uses data acquired during plasma operation and singular value decomposition analysis. After correction, both the FIDA spectra and spatial profile are in better agreement with theoretical predictions.

Single value decomposition (SVD)↗

Optimal experiment design for time-lapse traveltime tomography

Geophysical monitoring techniques offer the only noninvasive approach capable of assessing both the spatial and temporal dynamics of subsurface fluid processes. Increasingly, permanent sensor arrays in boreholes and on the ocean floor are being deployed to improve the repeatability and increase the temporal sampling of monitoring surveys. Because permanent arrays require a large up-front capital investment and are difficult (or impossible) to re-configure once installed, a premium is placed on selecting a geometry capable of imaging the desired target at minimum cost. We present a simple approach to optimizing downhole sensor configurations for monitoring experiments making use of differential seismic traveltimes. In our case, we use a design quality metric based on the accuracy of tomographic reconstructions for a suite of imaging targets. By not requiring an explicit singular value decomposition of the forward operator, evaluation of this objective function scales to problems with a large number of unknowns. We also restrict the design problem by recasting the array geometry into a low dimensional form more suitable for optimization at a reasonable computational cost. We test two search algorithms on the design problem: the Nelder-Mead downhill simplex method and the Multilevel Coordinate Search algorithm. The algorithm is tested for four crosswell acquisition scenarios relevant to continuous seismic monitoring, a two parameter array optimization, several scenarios involving four parameter length/offset optimizations, and a comparison of optimal multi-source designs. In the last case, we also examine trade-offs between source sparsity and the quality of tomographic reconstructions. One general observation is that asymmetric array lengths improve localized image quality in crosswell experiments with a small number of sources and a large number of receivers. Preliminary results also suggest that high-quality differential images can be generated using only a small number of optimally positioned sources.

54 ENVIRONMENTAL SCIENCES↗

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗

Re-analysis procedure based on the mixed formulation

An analysis procedure is presented for large-scale structural systems, with large numbers of degrees of freedom and design variables. The procedure uses a mixed formulation with the fundamental unknowns consisting of both stress and displacement parameters. Other elements of the procedure include: (1) lumping the design variables into a single tracing parameter; (2) operator splitting or additive decomposition of different arrays in the finite element equations into the corresponding arrays of the original structure plus correction terms; and (3) application of a reduction method through the use of the finite element method and the classical Bubnov-Galerkin technique. The re-analysis procedure is applied to the linear static and free vibration problems of plate and shell structures.

Noor, Ahmed K.↗

Domain decomposition algorithms and computational fluid dynamics

Some of the new domain decomposition algorithms are applied to two model problems in computational fluid dynamics: the two-dimensional convection-diffusion problem and the incompressible driven cavity flow problem. First, a brief introduction to the various approaches of domain decomposition is given, and a survey of domain decomposition preconditioners for the operator on the interface separating the subdomains is then presented. For the convection-diffusion problem, the effect of the convection term and its discretization on the performance of some of the preconditioners is discussed. For the driven cavity problem, the effectiveness of a class of boundary probe preconditioners is examined.

Chan, Tony F.↗

High order parallel numerical schemes for solving incompressible flows

The use of parallel computers for numerically solving flow fields has gained much importance in recent years. This paper introduces a new high order numerical scheme for computational fluid dynamics (CFD) specifically designed for parallel computational environments. A distributed MIMD system gives the flexibility of treating different elements of the governing equations with totally different numerical schemes in different regions of the flow field. The parallel decomposition of the governing operator to be solved is the primary parallel split. The primary parallel split was studied using a hypercube like architecture having clusters of shared memory processors at each node. The approach is demonstrated using examples of simple steady state incompressible flows. Future studies should investigate the secondary split because, depending on the numerical scheme that each of the processors applies and the nature of the flow in the specific subdomain, it may be possible for a processor to seek better, or higher order, schemes for its particular subcase.

Lin, Avi↗

Low order dynamical models for mixing layers

The goal of this project was to investigate the feasibility of developing useful low order dynamical systems to allow one to determine cheaply the effect of various initial conditions on the evolution of mixing layers. A mathematically rigorous approach for a time evolving base flow as found in a mixing layer seems to be the singular value decomposition of the linear operator transforming some initial perturbations into the solution at a given later time. Unfortunately, this is very costly, if at all feasible, and only deals with the linear evolution of a disturbance. A different approach based on weakly nonlinear analysis was attempted, but numerous difficulties were encountered. Several formulations were proposed which may be ill-posed. The reasons for this possible failure of the attempted approach is related to the fundamental limitations of weakly nonlinear analysis. The clarification of these issues is attempted in this report.

Riahi, D. N.↗

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗

PARAMESH: A Parallel Adaptive Mesh Refinement Community Toolkit

In this paper, we describe a community toolkit which is designed to provide parallel support with adaptive mesh capability for a large and important class of computational models, those using structured, logically cartesian meshes. The package of Fortran 90 subroutines, called PARAMESH, is designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement. Alternatively, in its simplest use, and with minimal effort, it can operate as a domain decomposition tool for users who want to parallelize their serial codes, but who do not wish to use adaptivity. The package can provide them with an incremental evolutionary path for their code, converting it first to uniformly refined parallel code, and then later if they so desire, adding adaptivity.

MacNeice, Peter↗

Design and assembly of a catalyst bed gas generator for the catalytic decomposition of high concentration hydrogen peroxide propellants and the catalytic combustion of hydrocarbon/air mixtures

A method for designing and assembling a high performance catalyst bed gas generator for use in decomposing propellants, particularly hydrogen peroxide propellants, for use in target, space, and on-orbit propulsion systems and low-emission terrestrial power and gas generation. The gas generator utilizes a sectioned catalyst bed system, and incorporates a robust, high temperature mixed metal oxide catalyst. The gas generator requires no special preheat apparatus or special sequencing to meet start-up requirements, enabling a fast overall response time. The high performance catalyst bed gas generator system has consistently demonstrated high decomposition efficiency, extremely low decomposition roughness, and long operating life on multiple test articles.

Lohner, Kevin A.↗

High-temperature catalyst for catalytic combustion and decomposition

A robust, high temperature mixed metal oxide catalyst for propellant composition, including high concentration hydrogen peroxide, and catalytic combustion, including methane air mixtures. The uses include target, space, and on-orbit propulsion systems and low-emission terrestrial power and gas generation. The catalyst system requires no special preheat apparatus or special sequencing to meet start-up requirements, enabling a fast overall response time. Start-up transients of less than 1 second have been demonstrated with catalyst bed and propellant temperatures as low as 50 degrees Fahrenheit. The catalyst system has consistently demonstrated high decomposition effeciency, extremely low decomposition roughness, and long operating life on multiple test particles.

Mays, Jeffrey A.↗

Quantum-state preparation with universal gate decompositions

In quantum computation every unitary operation can be decomposed into quantum circuits--a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2{sup n} to (23/24)2{sup n} in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Correlated Multimodal Approach Reveals Key Details of Nerve-Agent Decomposition by Single-Site Zr-Based Polyoxometalates

Development of technologies for protection against chemical warfare agents (CWAs) is critically important. Recently, polyoxometalates have attracted attention as potential catalysts for nerve-agent decomposition. Improvement of their effectiveness in real operating conditions requires an atomic-level understanding of CWA decomposition at the gas–solid interface. We investigated decomposition of the nerve agent Sarin and its simulant, dimethyl chlorophosphate (DMCP), by zirconium polytungstate. Using a multimodal approach, we showed that upon DMCP and Sarin exposure the dimeric tungstate undergoes monomerization, making coordinatively unsaturated Zr(IV) centers available, which activate nucleophilic hydrolysis. Furthermore, DMCP is shown to be a good model system of reduced toxicity for studies of CWA deactivation at the gas–solid interface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design and characterization of an electromagnetic-resonant cavity microwave plasma reactor for atmospheric pressure carbon dioxide decomposition

Plasma processes are ideally suited for the conversion of renewable electricity into gas-phase reactivity, such as for the decomposition of carbon dioxide (CO 2 ). The design, development, and characterization of a microwave plasma reactor for atmospheric pressure undiluted carbon dioxide decomposition are presented. The reactor operates as an electromagnetic-resonant cavity in which the generated plasma forms a bulb attached to a converging-diverging nozzle and stabilized by streams of tangentially-injected processing gas. Electromagnetic wave confinement, residence time, and critical gas vorticity constitute fundamental reactor sizing and operation parameters. Experimental findings demonstrate that flow rate plays a dual role in plasma stabilization and process performance, whereas deposited power has a minor role in CO 2 decomposition.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗