Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sequential scheme”

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

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Optimized pulses for Raman excitation through the continuum: Verification using the multiconfigurational time-dependent Hartree-Fock method

Here, we have verified a mechanism for Raman excitation of atoms through continuum levels previously obtained by quantum optimal control using the multiconfigurational time-dependent Hartree-Fock (MCTDHF) method. For the optimal control, which requires running multiple propagations to determine the optimal pulse sequence, we used the computationally inexpensive time-dependent configuration interaction singles (TDCIS) method. TDCIS captures all of the necessary correlation of the desired processes but assumes that ionization pathways reached via double excitations are not present. MCTDHF includes these pathways and all multiparticle correlations in a set of time-dependent orbitals. The mechanism that was determined to be optimal in the Raman excitation of the Ne 1s 2 2s 2 2p 5 3p 1 valence state via the metastable 1s 2 2s 1 2p 6 3p 1 resonance state involves a sequential resonance-valence excitation. First, a long pump pulse excites the core-hole state, and then a shorter Stokes pulse transfers the population to the valence state. This process represents the first step in a multidimensional x-ray spectroscopy scheme that will provide a local probe of valence electronic correlations. Although at the optimal pulse intensities at the TDCIS level of theory the MCTDHF method predicts multiple ionization or excitation ionization of the atom, at slightly lower intensities (reduced by a factor of about 4) the TDCIS mechanism is shown to hold qualitatively. Quantitatively, the MCTDHF populations are reduced from the TDCIS calculations by a factor of 4.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Vernier Regulator for ILC Marx Droop Compensation

A two-part compensation scheme, Vernier Regulation, has been applied to offset the voltage droop (40% without correction) in a Marx-topology klystron modulator developed for the International Linear Collider (ILC). Coarse regulation, {+-}5%, is achieved by turning on additional Main Marx cells (Delayed Cells) sequentially as the droop reaches the cell voltage (11 kV). Further regulation to {+-}0.5% is achieved by adding a small Marx in series with the Main Marx. This Vernier Marx is composed of sixteen, 1.2 kV cells that are assembled as a seventeenth cell in the Main Marx. These Vernier Cells are turned on sequentially to generate a series of discrete corrections to the droop in the Main Marx cells with a step size {le}1% of the output voltage. As the required correction reaches 11 kV, all Vernier Cells are turned off synchronously with the turn on of a Delayed Cell. There are up to five Delayed Cells and six Vernier Marx cycles during each ILC Marx output pulse. The Vernier Marx has a local control system that will detect and respond to over-voltage and over-current errors. In this paper, a detailed description of the design, implementation and testing of the Vernier Marx is presented.

43 PARTICLE ACCELERATORS↗

A game-theoretic approach to nuclear fuel cycle transition analysis under uncertainty

We present a novel methodology for optimizing nuclear fuel cycle transitions that incorporates a game-theoretic approach and captures interactions among multiple decision makers. The methodology is demonstrated using a two-person sequential game with uncertainty, where the two players represent a policy maker and an electric utility company, though the method generalizes to any number and type of individual decision making entities. Coupled with a sophisticated nuclear fuel cycle simulator, rich transition scenarios may be analyzed to identify robust transition strategies. These strategies explicitly treat uncertainties using a stochastic programming approach, devising optimal near-term hedging strategies that simultaneously consider all possible states of the world, maintaining flexibility to allow for intelligent recourse decisions once uncertainties are resolved. In the demonstration game, reactor technology and fuel cycle scheme adopted by the electric utility are shown to depend on both the policy maker’s decisions and the distributions over uncertain technological and economic outcomes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Advanced Millimeter-Wave Security Portal Imaging Techniques

Millimeter-wave imaging is rapidly gaining acceptance for passenger screening at airports and other secured facilities. This paper details a number of techniques developed over the last several years including novel image reconstruction and display techniques, polarimetric imaging techniques, array switching schemes, as well as high frequency high bandwidth techniques. Implementation of some of these methods will increase the cost and complexity of the mm-wave security portal imaging systems. RF photonic methods may provide new solutions to the design and development of the sequentially switched linear mm-wave arrays that are the key element in the mm-wave portal imaging systems.

99 GENERAL AND MISCELLANEOUS↗

Advanced Millimeter-Wave Imaging Enhances Security Screening

