Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequential dependencies”

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

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

Local oscillator induced degradation of medium-term stability in passive atomic frequency standards

As the performance of passive atomic frequency standards improves, a new limitation is encountered due to frequency fluctuations in an ancillary local oscillator (L.O.). The effect is due to time variation in the gain of the feedback which compensates L.O. frequency fluctuations. The high performance promised by new microwave and optical trapped ion standards may be severely compromised by this effect. Researchers present an analysis of this performance limitation for the case of sequentially interrogated standards. The time dependence of the sensitivity of the interrogation process to L.O. frequency fluctuations is evaluated for single-pulse and double-pulse Ramsey RF interrogation and for amplitude modulated pulses. The effect of these various time dependencies on performance of the standard is calculated for an L.O. with frequency fluctuations showing a typical 1/f spectral density. A limiting 1/sq. root gamma dependent deviation of frequency fluctuations is calculated as a function of pulse lengths, dead time, and pulse overlap. Researchers also present conceptual and hardware-oriented solutions to this problem which achieve a much more nearly constant sensitivity to L.O. fluctuations. Solutions involve use of double-pulse interrogation; alternate interrogation of multiple traps so that the dead time of one trap can be covered by operation of the other; and the use of double-pulse interrogation for two traps, so that during the time of the RF pulses, the increasing sensitivity of one trap tends to compensate for the decreasing sensitivity of the other. A solution making use of amplified-modulated pulses is also presented which shows nominally zero time variation.

Dick, G. John↗

Numerical Simulation of Rolling-Airframes Using a Multi-Level Cartesian Method

A supersonic rolling missile with two synchronous canard control surfaces is analyzed using an automated, inviscid, Cartesian method. Sequential-static and time-dependent dynamic simulations of the complete motion are computed for canard dither schedules for level flight, pitch, and yaw maneuver. The dynamic simulations are compared directly against both high-resolution viscous simulations and relevant experimental data, and are also utilized to compute dynamic stability derivatives. The results show that both the body roll rate and canard dither motion influence the roll-averaged forces and moments on the body. At the relatively, low roll rates analyzed in the current work these dynamic effects are modest, however the dynamic computations are effective in predicting the dynamic stability derivatives which can be significant for highly-maneuverable missiles.

Murman, Scott M.↗

Receptor Activation of HIV-1 Env Leads to Asymmetric Exposure of the gp41 Trimer

Structural rearrangements of HIV-1 glycoprotein Env promote viral entry through membrane fusion. Env is a symmetric homotrimer with each protomer composed of surface subunit gp120 and transmembrane subunit gp41. Cellular CD4- and chemokine receptor-binding to gp120 coordinate conformational changes in gp41, first to an extended prehairpin intermediate (PHI) and, ultimately, into a fusogenic trimer-of-hairpins (TOH). HIV-1 fusion inhibitors target gp41 in the PHI and block TOH formation. To characterize structural transformations into and through the PHI, we employed asymmetric Env trimers containing both high and low affinity binding sites for individual fusion inhibitors. Asymmetry was achieved using engineered Env heterotrimers composed of protomers deficient in either CD4- or chemokine receptor-binding. Linking receptor engagement to inhibitor affinity allowed us to assess conformational changes of individual Env protomers in the context of a functioning trimer. We found that the transition into the PHI could occur symmetrically or asymmetrically depending on the stoichiometry of CD4 binding. Sequential engagement of multiple CD4s promoted progressive exposure of individual fusion inhibitor binding sites in a CD4-dependent fashion. By contrast, engagement of only a single CD4 molecule led to a delayed, but symmetric, exposure of the gp41 trimer. This complex coupling between Env-CD4 interaction and gp41 exposure explained the multiphasic fusion-inhibitor titration observed for a mutant Env homotrimer with a naturally asymmetric gp41. Our results suggest that the spatial and temporal exposure of gp41 can proceed in a nonconcerted, asymmetric manner depending on the number of CD4s that engage the Env trimer. The findings have important implications for the mechanism of viral membrane fusion and the development of vaccine candidates designed to elicit neutralizing antibodies targeting gp41 in the PHI.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

Sequential and coordinated action of phytochromes A and B during Arabidopsis stem growth revealed by kinetic analysis

