Search NASA⌕ Search

SEARCH · Search NASA

Results for “linearly 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 325 records · Page 18

Stochastic simulation of reaction-diffusion systems: A fluctuating-hydrodynamics approach

Here, we develop numerical methods for stochastic reaction-diffusion systems based on approaches used for fluctuating hydrodynamics (FHD). For hydrodynamic systems, the FHD formulation is formally described by stochastic partial differential equations (SPDEs). In the reaction-diffusion systems we consider, our model becomes similar to the reaction-diffusion master equation (RDME) description when our SPDEs are spatially discretized and reactions are modeled as a source term having Poisson fluctuations. However, unlike the RDME, which becomes prohibitively expensive for an increasing number of molecules, our FHD-based description naturally extends from the regime where fluctuations are strong, i.e., each mesoscopic cell has few (reactive) molecules, to regimes with moderate or weak fluctuations, and ultimately to the deterministic limit. By treating diffusion implicitly, we avoid the severe restriction on time step size that limits all methods based on explicit treatments of diffusion and construct numerical methods that are more efficient than RDME methods, without compromising accuracy. Guided by an analysis of the accuracy of the distribution of steady-state fluctuations for the linearized reaction-diffusion model, we construct several two-stage (predictor-corrector) schemes, where diffusion is treated using a stochastic Crank-Nicolson method, and reactions are handled by the stochastic simulation algorithm of Gillespie or a weakly second-order tau leaping method. We find that an implicit midpoint tau leaping scheme attains second-order weak accuracy in the linearized setting and gives an accurate and stable structure factor for a time step size of an order of magnitude larger than the hopping time scale of diffusing molecules. We study the numerical accuracy of our methods for the Schlögl reaction-diffusion model both in and out of thermodynamic equilibrium. We demonstrate and quantify the importance of thermodynamic fluctuations to the formation of a two-dimensional Turing-like pattern and examine the effect of fluctuations on three-dimensional chemical front propagation. Furthermore, by comparing stochastic simulations to deterministic reaction-diffusion simulations, we show that fluctuations accelerate pattern formation in spatially homogeneous systems and lead to a qualitatively different disordered pattern behind a traveling wave.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Discussion of “Bayesian design of experiments for industrial and scientific applications via gaussian processes”

First, we would like to commend Dr. Woods on his thought-provoking paper and insightful presentation at the 4th Annual Stu Hunter conference. We think that the material presented highlights some important needs in the area of design of experiments for generalized linear models (GLMs). In addition, we agree with Dr. Woods that design of experiements of GLMs does implicitly require expert judgement about model parameters, and hence using a Bayesian approach to capture this knowledge is a natural strategy to summarize what is known with the opportunity to incorporate associated uncertainty about that information.

97 MATHEMATICS AND COMPUTING↗

High-Order Preconditioners for Modern Computing Architectures: Line-Based Discontinuous Galerkin Method on GPUs

The goals of our project are to be able to overcome issues that plague computing in modern architecture such as limited memory bandwidth, badly conditioned Jacobians, and restrictive time steps. We begin by describing the line-based discontinuous Galerkin (line DG) method for a scalar two-dimensional problem. Line DG has been shown to provide a significant increase in sparsity for Jacobian matrix, especially in the diagonal block elements. In addition to this, the implicit time integration scheme helps alleviate the time step restriction but requires solving a (potentially badly conditioned) linear system. We can precondition the linear system to facilitate the solution. Since we want to solve the system on the GPU, the increase in sparsity from the line DG method is helpful to alleviate the memory issue. We successfully implemented a computation of the Jacobian on the CPU and are currently working on the GPU implementation. Finally, I discuss how this opportunity to intern at Lawrence Livermore National Laboratory through the National Science Foundation Mathematical Sciences Graduate Internship has affected my personal and professional growth.

97 MATHEMATICS AND COMPUTING↗

Numerical modeling of D-mappings with applications to chemical kinetics