Millimeter-wave imaging is rapidly gaining acceptance for passenger screening at airports and other secured facilities. This paper details a number of techniques developed over the last several years including novel image reconstruction and display techniques, polarimetric imaging techniques, array switching schemes, as well as high frequency high bandwidth techniques. Implementation of some of these methods will increase the cost and complexity of the mm-wave security portal imaging systems. RF photonic methods may provide new solutions to the design and development of the sequentially switched linear mm-wave arrays that are the key element in the mm-wave portal imaging systems.

Imaging↗

STRUCTURAL ANALYSES OF FUEL CASKS SUBJECTED TO BOLT PRELOAD, INTERNAL PRESSURE AND SEQUENTIAL DYNAMIC IMPACTS

Large fuel casks subjected to the combined loads of closure bolt tightening, internal pressure and sequential dynamic impacts present challenges when evaluating their performance in the Hypothetical Accident Conditions (HAC) specified in the Code of Federal Regulations Title 10 Part 71 (10CFR71). Testing is often limited by cost, difficulty in preparing test units and the limited availability of facilities which can carry out such tests. In the past, many casks were evaluated without testing by using simplified analytical methods. In addition, there are no realistic analyses of closure bolt stresses for HAC conditions reported in the open literature. This paper presents a numerical technique for analyzing the accumulated damages of a large fuel cask caused by the sequential loads of the closure bolt tightening and the internal pressure as well as the drop and crash dynamic loads. The bolt preload and the internal pressure are treated as quasi-static loads so that the finite element method with explicit numerical integration scheme based on the theory of wave propagation can be applied. The dynamic impacts with short durations such as the 30-foot drop and the 40-inch puncture for the hypothetical accident conditions specified in 10CFR71 are also analyzed by using the finite-element method with explicit numerical integration scheme.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Desorption and Co–Dissolution of Uranium–Bearing Solids During Alkalinity–Enhanced Flushing of Contaminated Sediments

Elevated uranium concentrations in groundwater remain a persistent challenge at contaminated sites. Several sites rely on natural flushing of uranium as a remediation strategy. Uncertainties in conceptual models can cause remediation strategies to underestimate timeframes required to reach remediation goals. In this study, laboratory experiments were conducted to investigate uranium flushing of sediments from a site with persistent groundwater contamination. Six columns were used to simulate alkalinity-enhanced flushing of uranium from sediments, by switching influent alkalinity after ~12 pore volumes. About 20% to 31% of sediment uranium was consistently flushed from the sediments. K d values varied greatly (5.3 to 117 L/kg) but were consistently lower (20% to 50%) during influents with elevated alkalinity. The mass of uranium recovered from the columns also was consistently higher (5% to 80%) during alkalinity-enhanced flushing periods. However, column experiments with sequentially increasing alkalinity showed diminishing returns in uranium elution at higher carbonate concentrations. The loss of flushing efficiency is attributed to significant calcite precipitation at higher alkalinities. Furthermore, the results show that alkalinity-enhanced flushing of uranium could be employed as a viable remediation scheme if calcite precipitation could be minimized in a field application.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Acquisition of STEM Images by Adaptive Compressive Sensing

Compressive Sensing (CS) allows a signal to be sparsely measured first and accurately recovered later in software [1]. In scanning transmission electron microscopy (STEM), it is possible to compress an image spatially by reducing the number of measured pixels, which decreases electron dose and increases sensing speed [2,3,4]. The two requirements for CS to work are: (1) sparsity of basis coefficients and (2) incoherence of the sensing system and the representation system. However, when pixels are missing from the image, it is difficult to have an incoherent sensing matrix. Nevertheless, dictionary learning techniques such as Beta-Process Factor Analysis (BPFA) [5] are able to simultaneously discover a basis and the sparse coefficients in the case of missing pixels. On top of CS, we would like to apply active learning [6,7] to further reduce the proportion of pixels being measured, while maintaining image reconstruction quality. Suppose we initially sample 10% of random pixels. We wish to select the next 1% of pixels that are most useful in recovering the image. Now, we have 11% of pixels, and we want to decide the next 1% of “most informative” pixels. Active learning methods are online and sequential in nature. Our goal is to adaptively discover the best sensing mask during acquisition using feedback about the structures in the image. In the end, we hope to recover a high quality reconstruction with a dose reduction relative to the non-adaptive (random) sensing scheme. In doing this, we try three metrics applied to the partial reconstructions for selecting the new set of pixels: (1) variance, (2) Kullback-Leibler (KL) divergence using a Radial Basis Function (RBF) kernel, and (3) entropy. Figs. 1 and 2 display the comparison of Peak Signal-to-Noise (PSNR) using these three different active learning methods at different percentages of sampled pixels. At 20% level, all the three active learning methods underperform the original CS without active learning. However, they all beat the original CS as more of the “most informative” pixels are sampled. One can also argue that CS equipped with active learning requires less sampled pixels to achieve the same value of PSNR than CS with pixels randomly sampled, since all the three PSNR curves with active learning grow at a faster pace than that without active learning. For this particular STEM image, by observing the reconstructed images and the sensing masks, we find that while the method based on RBF kernel acquires samples more uniformly, the one on entropy samples more areas of significant change, thus less uniformly. The KL-divergence method performs the best in terms of reconstruction error (PSNR) for this example [8].