Photoreceptor proteins of the phytochrome family mediate light-induced inhibition of stem (hypocotyl) elongation during the development of photoautotrophy in seedlings. Analyses of overt mutant phenotypes have established the importance of phytochromes A and B (phyA and phyB) in this developmental process, but kinetic information that would augment emerging molecular models of phytochrome signal transduction is absent. We have addressed this deficiency by genetically dissecting phytochrome-response kinetics, after having solved the technical issues that previously limited growth studies of small Arabidopsis seedlings. We show here, with resolution on the order of minutes, that phyA initiated hypocotyl growth inhibition upon the onset of continuous red light. This primary contribution of phyA began to decrease after 3 hr of irradiation, the same time at which immunochemically detectable phyA disappeared and an exclusively phyB-dependent phase of inhibition began. The sequential and coordinated actions of phyA and phyB in red light were not observed in far-red light, which inhibited growth persistently through an exclusively phyA-mediated pathway.

NASA Discipline Plant Biology↗

Parallel-in-Time Multigrid Methods for Hyperbolic Problems, with a Focus on the Shallow Water Equations

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations, which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic problems of programmatic interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic problems on future architectures. The difficulty lies in the fact that hyperbolic problems are well-known to be difficult for parallel-in-time methods, with the most common parallel-in-time method, Parareal, diverging in many cases. Here, the chosen methodology for scalably solving these hyperbolic space-time equations is multigrid-reductionin-time (MGRIT), because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. To further research in this area, this project will explore a model hyperbolic problem (the shallow water equations) in the context of recent advances (e.g., by Wingate and Haut) in constructing improved coarse time-grid time-propagators by using the slow asymptotic structure of the equations. In particular, we will investigate if such coarse time-propagators offer significant advantages in an MGRIT setting, and explore any broader insights gained into parallel-in-time for hyperbolic problems.

97 MATHEMATICS AND COMPUTING↗

Influence of sequential stimulation practices on geochemical alteration of shale

Water-based hydraulic fracturing fluids (HFFs) can chemically interact with formation shale, resulting in altered porosity and permeability of the host rock. Experimental investigations of spatial and temporal shale-HFF interactions are helpful in interpreting chemical compositions of the injectate, as well as predicting alteration of hydraulic properties in the reservoir due to mineral dissolution and precipitation. Most bench-top experiments designed to study shale-HFF chemical interactions, either using batch reactors or flow-through setups, are carried out assuming that the acid spearhead has already become mixed with neutral HFFs. During operations, however, HFFs are typically injected according to a sequenced pumping schedule, starting with a concentrated acid spearhead, followed by multiple additions of near-neutral pH HFFs containing chemical amendments and proppant. In this study, we use geochemical modeling to consider whether this pre-mixed experimental protocol provides results directly comparable to a sequential discrete fluid-shale interaction protocol. Our results show that for the batch system, the transient evolution in major ion concentrations is faster with the sequential procedure. After 2 h of reaction time, the two protocols converge to the same aqueous concentrations. In a flow-through geometry, the pre-mixed model predicts extensive chemical alteration close to the injection point but negligible alteration downstream. In contrast, the sequential model predicts mineral reactions over hundreds of meters along the flow path. The extent of shale alteration in the sequential model at a given location depends on shale mineralogy and where the acid spearhead resides during the shut-in period. The predictive model developed in this study can help experimentalists to design bench-top tests and operators to better translate the results of laboratory experiments into practical applications.

Li, Qingyun↗

Numerical calculation of transonic axial turbomachinery flows

A numerical method and the results of a computer program are presented for solving an exact, three dimensional, full potential equation that models rotating and nonrotating inviscid, absolutely irrotational, homentropic flows. Besides calculating the flows through an arbitrarily shaped rotor or stator blade row mounted on an axisymmetric hub and confined in an axisymmetric duct, the computer program is also capable of analyzing flow fields about arbitrarily shaped wing body combinations, propellers, helicopter rotors in hover, and wind turbine rotors. The governing equation is solved numerically in a fully conservative form by using an artificial time concept, a finite volume technique, rotated type dependent differencing, successive line overrelaxation, and sequential boundary conforming grid refinement. An artificial viscosity is added in fully conservative form, and an initial guess for the potential field is applied, as determined by a two dimensional cascade analysis.

Dulikravich, D. S.↗

Numerical calculation of transonic axial turbomachinery flows

