Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit method”

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 703 records · Page 39

PROTEUS-MOC User Manual

The PROTEUS-MOC code is a three-dimensional (3D) neutron transport code based on the finite element mesh and the method of characteristics (MOC) which combines a 2D MOC with the discontinuous Galerkin finite element method for the axial direction. Thus, for PROTEUS-MOC, a 3D geometry is represented with by the implicit extrusion of a single 2D planar geometry with different material assignments allowable on each plane. The code requires four input files for a steady-state calculation without the thermal feedback: a driver input, a mesh input, a cross section input, and a material assignment input. With thermal feedback, a T/H input file is needed. For kinetics, a kinetics driver input file is required. The PROTEUS-MOC software produces a text output file as well as a data file which includes integral and average quantities such on fluxes, powers, temperatures, densities, etc. The detailed output file can be converted to the VTK format using the post processing code so that the outputs can be visualized using a visualization software such as VisIt.

97 MATHEMATICS AND COMPUTING↗

Addressing key physics problems in high-energy-density plasmas with a novel kinetic simulation capability

Many important physical processes in inertial confinement fusion (ICF) and dense Z-pinch (DZP) experiments require a kinetic (velocity-space-dependent) description. Conventional particle-in-cell (PIC) methods are poorly suited for high-energy-density (HED) plasmas, due to restrictive time-step constraints and the inability to conserve energy. In a previous LDRD (21-FS-048), we demonstrated that a fully implicit PIC formulation overcomes these limitations: it conserves energy even when coupled with Coulomb collision models and can be solved efficiently with large grid cells and large time steps. Thus, it is feasible to use this method to study kinetic effects in ICF and DZP plasmas on hydro-like time and spatial scales. In this follow-on LDRD, we advanced this methodology into a high-fidelity tool for production-scale simulations and used it to answer key questions relevant to ICF and DZP experiment.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum Orbital Minimization Method for Excited States Calculation on a Quantum Computer

Herein we propose a quantum-classical hybrid variational algorithm, the quantum orbital minimization method (qOMM), for obtaining the ground state and low-lying excited states of a Hermitian operator. Given parametrized ansatz circuits representing eigenstates, qOMM implements quantum circuits to represent the objective function in the orbital minimization method and adopts a classical optimizer to minimize the objective function with respect to the parameters in ansatz circuits. The objective function has an orthogonality constraint implicitly embedded, which allows qOMM to apply a different ansatz circuit to each input reference state. We carry out numerical simulations that seek to find excited states of H 2 , LiH, and a toy model consisting of four hydrogen atoms arranged in a square lattice in the STO-3G basis with UCCSD ansatz circuits. Comparing the numerical results with existing excited states methods, qOMM is less prone to getting stuck in local minima and can achieve convergence with more shallow ansatz circuits.

97 MATHEMATICS AND COMPUTING↗

Orbital Conflict: Cutting Planes for Symmetric Integer Programs

Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. Furthermore, the inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.

97 MATHEMATICS AND COMPUTING↗

Modeling electrokinetic flows by consistent implicit incompressible smoothed particle hydrodynamics

We present an efficient implicit incompressible smoothed particle hydrodynamics (I2SPH) discretization of Navier-Stokes, Poisson-Boltzmann, and advection-diffusion equations subject to Dirichlet or Robin boundary conditions. It is applied to model various two and three dimensional electrokinetic flows in simple or complex geometries. The I2SPH's accuracy and convergence are examined via comparison with analytical solutions, grid-based numerical solutions, or empirical models. The new method provides a framework to explore broader applications of SPH in microfluidics and complex fluids with charged objects, such as colloids and biomolecules, in arbitrary complex geometries.

Pan, Wenxiao↗

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗

A high-order numerical algorithm for DNS of low-Mach-number reactive flows with detailed chemistry and quasi-spectral accuracy

