Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit”

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 919 records · Page 51

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗

Intrepid MCMC: Metropolis-Hastings with exploration

In engineering examples, one often encounters the need to sample from unnormalized distributions with complex shapes that may also be implicitly defined through a physical or numerical simulation model, making it computationally expensive to evaluate the associated density function. For such cases, MCMC has proven to be an invaluable tool. Random-walk Metropolis Methods (also known as Metropolis-Hastings (MH)), in particular, are highly popular for their simplicity, flexibility, and ease of implementation. However, most MH algorithms suffer from significant limitations when attempting to sample from distributions with multiple modes (particularly disconnected ones). Here, in this paper, we present Intrepid MCMC - a novel MH scheme that utilizes a simple coordinate transformation to significantly improve the mode-finding ability and convergence rate to the target distribution of random-walk Markov chains while retaining most of the simplicity of the vanilla MH paradigm. Through multiple examples, we showcase the improvement in the performance of Intrepid MCMC over vanilla MH for a wide variety of target distribution shapes. We also provide an analysis of the mixing behavior of the Intrepid Markov chain, as well as the efficiency of our algorithm for increasing dimensions. A thorough discussion is presented on the practical implementation of the Intrepid MCMC algorithm. Finally, its utility is highlighted through a Bayesian parameter inference problem for a two-degree-of-freedom oscillator under free vibration.

97 - MATHEMATICS AND COMPUTING↗

Slow manifold reduction for plasma science

The classical Chapman–Enskog procedure admits a substantial geometrical generalization known as slow manifold reduction. This generalization provides a paradigm for deriving and understanding most reduced models in plasma physics that are based on controlled approximations applied to problems with multiple timescales. In this Review we develop the theory of slow manifold reduction with a plasma physics audience in mind. In particular we illustrate (a) how the slow manifold concept may be used to understand breakdown of a reduced model over sufficiently-long time intervals, and (b) how a discrete-time analogue of slow manifold theory provides a useful framework for developing implicit integrators for temporally-stiff plasma models. For readers with more advanced mathematical training we also use slow manifold reduction to explain the phenomenon of inheritance of Hamiltonian structure in dissipation-free reduced plasma models. Various facets of the theory are illustrated in the context of the Abraham–Lorentz model of a single charged particle experiencing its own radiation drag. As a culminating example we derive the slow manifold underlying kinetic quasineutral plasma dynamics up to first-order in perturbation theory. This first-order result incorporates several physical effects associated with small deviations from exact charge neutrality that lead to slow drift away from predictions based on the leading-order approximation n e = Z i n i .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A dynamic multi-timescale method for combustion modeling with detailed and reduced chemical kinetic mechanisms

A new on-grid dynamic multi-timescale (MTS) method is presented to increase significantly the computation efficiency involving multi-physical and chemical processes using detailed and reduced kinetic mechanisms. The methodology of the MTS method using the instantaneous timescales of different species is introduced. The definition of the characteristic time for species is examined and compared with that of the computational singular perturbation (CSP) and frozen reaction rate methods by using a simple reaction system. A hybrid multi-timescale (HMTS) algorithm is constructed by integrating the MTS method with an implicit Euler scheme, respectively, for species with and without the requirement of accurate time histories at sub-base timescales. The efficiency and the robustness of the MTS and HMTS methods are demonstrated by comparing with the Euler and VODE solvers for homogenous ignition and unsteady flame propagation of hydrogen, methane, and n-decane-air mixtures. The results show that both MTS and HMTS reproduce well the species and temperature histories and are able to decrease computation time by about one-order with the same kinetic mechanism. Compared to MTS, HMTS has slightly better computation efficiency but scarifies the stability at large base time steps. The results also show that with the increase of mechanism size and the decrease of time step, the computation efficiency of multi-timescale method increases compared to the VODE solver. In addition, it is shown that the integration of the multi-timescale method with the path flux analysis based mechanism reduction approach can further increase the computation efficiency. Unsteady simulations of outwardly propagating spherical n-decane-air premixed flames demonstrate that the multi-timescale method is rigorous for direct numerical simulations with both detailed and reduced chemistry and can dramatically improve the computation efficiency. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A jet fuel surrogate formulated by real fuel properties