This paper presents a numerical method and the results of a computer program for solving an exact, three-dimensional, full-potential equation that models rotating and nonrotating inviscid, absolutely irrotational, homentropic flows. Besides calculating the flows through an arbitrarily shaped rotor or stator blade row mounted on an axisymmetric hub and confined in an axisymmetric duct, the computer program is also capable of analysing flow fields about arbitrarily shaped wing-body combinations, propellers, helicopter rotors in hover, and wind turbine rotors. The governing equation is solved numerically in a fully conservative form by using an artificial time concept, a finite volume technique, rotated type-dependent differencing, successive line overrelaxation, and sequential boundary-conforming grid refinement. An artificial viscosity is added in fully conservative form; and an initial guess for the potential field is applied, as determined by a two-dimensional cascade analysis.

Dulikravich, D. S.↗

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations, which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of programmatic interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures.

97 MATHEMATICS AND COMPUTING↗

Simulations of 6-DOF Motion with a Cartesian Method

Coupled 6-DOF/CFD trajectory predictions using an automated Cartesian method are demonstrated by simulating a GBU-32/JDAM store separating from an F-18C aircraft. Numerical simulations are performed at two Mach numbers near the sonic speed, and compared with flight-test telemetry and photographic-derived data. Simulation results obtained with a sequential-static series of flow solutions are contrasted with results using a time-dependent flow solver. Both numerical methods show good agreement with the flight-test data through the first half of the simulations. The sequential-static and time-dependent methods diverge over the last half of the trajectory prediction. after the store produces peak angular rates. A cost comparison for the Cartesian method is included, in terms of absolute cost and relative to computing uncoupled 6-DOF trajectories. A detailed description of the 6-DOF method, as well as a verification of its accuracy, is provided in an appendix.

Murman, Scott M.↗

Mechanical System Reliability and Cost Integration Using a Sequential Linear Approximation Method

The development of new products is dependent on product designs that incorporate high levels of reliability along with a design that meets predetermined levels of system cost. Additional constraints on the product include explicit and implicit performance requirements. Existing reliability and cost prediction methods result in no direct linkage between variables affecting these two dominant product attributes. A methodology to integrate reliability and cost estimates using a sequential linear approximation method is proposed. The sequential linear approximation method utilizes probability of failure sensitivities determined from probabilistic reliability methods as well a manufacturing cost sensitivities. The application of the sequential linear approximation method to a mechanical system is demonstrated.

Kowal, Michael T.↗

General Kinetic Model for pH Dependence of Proton-Coupled Electron Transfer: Application to an Electrochemical Water Oxidation System

The pH dependence of proton-coupled electron transfer (PCET) reactions, which are critical to many chemical and biological processes, is a powerful probe for elucidating their fundamental mechanisms. Herein, a general, multichannel kinetic model is introduced to describe the pH dependence of both homogeneous and electrochemical PCET reactions. According to this model, a weak pH dependence can arise from the competition among multiple sequential and concerted PCET channels involving different forms of the redox species, such as protonated and deprotonated forms, as well as different proton donors and acceptors. The contribution of each channel is influenced by the relative populations of the reactant species, which often depend strongly on pH, leading to complex pH dependence of PCET apparent rate constants. This model is used to explain the origins of the experimentally observed weak pH dependence of the electrochemical PCET apparent rate constant for a ruthenium-based water oxidation catalyst attached to a tin-doped In2O3 (ITO) surface. The weak pH dependence is found to arise from the intrinsic differences in the rate constants of participating channels and the dependence of their relative contributions on pH. This model predicts that the apparent maximum rate constant will become pH-independent at higher pH, which is confirmed by experimental measurements. Our analysis also suggests that the dominant channels are electron transfer at lower pH and sequential PCET via electron transfer followed by fast proton transfer at higher pH. Furthermore, this work highlights the importance of considering multiple competing channels simultaneously for PCET processes.

Catalysts↗

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗

Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides

The sparse triangular solve kernels, SpTRSV and SpTRSM, are important building blocks for a number of numerical linear algebra routines. Parallelizing SpTRSV and SpTRSM on today's many-core platforms, such as GPUs, is not an easy task since computing a component of the solution may depend on previously computed components, enforcing a degree of sequential processing. As a consequence, most existing work introduces a preprocessing stage to partition the components into a group of level-sets or colour-sets so that components within a set are independent and can be processed simultaneously during the subsequent solution stage. However, this class of methods requires a long preprocessing time as well as significant runtime synchronization over-heads between the sets. To address this, we

HPC↗