A novel and efficient algorithm is presented in this paper to deal with DNS of turbulent reacting flows under the low-Mach-number assumption, with detailed chemistry and a quasi-spectral accuracy. The temporal integration of the equations relies on an operating-split strategy, where chemical reactions are solved implicitly with a stiff solver and the convection-diffusion operators are solved with a Runge-Kutta-Chebyshev method. The spatial discretisation is performed with high-order compact schemes, and a FFT based constant-coefficient spectral solver is employed to solve a variable-coefficient Poisson equation. The numerical implementation takes advantage of the 2DECOMP&FFT libraries developed by, which are based on a pencil decomposition method of the domain and are proven to be computationally very efficient. An enhanced pressure-correction method is proposed to speed up the achievement of machine precision accuracy. It is demonstrated that a second-order accuracy is reached in time, while the spatial accuracy ranges from fourth-order to sixth-order depending on the set of imposed boundary conditions. In conclusion, the software developed to implement the present algorithm is called HOLOMAC, and its numerical efficiency opens the way to deal with DNS of reacting flows to understand complex turbulent and chemical phenomena in flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Formulation of 8-moment plasma transport with application to the Nernst effect

8-moment plasma models using two different distribution functions are used to study the Nernst effect and heat transport in dense plasma. These models are presented in hyperbolic form in contrast to traditional parabolic systems derived from perturbing the distribution function, as in Braginskii [Rev. Plasma Phys. 1, 205 (1965)]. The hyperbolic moment formulation can be solved implicitly in time with straightforward and fast local solvers. The numerical implementation of 8-moment models with the relaxation method in the PERSEUS code is also presented. To test 8-moment PERSEUS compared to Braginskii’s transport equations, a verification test for the Nernst thermomagnetic wave by Velikovich et al. [Phys. Plasmas 26, 112702 (2019)] is performed that confirms the presence of the same physics, but with slight differences in the transport coefficients, which are tabulated in the limits of high and low magnetization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An integrated model-driven method for in-treatment upper airway motion tracking using cine MRI in head and neck radiation therapy

Purpose: For the first time, MRI-guided radiation therapy systems can acquire cine images to dynamically monitor in-treatment internal organ motion. However, the complex head and neck (H&N) structures and low-contrast/resolution of on-board cine MRI images make automatic motion tracking a very challenging task. In this study, the authors proposed an integrated model-driven method to automatically track the in-treatment motion of the H&N upper airway, a complex and highly deformable region wherein internal motion often occurs in an either voluntary or involuntary manner, from cine MRI images for the analysis of H&N motion patterns. Methods: Considering the complex H&N structures and ensuring automatic and robust upper airway motion tracking, the authors firstly built a set of linked statistical shapes (including face, face-jaw, and face-jaw-palate) using principal component analysis from clinically approved contours delineated on a set of training data. The linked statistical shapes integrate explicit landmarks and implicit shape representation. Then, a hierarchical model-fitting algorithm was developed to align the linked shapes on the first image frame of a to-be-tracked cine sequence and to localize the upper airway region. Finally, a multifeature level set contour propagation scheme was performed to identify the upper airway shape change, frame-by-frame, on the entire image sequence. The multifeature fitting energy, including the information of intensity variations, edge saliency, curve geometry, and temporal shape continuity, was minimized to capture the details of moving airway boundaries. Sagittal cine MR image sequences acquired from three H&N cancer patients were utilized to demonstrate the performance of the proposed motion tracking method. Results: The tracking accuracy was validated by comparing the results to the average of two manual delineations in 50 randomly selected cine image frames from each patient. The resulting average dice similarity coefficient (93.28% ± 1.46%) and margin error (0.49 ± 0.12 mm) showed good agreement between the automatic and manual results. The comparison with three other deformable model-based segmentation methods illustrated the superior shape tracking performance of the proposed method. Large interpatient variations of swallowing frequency, swallowing duration, and upper airway cross-sectional area were observed from the testing cine image sequences. Conclusions: The proposed motion tracking method can provide accurate upper airway motion tracking results, and enable automatic and quantitative identification and analysis of in-treatment H&N upper airway motion. By integrating explicit and implicit linked-shape representations within a hierarchical model-fitting process, the proposed tracking method can process complex H&N structures and low-contrast/resolution cine MRI images. Future research will focus on the improvement of method reliability, patient motion pattern analysis for providing more information on patient-specific prediction of structure displacements, and motion effects on dosimetry for better H&N motion management in radiation therapy.