An implicit methodology based on chemical group theory to formulate a jet aviation fuel surrogate by the measurements of several combustion related fuel properties is tested. The empirical formula and derived cetane number of an actual aviation fuel, POSF 4658, have been determined. A three component surrogate fuel for POSF 4658 has been formulated by constraining a mixture of n-decane, iso-octane and toluene to reproduce the hydrogen/carbon ratio and derived cetane number of the target fuel. The validity of the proposed surrogate is evaluated by experimental measurement of select combustion properties of POSF 4658, and the POSF 4658 surrogate. (1)A variable pressure flow reactor has been used to chart the chemical reactivity of stoichiometric mixtures of POSF 4658/O{sub 2}/N{sub 2} and POSF 4658 surrogate/O{sub 2}/N{sub 2} at 12.5 atm and 500-1000 K, fixing the carbon content at 0.3% for both mixtures. (2)The high temperature chemical reactivity and chemical kinetic-molecular diffusion coupling of POSF 4658 and POSF 4658 surrogate have been evaluated by measurement of the strained extinction limit of diffusion flames. (3)The autoignition behavior of POSF 4658 and POSF 4658 surrogate has been measured with a shock tube at 674-1222 K and with a rapid compression machine at 645-714 K for stoichiometric mixtures of fuel in air at pressures close to 20 atm. The flow reactor study shows that the character and extent of chemical reactivity of both fuels at low temperature (500-675 K) and high temperature (900 K+) are extremely similar. Slight differences in the transition from the end of the negative temperature coefficient regime to hot ignition are observed. The diffusion flame strained extinction limits of the fuels are observed to be indistinguishable when compared on a molar basis. Ignition delay measurements also show that POSF 4658 exhibits NTC behavior. Moreover, the ignition delays of both fuels are also extremely similar over the temperature range studied in both shock tube and rapid compression machine experiments. A chemical kinetic model is constructed and utilized to interpret the experimental observations and provides a rationale as to why the real fuel and surrogate fuel exhibit such similar reactivity. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Symbolic construction of the chemical Jacobian of quasi-steady state (QSS) chemistries for Exascale computing platforms

The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of chemical mechanisms for implementation in computational reacting flow solvers. However, for many applications, the resulting model still requires implicit methods for efficient time integration. Here, in this paper, we outline an approach to formulating the QSSA reduction that is coupled with a strategy to generate C++ source code to evaluate the net species production rates, and the chemical Jacobian. The code-generation component employs a symbolic approach enabling a simple and effective strategy to analytically compute the chemical Jacobian. For computational tractability, the symbolic approach needs to be paired with common subexpression elimination which can negatively affect memory usage. Several solutions are outlined and successfully tested on a 3D multipulse ignition problem, thus allowing portable application across chemical model sizes and GPU capabilities. The implementation of the proposed method is available at https://github.com/AMReX-Combustion/PelePhysics under an open-source license.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A sharp interface model for deterministic simulation of dendrite growth

A high order level set model is developed for deterministic simulation of dendritic growth in unstable solidifying systems. The model captures motion of the front implicitly on a structured finite difference grid, enables calculation of its geometric properties and also applies boundary conditions on the immersed interface. Interfacial capillary effect is incorporated in the model through the Gibbs-Thomson condition. Canonical problems for evaluating grid convergence of the numerical method and validation tests for stability of a growing nucleus in the presence of isotropic surface tension are presented. The growth morphology of solidifying nuclei in undercooled metallic melts is quantitatively analyzed. Effects of crystal anisotropy and melt undercooling on the front geometry, propagation speed and formation of branched dendritic structures are examined. In conclusion, the complex morphological changes, such as remelting of secondary perturbations under specific conditions of undercooling, are also captured during the quantitative analysis.

36 MATERIALS SCIENCE↗

Tri-peptide reference structures for the calculation of relative solvent accessible surface area in protein amino acid residues

Relative amino acid residue solvent accessibility values allow the quantitative comparison of atomic solvent-accessible surface areas in different residue types and physical environments in proteins and in protein structural alignments. Geometry-optimised tri-peptide structures in extended solvent-exposed reference conformations have been obtained for 43 amino acid residue types at a high level of quantum chemical theory. Significant increases in side-chain solvent accessibility, offset by reductions in main-chain atom solvent exposure, were observed for standard residue types in partially geometry-optimised structures when compared to non-minimised models built from identical sets of proper dihedral angles abstracted from the literature. Optimisation of proper dihedral angles led most notably to marked increases of up to 54% in proline main-chain atom solvent accessibility compared to literature values. Similar effects were observed for fully-optimised tri-peptides in implicit solvent. The relief of internal strain energy was associated with systematic variation in N, C α and C β atom solvent accessibility across all standard residue types. The results underline the importance of optimisation of ‘hard’ degrees of freedom (bond lengths and valence bond angles) and improper dihedral angle values from force field or other context-independent reference values, and impact on the use of standardised fixed internal co-ordinate geometry in sampling approaches to the determination of absolute values of protein amino acid residue solvent accessibility. Finally, quantum chemical methods provide a useful and accurate alternative to molecular mechanics methods to perform energy minimisation of peptides containing non-standard (chemically modified) amino acid residues frequently present in experimental protein structure data sets, for which force field parameters may not be available. Reference tri-peptide atomic co-ordinate sets including hydrogen atoms are made freely available.