Xie, Weiyi↗

Highly scalable distributed-memory sparse triangular solution algorithms.

This paper presents a highly efficient distributed-memory parallel sparse triangular solver. The triangular solution phase is often performed following factorization phase in the sparse linear solvers and has become increasingly computa­tionally expensive for direct solvers with many right hand sides (RHSs) or preconditioned iterative solvers. However, the low arithmetic intensity and sequential nature of the triangular solve algorithm pose performance challenges for its large-scale distributed-memory parallelization. In this work, we propose several strategies to enhance scalability of an algorithm with 2D block cyclic process layout. First, an asynchronous binary-tree-based communication scheme implemented via non-blocking MPI functions is leveraged to broadcast partial solutions and reduce partial updates among a subset of processes for each block column and row of the triangular matrix, respectively. This scheme reduces message latency, improves communication load balance and significantly accelerates asynchronous execution of the triangular solve. In addition, efficient BLAS operations and threading implementations are exploited to accelerate local computations and further reduce process idle time. The proposed strategies are implemented in SuperLU_DIST and numerical experiments show up to 4.4x improvement with one right-hand side and up to 6.1x improvement with 50 right- hand sides on 4096 processes, compared to the current release. This is the first time that sparse triangular solution is demonstrated strong scaling on more than 4000 cores.

Liu, Yang↗

X-ray Pump–Probe Investigation of Charge and Dissociation Dynamics in Methyl Iodine Molecule

Molecular dynamics is of fundamental interest in natural science research. The capability of investigating molecular dynamics is one of the various motivations for ultrafast optics. Here, we present our investigation of photoionization and nuclear dynamics in methyl iodine (CH 3 I) molecule with an X-ray pump X-ray probe scheme. The pump–probe experiment was realized with a two-mirror X-ray split and delay apparatus. Time-of-flight mass spectra at various pump–probe delay times were recorded to obtain the time profile for the creation of high charge states via sequential ionization and for molecular dissociation. We observed high charge states of atomic iodine up to 29+, and visualized the evolution of creating these high atomic ion charge states, including their population suppression and enhancement as the arrival time of the second X-ray pulse was varied. We also show the evolution of the kinetics of the high charge states upon the timing of their creation during the ionization-dissociation coupled dynamics. We demonstrate the implementation of X-ray pump–probe methodology for investigating X-ray induced molecular dynamics with femtosecond temporal resolution. The results indicate the footprints of ionization that lead to high charge states, probing the long-range potential curves of the high charge states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Proton-Coupled Electron Transfer in Molecular Electrocatalysis: Theoretical Methods and Design Principles