Numerical modeling of D-mappings was studied and applied to solving nonlinear stiff systems. These mappings were locally linearized for convergence analysis, and some applications were made to chemical kinetics. The technique avoids using multistep implicit codes that require inversion of Jacobian matrices, but depends on the Jacobians for its convergence analysis.

Dey, S. K.↗

Turbine blade-tip clearance excitation forces

The results of an effort to assess the existing knowledge and plan the required experimentation in the area of turbine blade tip excitation forces is summarized. The work was carried out in three phases. The first was a literature search and evaluation, which served to highlight the state of the art and to expose the need for an articulated theoretical experimental effort to provide not only design data, but also a rational framework for their extrapolation to new configurations and regimes. The second phase was a start in this direction, in which several of the explicit or implicit assumptions contained in the usual formulations of the Alford force effect were removed and a rigorous linearized flow analysis of the behavior of a nonsymmetric actuator disc was carried out. In the third phase a preliminary design of a turbine test facility that would be used to measure both the excitation forces themselves and the flow patterns responsible for them were conducted and do so over a realistic range of dimensionless parameters.

Martinez-Sanchez, M.↗

Preconditioned conjugate-gradient methods for low-speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗

Preconditioned Conjugate Gradient methods for low speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations are integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and the convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the lower-upper (L-U)-successive symmetric over-relaxation iterative scheme is more efficient than a preconditioner based on incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional line Gauss-Seidel relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗

Numerical simulation of polar lows and comma clouds using simple dry models

Linear and nonlinear numerical channel models are used to simulate polar low/comma cloud evolution. The basic state of the model is idealized and can be specified analytically. It has strong horizontal as well as vertical wind shear and implicitly includes the effect of sensible heat fluxes from the lower boundary. This is done by having a layer of reduced stability present in the lower troposphere. The results of the linear model study are presented and used to provide input for the nonlinear model integration. It is shown that, given sufficient horizontal resolution, many features of polar low/comma clouds can be simulated by the nonlinear primitive equations model and the idealized basic state, in particular a rapidly growing disturbance with a wavelength on the order of 1000 km.

Mudrick, Stephen E.↗

A Fully Second Order Implicit/Explicit Time Integration Technique for Hydrodynamics Plus Nonlinear Heat Conduction Problems

We present a second order non-linearly consistent implicit/explicit time integration tech¬nique for solving hydrodynamics coupled with nonlinear heat conduction problems. The idea is to hybridize an implicit and an explicit discretization in a nonlinearly consistent way in order to achieve second order time convergent calculations. In this scope, the hydrody¬namics equations are discretized explicitly making use of the capability of well-understood explicit schemes. On the other hand , the nonlinear heat conduction is solved implicitly. Such methods are often referred to as IMEX methods [2,1,3]. The Jacobian-Free Newton Krylov (JFNK) method (e.g, [10,9]) is applied to the problem in such a way as to render a nonlinearly iterated IMEX method. We solve three test problems in order to validate the nu-merical order of the scheme. For each test, we established second order time convergence. We support these numerical results with a Modi?ed Equation Analysis (MEA) [23,22]. The set of equations studied here constitute a base model for radiation hydrodynamics.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Tau leaping of stiff stochastic chemical systems via local central limit approximation

Stiffness manifests in stochastic dynamic systems in a more complex manner than in deterministic systems; it is not only important for a time-stepping method to remain stable but it is also important for the method to capture the asymptotic variances accurately. In the context of stochastic chemical systems, time stepping methods are known as tau leaping. Well known existing tau leaping methods have shortcomings in this regard. The implicit tau method is far more stable than the trapezoidal tau method but underestimates the asymptotic variance. On the other hand, the trapezoidal tau method which estimates the asymptotic variance exactly for linear systems suffers from the fact that the transients of the method do not decay fast enough in the context of very stiff systems. We propose a tau leaping method that possesses the same stability properties as the implicit method while it also captures the asymptotic variance with reasonable accuracy at least for the test system S{sub 1}↔S{sub 2}. The proposed method uses a central limit approximation (CLA) locally over the tau leaping interval and is referred to as the LCLA-τ. The CLA predicts the mean and covariance as solutions of certain differential equations (ODEs) and for efficiency we solve these using a single time step of a suitable low order method. We perform a mean/covariance stability analysis of various possible low order schemes to determine the best scheme. Numerical experiments presented show that LCLA-τ performs favorably for stiff systems and that the LCLA-τ is also able to capture bimodal distributions unlike the CLA itself. The proposed LCLA-τ method uses a split implicit step to compute the mean update. We also prove that any tau leaping method employing a split implicit step converges in the fluid limit to the implicit Euler method as applied to the fluid limit differential equation.