60 APPLIED LIFE SCIENCES↗

Robust and accurate filtered spherical harmonics expansions for radiative transfer

We present a novel application of filters to the spherical harmonics (P{sub N}) expansion for radiative transfer problems in the high-energy-density regime. The filter we use is based on non-oscillatory spherical splines and a filter strength chosen to (i) preserve the equilibrium diffusion limit and (ii) vanish as the expansion order tends to infinity. Our implementation is based on modified equations that are derived by applying the filter after every time step in a simple first-order time integration scheme. The method is readily applied to existing codes that solve the P{sub N} equations. Numerical results demonstrate that the solution to the filtered P{sub N} equations are (i) more robust and less oscillatory than standard P{sub N} solutions and (ii) more accurate than discrete ordinates solutions of comparable order. In particular, the filtered P{sub 7} solution demonstrates comparable accuracy to an implicit Monte Carlo solution for a benchmark hohlraum problem in 2D Cartesian geometry.

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↗

On the Implementation of 3D Galerkin Boundary Integral Equations

In this article, a reverse contribution technique is proposed to accelerate the construction of the dense influence matrices associated with a Galerkin approximation of singular and hypersingular boundary integral equations of mixed-type in potential theory. In addition, a general-purpose sparse preconditioner for boundary element methods has also been developed to successfully deal with ill-conditioned linear systems arising from the discretization of mixed boundary-value problems on non-smooth surfaces. The proposed preconditioner, which originates from the precorrected-FFT method, is sparse, easy to generate and apply in a Krylov subspace iterative solution of discretized boundary integral equations. Moreover, an approximate inverse of the preconditioner is implicitly built by employing an incomplete LU factorization. Numerical experiments involving mixed boundary-value problems for the Laplace equation are included to illustrate the performance and validity of the proposed techniques.

97 MATHEMATICS AND COMPUTING↗

Normality of Monte Carlo criticality eigenfunction decomposition coefficients

A proof is presented, which shows that after a single Monte Carlo (MC) neutron transport power method iteration without normalization, the coefficients of an eigenfunction decomposition of the fission source density are normally distributed when using analog or implicit capture MC. Using a Pearson correlation coefficient test, the proof is corroborated by results from a uniform slab reactor problem, and those results also suggest that the coefficients are normally distributed with normalization. The proof and numerical test results support the application of earlier work on the convergence of eigenfunctions under stochastic operators. Knowledge of the Gaussian shape of decomposition coefficients allows researchers to determine an appropriate level of confidence in the distribution of fission sites taken from a MC simulation. This knowledge of the shape of the probability distributions of decomposition coefficients encourages the creation of new predictive convergence diagnostics. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The halo light-cone catalogues of ABACUSSUMMIT

We describe a method for generating halo catalogues on the light-cone using the AbacusSummit suite of N-body simulations. The main application of these catalogues is the construction of realistic mock galaxy catalogues and weak lensing maps on the sky. Our algorithm associates the haloes from a set of coarsely spaced snapshots with their positions at the time of light-cone crossing by matching halo particles to on-the-fly light-cone particles. It then records the halo and particle information into an easily accessible product, which we call the AbacusSummit halo light-cone catalogues. Our recommended use of this product is in the halo mass regime of M halo > 2.1 x 10 11 M ⊙ h -1 for the base resolution simulations, i.e. haloes containing at least 100 particles, where the interpolated halo properties are most reliable. To test the validity of the obtained catalogues, we perform various visual inspections and consistency checks. In particular, we construct galaxy mock catalogues of emission-line galaxies (ELGs) at z ~ 1 by adopting a modified version of the AbacusHOD script, which builds on the standard halo occupation distribution (HOD) method by including various extensions. We find that the multipoles of the autocorrelation function are consistent with the predictions from the full-box snapshot, implicitly validating our algorithm. In addition, we compute and output CMB convergence maps and find that the auto- and cross-power spectrum agrees with the theoretical prediction at the sub-per-cent level.