Molecular electrocatalysts play an essential role in a wide range of energy conversion processes. The objective of electrocatalyst design is to maximize the turnover frequency and minimize the overpotential for the overall catalytic cycle. Typically the catalytic cycle is dominated by key proton-coupled electron transfer (PCET) processes comprised of sequential or concerted electron transfer and proton transfer steps. A variety of theoretical methods have been developed to investigate the mechanisms, thermodynamics, and kinetics of PCET processes in electrocatalytic cycles. Electronic structure methods can be used to calculate the reduction potentials and pKa’s and to generate thermodynamic schemes, free energy reaction pathways, and Pourbaix diagrams, which indicate the most stable species at each pH and potential. These types of calculations have assisted in identifying the thermodynamically favorable mechanisms under specified experimental conditions, such as acid strength and overpotential. Such calculations have also revealed linear correlations among the thermodynamic properties, which can be used to predict the impact of modifying the ligand, substituents, or metal center. The role of non-innocent ligands, namely ligand protonation or reduction, has also been examined theoretically. In addition, the rate constants for electron and proton transfer reactions, as well as concerted PCET reactions, have been calculated to investigate the kinetics of molecular electrocatalysts. The concerted PCET mechanism is thought to lower the overpotential required for catalysis by avoiding high-energy intermediates. Rate constant calculations have revealed that the concerted mechanism involving intramolecular proton transfer will be favored by designing more flexible ligands that facilitate the proton donor-acceptor motion while also maintaining a sufficiently short equilibrium proton donor-acceptor distance. Overall, theoretical methods have assisted in the interpretation of experimental data and the design of more effective molecular electrocatalysts. The research on the Ni(P2N2)2 catalysts was supported as part of the Center for Molecular Electrocatalysis, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences.

Solis, Brian H.↗

Modelling the mechanisms of quantum logic using the method of superimposed Fourier holograms based on the nonlinearity of the exposure characteristics of holographic recording media

A Fourier-holography scheme with superimposed holograms and phase conjugation is considered. It is shown that the sub-holograms, arising from the recording of superimposed holograms due to quadratic nonlinearity of the exposure characteristics of holographic recording media, form the connections necessary for the realisation of the quantum-logic mechanism of sequential projection of the input vector onto the subspaces of the recorded images. A classical mechanism of the ‘Linda’ cognitive phenomenon belonging to the category of quantum-like ones is described. An experimental illustration of the self-sustained formation of sub-holograms due to the nonlinearity of the exposure characteristics of holographic recording media is given. (quantum logic)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-CD-202-01: BEST IN PHYSICS (JOINT IMAGING-THERAPY): Evaluation of the Use of Direct Electron Density CT Images in Radiation Therapy

Purpose: The current standard for calculation of photon and electron dose requires conversion of Hounsfield Units (HU) to Electron Density (ED) by applying a calibration curve specifically constructed for the corresponding CT tube voltage. This practice limits the use of the CT scanner to a single tube voltage and hinders the freedom in the selection of optimal tube voltage for better image quality. The objective of this study is to report a prototype CT reconstruction algorithm that provides direct ED images from the raw CT data independently of tube voltages used during acquisition. Methods: A tissue substitute phantom was scanned for Stoichiometric CT calibrations at tube voltages of 70kV, 80kV, 100kV, 120kV and 140kV respectively. HU images and direct ED images were acquired sequentially on a thoracic anthropomorphic phantom at the same tube voltages. Electron densities converted from the HU images were compared to ED obtained from the direct ED images. A 7-field treatment plan was made on all HU and ED images. Gamma analysis was performed to demonstrate quantitatively dosimetric change from the two schemes in acquiring ED. Results: The average deviation of EDs obtained from the direct ED images was −1.5%±2.1% from the EDs from HU images with the corresponding CT calibration curves applied. Gamma analysis on dose calculated on the direct ED images and the HU images acquired at the same tube voltage indicated negligible difference with lowest passing rate at 99.9%. Conclusion: Direct ED images require no CT calibration while demonstrate equivalent dosimetry compared to that obtained from standard HU images. The ability of acquiring direct ED images simplifies the current practice at a safer level by eliminating CT calibration and HU conversion from commissioning and treatment planning respectively. Furthermore, it unlocks a wider range of tube voltages in CT scanner for better imaging quality while maintaining similar dosimetric accuracy.

60 APPLIED LIFE SCIENCES↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Comparative Implementation of High Performance Computing for Power System Dynamic Simulations

Dynamic simulation for transient stability assessment is one of the most important, but intensive, computations for power system planning and operation. Present commercial software is mainly designed for sequential computation to run a single simulation, which is very time consuming with a single processer. The application of High Performance Computing (HPC) to dynamic simulations is very promising in accelerating the computing process by parallelizing its kernel algorithms while maintaining the same level of computation accuracy. This paper describes the comparative implementation of four parallel dynamic simulation schemes in two state-of-the-art HPC environments: Message Passing Interface (MPI) and Open Multi-Processing (OpenMP). These implementations serve to match the application with dedicated multi-processor computing hardware and maximize the utilization and benefits of HPC during the development process.

97 MATHEMATICS AND COMPUTING↗