59 BASIC BIOLOGICAL SCIENCES↗

Mesoscale Simulations of Particulate Flows with Parallel Distributed Lagrange Multiplier Technique

Fluid particulate flows are common phenomena in nature and industry. Modeling of such flows at micro and macro levels as well establishing relationships between these approaches are needed to understand properties of the particulate matter. We propose a computational technique based on the direct numerical simulation of the particulate flows. The numerical method is based on the distributed Lagrange multiplier technique following the ideas of Glowinski et al. (1999). Each particle is explicitly resolved on an Eulerian grid as a separate domain, using solid volume fractions. The fluid equations are solved through the entire computational domain, however, Lagrange multiplier constrains are applied inside the particle domain such that the fluid within any volume associated with a solid particle moves as an incompressible rigid body. Mutual forces for the fluid-particle interactions are internal to the system. Particles interact with the fluid via fluid dynamic equations, resulting in implicit fluid-rigid-body coupling relations that produce realistic fluid flow around the particles (i.e., no-slip boundary conditions). The particle-particle interactions are implemented using explicit force-displacement interactions for frictional inelastic particles similar to the DEM method of Cundall et al. (1979) with some modifications using a volume of an overlapping region as an input to the contact forces. The method is flexible enough to handle arbitrary particle shapes and size distributions. A parallel implementation of the method is based on the SAMRAI (Structured Adaptive Mesh Refinement Application Infrastructure) library, which allows handling of large amounts of rigid particles and enables local grid refinement. Accuracy and convergence of the presented method has been tested against known solutions for a falling sphere as well as by examining fluid flows through stationary particle beds (periodic and cubic packing). To evaluate code performance and validate particle contact physics algorithm, we performed simulations of a representative experiment conducted at the University of California at Berkley for pebble flow through a narrow opening.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order discontinuous Galerkin method with unstructured space–time meshes for two-dimensional compressible flows on domains with large deformations

We introduce a high-order accurate space-time discontinuous Galerkin method for solving two-dimensional compressible flow problems on fully unstructured space-time meshes. The discretization is based on a nodal formulation, with appropriate numerical fluxes for the first and the second-order terms, respectively. The scheme is implicit, and we solve the resulting non-linear systems using a parallel Newton-Krylov solver. The meshes are produced by a mesh moving technique with element connectivity updates, and the corresponding space-time elements are produced directly based on these local operations. To obtain globally conforming tetrahedral meshes, we first derive the required conditions on a prism boundary mesh to allow for a valid local triangulation. Next, we present an efficient algorithm for finding a global mesh that satisfies these conditions. We additionally show how to add and remove mesh nodes, again using local constructs for the space-time mesh. Our approach is demonstrated on a number of test problems, showing the high-order accuracy for model problems, and the ability to solve flow problems on domains with complex large deformations.

97 MATHEMATICS AND COMPUTING↗

An assessment of atypical mesh topologies for low-Mach large-eddy simulation

An implicit, low-dissipation, low-Mach, variable density control volume finite element formulation is used to explore foundational understanding of numerical accuracy for large-eddy simulation applications on hybrid meshes. Detailed simulation comparisons are made between low-order hexahedral, tetrahedral, pyramid, and wedge/prism topologies against a third-order, unstructured hexahedral topology. Using smooth analytical and manufactured low-Mach solutions, design-order convergence is established for the hexahedral, tetrahedral, pyramid, and wedge element topologies using a new open boundary condition based on energy-stable methodologies previously deployed within a finite-difference context. A wide range of simulations demonstrate that low-order hexahedral- and wedge-based element topologies behave nearly identically in both computed numerical errors and overall simulation timings. Moreover, low-order tetrahedral and pyramid element topologies also display nearly the same numerical characteristics. Although the superiority of the hexahedral-based topology is clearly demonstrated for trivial laminar, principally-aligned flows, e.g., a 1x2x10 channel flow with specified pressure drop, this advantage is reduced for non-aligned, turbulent flows including the Taylor–Green Vortex, turbulent plane channel flow ( Re τ 395), and buoyant flow past a heated cylinder. With the order of accuracy demonstrated for both homogenous and hybrid meshes, it is shown that solution verification for the selected complex flows can be established for all topology types. Although the number of elements in a mesh of like spacing comprised of tetrahedral, wedge, or pyramid elements increases as compared to the hexahedral counterpart, for wall-resolved large-eddy simulation, the increased assembly and residual evaluation computational time for non-hexahedral is offset by more efficient linear solver times. Lastly, most simulation results indicate that modest polynomial promotion provides a significant increase in solution accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effect of the numerical discretization scheme in Shock-Driven turbulent mixing simulations