79 ASTRONOMY AND ASTROPHYSICS↗

A Characteristic-Based Spectral Element Method for Moving-Domain Problems

Here, we introduce a characteristic-based numerical procedure for simulating incompressible flows in domains with moving boundaries. Our approach utilizes an operator-integration-factor splitting technique to help produce an efficient and stable numerical scheme. Using the spectral element method and an arbitrary Lagrangian-Eulerian formulation, we explore flows where the convective acceleration effects are non-negligible. Several examples, ranging from laminar to turbulent flows, are considered. Comparisons with a standard, semi-implicit time-stepping procedure illustrate the improved performance of our scheme.

97 MATHEMATICS AND COMPUTING↗

A machine learning approach to predict metabolic pathway dynamics from time-series multiomics data

New synthetic biology capabilities hold the promise of dramatically improving our ability to engineer biological systems. However, a fundamental hurdle in realizing this potential is our inability to accurately predict biological behavior after modifying the corresponding genotype. Kinetic models have traditionally been used to predict pathway dynamics in bioengineered systems, but they take significant time to develop, and rely heavily on domain expertise. Here, we show that the combination of machine learning and abundant multiomics data (proteomics and metabolomics) can be used to effectively predict pathway dynamics in an automated fashion. The new method outperforms a classical kinetic model, and produces qualitative and quantitative predictions that can be used to productively guide bioengineering efforts. This method systematically leverages arbitrary amounts of new data to improve predictions, and does not assume any particular interactions, but rather implicitly chooses the most predictive ones.

59 BASIC BIOLOGICAL SCIENCES↗

Large eddy simulation of atmospheric boundary layer flow over complex terrain in comparison with RANS simulation and on-site measurements under neutral stability condition

Large eddy simulation (LES) of the atmospheric boundary layer (ABL) flow over complex terrain is presented with a validation using meteorological tower (met-tower) data through an improved neutral stability sampling approach. The proposed stability sampling procedure includes a condition based on the most-likely occurrence time-periods of the neutral ABL and reduces the variabilities of the conditional wind statistics calculated at the met-towers in comparison to our previous work. The ABL flow simulations are carried out over a potential wind site with a prominent hill based using the OpenFOAM-based simulator for on/off-shore wind farm applications by applying the Lagrangian-averaged scale-invariant dynamic sub-grid scale turbulence model. A low-dissipative scale-selective discretization scheme for the non-linear convection term in the LES governing equation is adopted implicitly to ensure both the second-order accuracy and bounded solution. The LES inflow is generated through a precursor method with a “tiling” approach based on the flow driving parameters obtained from a corresponding Reynolds-averaged Navier–Stokes (RANS) simulation. Overall, the averaged wind velocity profiles predicted by the LES approach at all met-tower locations show a similar tendency as the RANS results, which are also in reasonable agreement with the met-tower data. An obvious difference in wind speed standard deviation profiles is seen between LES and RANS, especially at regions downstream of the hill edge, where the LES shows under-predicted results at the highest measurement levels in comparison to the tower data. The computational costs of the LES are found to be about 20 times higher than the RANS simulations.

Energy & Fuels↗

Kinetic Learning vo.1

New synthetic biology capabilities hold the promise of dramatically improving our ability to engineer biological systems. However, a fundamental hurdle in realizing this potential is our inability to accurately predict biological behavior after modifying the corresponding genotype. Kinetic models have traditionally been used to predict pathway dynamics in bioengineered systems, but they take significant time to develop, and rely heavily on domain expertise. This software implements a method to effectively predict pathway dynamics in an automated fashion using a combination of machine learning and abundant multiomics data (proteomics and metabolomics). The new method outperforms a classical kinetic model, and produces qualitative and quantitative predictions that can be used to productively guide bioengineering efforts. This method systematically leverages arbitrary amounts of new data to improve predictions, and does not assume any particular interactions, but rather implicitly chooses the most predictive ones.

Martin, HectorGarcia↗