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 55 records · Page 3

Sequential self-assembly of DNA functionalized droplets

Complex structures and devices, both natural and manmade, are often constructed sequentially. From crystallization to embryogenesis, a nucleus or seed is formed and built upon. Sequential assembly allows for initiation, signaling, and logical programming, which are necessary for making enclosed, hierarchical structures. Though biology relies on such schemes, they have not been available in materials science. We demonstrate programmed sequential self-assembly of DNA functionalized emulsions. The droplets are initially inert because the grafted DNA strands are pre-hybridized in pairs. Active strands on initiator droplets then displace one of the paired strands and thus release its complement, which in turn activates the next droplet in the sequence, akin to living polymerization. This strategy provides time and logic control during the self-assembly process, and offers a new perspective on the synthesis of materials.

36 MATERIALS SCIENCE↗

Sensitivity of Optimal Solutions to Control Problems for Second Order Evolution Subdifferential Inclusions

In this paper the sensitivity of optimal solutions to control problems described by second order evolution subdifferential inclusions under perturbations of state relations and of cost functionals is investigated. First we establish a new existence result for a class of such inclusions. Then, based on the theory of sequential Γ-convergence we recall the abstract scheme concerning convergence of minimal values and minimizers. The abstract scheme works provided we can establish two properties: the Kuratowski convergence of solution sets for the state relations and some complementary Γ-convergence of the cost functionals. Then these two properties are implemented in the considered case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗

Equation-based object-oriented modeling and simulation for data center cooling: A case study

© 2019 Elsevier B.V. Data center cooling accounts for about 1% of electricity usage in the United States. Computer models are pivotal in designing and operating energy-efficient cooling systems. Compared to conventional building performance simulation programs, the equation-based object-oriented modeling language Modelica is an emerging approach that can enable fast prototyping and dynamic simulation of cooling systems. In this case study, we first modeled the cooling and control systems of an actual data center located in Massachusetts using the open-source Modelica Buildings library, and then calibrated a baseline model based on measurement data. The simulation of the baseline model identified several operation-related issues in the cooling and control systems, such as degraded cooling coils, improper dead band in control settings, and simultaneous cooling and heating in air handlers. Afterwards, we used a sequential search technique as well as an optimization scheme to investigate the energy saving potentials for different energy efficiency measures aiming to address the abovementioned issues. Simulation results show potential energy savings up to 24% by resolving identified control-related issues and optimizing the supply air temperature.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗

A numerical method for simulating variable density flows in membrane desalination systems

Here, we present a novel method for simulating unsteady, variable density, fluid flows in membrane desalination systems. By assuming the density varies only with concentration and temperature, the scheme decouples the solution of the governing equations into two sequential blocks. The first solves the governing equations for the temperature and concentration fields, which are used to compute all thermophysical properties. The second block solves the conservation of mass and momentum equations for the velocity and pressure. We show that this is computationally more efficient than schemes that iterate over the full coupled equations in one block. We verify that the method achieves second-order spatial-temporal accuracy, and we use the method to investigate buoyancy-driven convection in a desalination process called vacuum membrane distillation. Specifically, we show that with gravity properly oriented, variations in temperature and concentration can trigger a double-diffusive instability that enhances mixing and improves water recovery. We also show that the instability can be strengthened by providing external heating.

97 MATHEMATICS AND COMPUTING↗

Multigrid Smoothers for Ultra-Parallel Computing: Additional Theory and Discussion