97 MATHEMATICS AND COMPUTING↗

Filtering of non-linear instabilities

For Courant numbers larger than one and cell Reynolds numbers larger than two, oscillations and in some cases instabilities are typically found with implicit numerical solutions of the fluid dynamics equations. This behavior has sometimes been associated with the loss of diagonal dominance of the coefficient matrix. It is shown that these problems can be related to the choice of the spatial differences, with the resulting instability related to aliasing or nonlinear interaction. Appropriate filtering can reduce the intensity of these oscillations and possibly eliminate the instability. These filtering procedures are equivalent to a weighted average of conservation and nonconservation differencing. The entire spectrum of filtered equations retains a three point character as well as second order spatial accuracy. Burgers equation was considered as a model.

Khosla, P. K.↗

Filtering of non-linear instabilities

For Courant numbers larger than one and cell Reynolds numbers larger than two, oscillations and in some cases instabilities are typically found with implicit numerical solutions of the fluid dynamics equations. This behavior has sometimes been associated with the loss of diagonal dominance of the coefficient matrix. It is shown here that these problems can in fact be related to the choice of the spatial differences, with the resulting instability related to aliasing or nonlinear interaction. Appropriate 'filtering' can reduce the intensity of these oscillations and in some cases possibly eliminate the instability. These filtering procedures are equivalent to a weighted average of conservation and non-conservation differencing. The entire spectrum of filtered equations retains a three-point character as well as second-order spatial accuracy. Burgers equation has been considered as a model. Several filters are examined in detail, and smooth solutions have been obtained for extremely large cell Reynolds numbers.

Khosla, P. K.↗

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

Koppenhoefer, Kyle C.↗

A fully implicit scheme for the barotropic primitive equations

An efficient implicit finite-difference method is developed and tested for a global barotropic model. The scheme requires, at each time step, the solution of only one-dimensional block-tridiagonal linear systems. This additional computation is offset by the use of a time step chosen independently of the mesh spacing. The method is second-order accurate in time and fourth-order accurate in space. Present experience indicates that this implicit method is practical for numerical simulation on fine meshes.

Cohn, S. E.↗

A conservative implicit-PIC scheme for the hybrid kinetic-ion fluid-electron plasma model on curvilinear meshes

We report that the hybrid kinetic-ion fluid-electron plasma model is widely used to study challenging multi-scale problems in space and laboratory plasma physics. Here, a novel conservative scheme for this model employing implicit particle-in-cell techniques is extended to arbitrary coordinate systems via curvilinear maps from logical to physical space. The scheme features a fully non-linear electromagnetic formulation with a multi-rate time advance - including sub-cycling and orbit-averaging for the kinetic ions. By careful choice of compatible particle-based kinetic-ion and mesh-based fluid-electron discretizations in curvilinear coordinates, as well as particle-mesh interpolations and implicit midpoint time advance, the scheme is proven to conserve total energy for arbitrary curvilinear meshes. In the electrostatic limit, the method is also proven to conserve total momentum for arbitrary curvilinear meshes. Although momentum is not conserved for arbitrary curvilinear meshes in the electromagnetic case, it is for an important subset of Cartesian tensor-packed meshes. The scheme and its novel conservation properties are demonstrated for several challenging numerical problems using different curvilinear meshes, including a merging flux-rope simulation for a space weather application, and a helical m = 1 mode simulation for magnetic fusion energy application.