In this work, we evaluate the effects of distinct numerical strategies in simulations of shock-driven turbulent mixing. An air-SF 6 -air gas curtain subjected to Mach 1.2 shock-waves is computed with Implicit Large-Eddy Simulation based on three numerical schemes: directional-split with Harten-Lax-van Leer (HLL) solver; directional-unsplit using HLL-Contact (HLLC) solver; and directional-unsplit with HLLC solver and a Low Mach number Correction (LMC). The results illustrate the importance of the numerical strategy to the accuracy of the predictions. Whereas both split and unsplit schemes result in a similar spatial development of the initial shock-driven instability, only the unsplit schemes can predict the turbulent mixing transition after reshock observed by the laboratory experiments. Such feature increases the mixing rate of the two fluids, this being particularly pronounced when the LMC is active due to i) the reduced flow Mach number, and ii) the larger effective Reynolds number. Since the selected mixing problem is driven by the deposition of vorticity at the fluids’ interface, the resultant flow physics is analyzed by investigating the contribution of distinct inviscid mechanisms to the production of vorticity: baroclinicity, stretching, and dilatation. As expected, it is observed that the production of vorticity is initially dominated by the baroclinicity mechanism. Yet, the relevance of the remainder mechanisms is enhanced after the reshock and may even surpass the baroclinicity term.

42 ENGINEERING↗

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗

On Eliminating Synchronous Communication in Molecular Simulations to Improve Scalability

Molecular dynamics simulation, as a complementary tool to experimentation, has become an important methodology for the understanding and design of molecular systems as it provides access to properties that are difficult, impossible or prohibitively expensive to obtain experimentally. Many of the available software packages have been parallelized to take advantage of modern massively concurrent processing resources. The challenge in achieving parallel efficiency is commonly attributed to the fact that molecular dynamics algorithms are communication intensive. This paper illustrates how an appropriately chosen data distribution and asynchronous one-sided communication approach can be used to effectively deal with the data movement within the Global Arrays/ARMCI programming model framework. A new put_notify capability is presented here, allowing the implementation of the molecular dynamics algorithm without any explicit global or local synchronization or global data reduction operations. In addition, this push-data model is shown to very effectively allow hiding data communication behind computation. Rather than data movement or explicit global reductions, the implicit synchronization of the algorithm becomes the primary challenge for scalability. Without any explicit synchronous operations, the scalability of molecular simulations is shown to depend only on the ability to evenly balance computational load.

Straatsma, TP↗

Scalable Metropolis Monte Carlo for simulation of hard shapes

We design and implement a scalable hard particle Monte Carlo simulation toolkit (HPMC), and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres/disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids/ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel–Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 min on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 h in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 h on 2048 GPUs on OLCF Titan.

Computer Science↗

Aspherical particle models for molecular dynamics simulation

In traditional molecular dynamics (MD) simulations, atoms and coarse-grained particles are modeled as point masses interacting via isotropic potentials. For studies where particle shape plays a vital role, more complex models are required. Here, we describe a spectrum of approaches for modeling aspherical particles, all of which are now available (some recently) as options within the LAMMPS MD package. Broadly these include two classes of models. In the first, individual particles are aspherical, either via a pairwise anisotropic potential which implicitly assigns a simple geometric shape to each particle, or in a more general way where particles store internal state which can explicitly define a complex geometric shape. In the second class of models, individual particles are simple points or spheres, but rigid body constraints are used to create composite aspherical particles in a variety of complex shapes. This work discusses parallel algorithms and associated data structures for both kinds of models, which enable dynamics simulations of aspherical particle systems across a wide range of length and time scales. We also highlight parallel performance and scalability and give a few illustrative examples of aspherical models in different contexts.

74 ATOMIC AND MOLECULAR PHYSICS↗