This paper investigates the properties of smoothers in the context of algebraic multigrid (AMG) running on parallel computers with potentially millions of processors. The development of multigrid smoothers in this case is challenging, because some of the best relaxation schemes, such as the Gauss-Seidel (GS) algorithm, are inherently sequential. Based on the sharp two-grid multigrid theory from we characterize the smoothing properties of a number of practical candidates for parallel smoothers, including several C-F, polynomial, and hybrid schemes. We show, in particular, that the popular hybrid GS algorithm has multigrid smoothing properties which are independent of the number of processors in many practical applications, provided that the problem size per processor is large enough. This is encouraging news for the scalability of AMG on ultra-parallel computers. We also introduce the more robust `1 smoothers, which are always convergent and have already proven essential for the parallel solution of some electromagnetic problems.

97 MATHEMATICS AND COMPUTING↗

Optimal mode transformations for linear-optical cluster-state generation

In this paper, we analyze the generation of linear-optical cluster states (LOCSs) via sequential addition of one and two qubits. Existing approaches employ the stochastic linear-optical two-qubit controlled-Z (CZ) gate with success rate of 1/9 per operation. The question of optimality of the CZ gate with respect to LOCS generation has remained open. We report that there are alternative schemes to the CZ gate that are exponentially more efficient and show that sequential LOCS growth is indeed globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. Finally, we show that the maximal success rate of postselected entangling n photonic qubits or m Bell pairs into a cluster is (1/2) n-1 and (1/4) m-1 , respectively, with no ancilla photons, and we give an explicit optical description of the optimal mode transformations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

We report that to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable “repeat-until-success” approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. Ultimately, we find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Power Converter Circuit Design Automation using Parallel Monte Carlo Tree Search

The tidal waves of modern electronic/electrical devices have led to increasing demands for ubiquitous application-specific power converters. A conventional manual design procedure of such power converters is computation- and labor-intensive, which involves selecting and connecting component devices, tuning component-wise parameters and control schemes, and iteratively evaluating and optimizing the design. To automate and speed up this design process, we propose an automatic framework that designs custom power converters from design specifications using Monte Carlo Tree Search. Specifically, the framework embraces the upper-confidence-bound-tree (UCT), a variant of Monte Carlo Tree Search, to automate topology space exploration with circuit design specification-encoded reward signals. Moreover, our UCT-based approach can exploit small offline data via the specially designed default policy and can run in parallel to accelerate topology space exploration. Further, it utilizes a hybrid circuit evaluation strategy to substantially reduce design evaluation costs. Empirically, we demonstrated that our framework could generate energy-efficient circuit topologies for various target voltage conversion ratios. Compared to existing automatic topology optimization strategies, the proposed method is much more computationally efficient --- the sequential version can generate topologies with the same quality while being up to 67% faster. Here, the parallelization schemes can further achieve high speedups compared to the sequential version.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗

Zero-Order Phased Fiber Arrays

Phased arrays remain an important strategy for scaling average power and pulse energy in optical fiber lasers. In zero-order arrays, the lengths of the constituent lasers or amplifiers are matched to within the coherence length of a pulse; for fibers having bandwidths on the order of one nanometer, lengths must be matched to 1 mm; for fiber having bandwidths on the order of 30 nm (pulse duration of 100 fs), lengths must be matched to 30 {micro}m. The overarching goal of this work has been to demonstrate a scaling path to 10 mJ pulses from an array of fiber lasers, with each fiber contributing roughly 1 mJ of energy. The near term goals were, and remain, two-fold. First, to demonstrate that arrays of fiber amplifier chains can be created having path length differences on the order of sub-picoseconds. This has been accomplished, showing that sub-nanojoule, 200 fs pulses can be split into an array of four chains, each chain amplified with a single preamp, and the outputs can be recombined within the coherence length of the pulses. The second near term goal, stabilizing the phase through active feedback, is not yet complete. The strategy has been to generate an out-of-band CW seed signal that is monitored to account for fluctuations in path length that occur between pulses. At this point the necessary hardware is in place, but the control electronics are not. We expect the co-phasing work to continue under separate funding, though in a simpler form. Instead of combining pulses from many amplifiers we would combine many sequential pulses from a single fiber laser via a resonant cavity. Such a scheme is less expensive to build and test (and eventually, to field), though significant technical hurdles must be overcome, including the development of a low-loss mechanism for releasing the energy that is built up within the cavity.

42 ENGINEERING↗

Graph-Based Representations and Applications to Process Simulation

Rapid and robust convergence of a process flowsheet is critical to enable large-scale simulations that address core scientific questions related to process design, optimization, and sustainability. However, due to the highly coupled and nonlinear nature of chemical processes, efficiently solving a flowsheet remains a challenge. In this work, we show that graph representations of the underlying physical phenomena in unit operations may help identify potential avenues to systematically reformulate the network of equations and enable more robust topology-based convergence of flowsheets. To this end, we developed graph abstractions of the governing equations of vapor-liquid and liquid-liquid equilibrium separation equipment. These graph abstractions consist of a mesh of interconnected variable nodes and equation nodes that are systematically generated through PhenomeNode, a new open-source library in Python developed in this study. We show that partitioning the graph into separate mass, energy, and equilibrium subgraphs can help decouple nonlinearities and guide decomposition algorithms. By employing the graph abstraction on an industrial separation process for separating glacial acetic acid from water, we implemented a new block decomposition scheme in BioSTEAM and demonstrated that this can accelerate convergence over a traditional sequential modular approach.

Distillation↗

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗

Sequential limiting in continuous and discontinuous Galerkin methods for the Euler equations

We present a new predictor-corrector approach to enforcing local maximum principles in piecewise-linear finite element schemes for the compressible Euler equations. The new element-based limiting strategy is suitable for continuous and discontinuous Galerkin methods alike. In contrast to synchronized limiting techniques for systems of conservation laws, we constrain the density, momentum, and total energy in a sequential manner which guarantees positivity preservation for the pressure and internal energy. After the density limiting step, the total energy and momentum gradients are adjusted to incorporate the irreversible effect of density changes. Antidiffusive corrections to bounds-compatible low-order approximations are limited to satisfy inequality constraints for the specific total and kinetic energy. An accuracy-preserving smoothness indicator is introduced to gradually adjust lower bounds for the element-based correction factors. The employed smoothness criterion is based on a Hessian determinant test for the density. Finally, a numerical study is performed for test problems with smooth and discontinuous solutions.

97 MATHEMATICS AND COMPUTING↗

Effect of Computational Schemes on Coupled Flow and Geo-Mechanical Modeling of CO 2 Leakage through a Compromised Well

Carbon capture, utilization, and storage (CCUS) describes a set of technically viable processes to separate carbon dioxide (CO 2 ) from industrial byproduct streams and inject it into deep geologic formations for long-term storage. Legacy wells located within the spatial domain of new injection and production activities represent potential pathways for fluids (i.e., CO 2 and aqueous phase) to leak through compromised components (e.g., through fractures or micro-annulus pathways). The finite element (FE) method is a well-established numerical approach to simulate the coupling between multi-phase fluid flow and solid phase deformation interactions that occur in a compromised well system. We assumed the spatial domain consists of a three-phases system: a solid, liquid, and gas phase. For flow in the two fluids phases, we considered two sets of primary variables: the first considering capillary pressure and gas pressure (PP) scheme, and the second considering liquid pressure and gas saturation (PS) scheme. Fluid phases were coupled with the solid phase using the full coupling (i.e., monolithic coupling) and iterative coupling (i.e., sequential coupling) approaches. The challenge of achieving numerical stability in the coupled formulation in heterogeneous media was addressed using the mass lumping and the upwinding techniques. Numerical results were compared with three benchmark problems to assess the performance of coupled FE solutions: 1D Terzaghi’s consolidation, Liakopoulos experiments, and the Kueper and Frind experiments. We found good agreement between our results and the three benchmark problems. For the Kueper and Frind test, the PP scheme successfully captured the observed experimental response of the non-aqueous phase infiltration, in contrast to the PS scheme. These exercises demonstrate the importance of fluid phase primary variable selection for heterogeneous porous media. We then applied the developed model to the hypothetical case of leakage along a compromised well representing a heterogeneous media. Considering the mass lumping and the upwinding techniques, both the monotonic and the sequential coupling provided identical results, but mass lumping was needed to avoid numerical instabilities in the sequential coupling. Additionally, in the monolithic coupling, the magnitude of primary variables in the coupled solution without mass lumping and the upwinding is higher, which is essential for the risk-based analyses.

deformation flow↗

Autonomous stabilization with programmable stabilized state

Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Search for medium effects using jet axis decorrelation in inclusive jets from PbPb collisions at $\sqrt{{s}_{\text{NN}}}$ = 5.02 TeV

The jet axis decorrelation in inclusive jets is studied using lead-lead (PbPb) collisions at a center-of-mass energy per nucleon pair of 5.02 TeV. The jet axis decorrelation is defined as the angular difference between two definitions of the jet axis. It is obtained by applying two recombination schemes on all the constituents of a given jet reconstructed by the anti-kT sequential algorithm with a distance parameter of R = 0.4. The data set, corresponding to an integrated luminosity of 0.66 nb −1 , was collected in 2018 with the CMS detector at the CERN LHC. The jet axis decorrelations are examined across collision centrality selections and intervals of jet transverse momentum. A centrality dependent evolution of the measured distributions is observed, with a progressive narrowing seen in more central events. This narrowing could result from medium-induced modification of the internal jet structure or reflect color charge effects in energy loss. This new measurement probes jet substructure in previously unexplored kinematic domains and show great promise for providing new insights on the color charge dependence of energy loss to jet-quenching models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