97 MATHEMATICS AND COMPUTING↗

On differential singular perturbation problems: a simple variational approach

An alternative approach for the analysis and the numerical approximation of singular perturbation problems, using a variational framework, is presented. It is based on the natural idea of minimizing the residual of the differential equation measured in the L{sup 2} norm. By this strategy, the approximation is based in the solution of a set of linear problems giving the descent step directions of the problem. This is the main advantage of our approach, since we can use stable and convergent methods for linear problems (without assuming the knowledge of good initial guesses used in the approximation of the associated non-linear systems necessary in Newton-type methods). Remember that for this type of problems, we should use implicit methods. We prove that our procedure can never get stuck in local minima, and the error decreases until getting to the original solution independent of the perturbation parameter. Finally, we include some numerical examples.

97 MATHEMATICS AND COMPUTING↗

Variational, stable, and self-consistent coupling of 3D electromagnetics to 1D transmission lines in the time domain

This work presents a new multiscale method for coupling the 3D Maxwell's equations to the 1D telegrapher's equations. While Maxwell's equations are appropriate for modeling complex electromagnetics in arbitrary-geometry domains, simulation cost for many applications (e.g. pulsed power) can be dramatically reduced by representing less complex transmission line regions of the domain with a 1D model. By assuming a transverse electromagnetic (TEM) ansatz for the solution in a transmission line region, we reduce the Maxwell's equations to the telegrapher's equations. Here, we propose a self-consistent finite element formulation of the fully coupled system that uses boundary integrals to couple between the 3D and 1D domains and supports arbitrary unstructured 3D meshes. Additionally, by using a Lagrange multiplier to enforce continuity at the coupling interface, we allow for an absorbing boundary condition to also be applied to non-TEM modes on this boundary. We demonstrate that this feature reduces non-physical reflection and ringing of non-TEM modes off of the coupling boundary. By employing implicit time integration, we ensure a stable coupling, and we introduce an efficient method for solving the resulting linear systems. We demonstrate the accuracy of the new method on two verification problems, a transient O-wave in a rectilinear prism and a steady-state problem in a coaxial geometry, and show the efficiency and weak scalability of our implementation on a cold test of the Z-machine MITL and post-hole convolute.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dark Energy Survey Year 3 results: Simulation-based 𝑤CDM inference from weak lensing and galaxy clustering maps with deep learning: Analysis design

Data-driven approaches using deep learning are emerging as powerful techniques to extract non-Gaussian information from cosmological large-scale structure. Here, this work presents the first simulation-based inference (SBI) pipeline that combines weak lensing and galaxy clustering maps in a realistic Dark Energy Survey Year 3 (DES Y3) configuration and serves as preparation for a forthcoming analysis of the survey data. We develop a scalable forward model based on the CosmoGridV1 suite of N-body simulations to generate over one million self-consistent mock realizations of DES Y3 at the map level. Leveraging this large dataset, we train deep graph convolutional neural networks on the full survey footprint in spherical geometry to learn low-dimensional features that approximately maximize mutual information with target parameters. These learned compressions enable neural density estimation of the implicit likelihood via normalizing flows in a ten-dimensional parameter space spanning cosmological 𝑤CDM, intrinsic alignment, and linear galaxy bias parameters, while marginalizing over baryonic, photometric redshift, and shear bias nuisances. To ensure robustness, we extensively validate our inference pipeline using synthetic observations derived from both systematic contaminations in our forward model and independent Buzzard galaxy catalogs. Our forecasts yield significant improvements in cosmological parameter constraints, achieving 2−3× higher figures of merit in the 𝛺 𝑚 − 𝑆 8 plane relative to our implementation of baseline two-point statistics and effectively breaking parameter degeneracies through probe combination. These results demonstrate the potential of SBI analyses powered by deep learning for upcoming Stage-IV wide-field imaging surveys.

Thomsen, A. [Zurich, ETH] (ORCID:0000000203099021)↗