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 487 records · Page 27

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↗

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↗

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↗

Generalized, Energy-conserving Numerical Simulations of Particles in General Relativity. II. Test Particles in Electromagnetic Fields and GRMHD

Observations of compact objects, in the form of radiation spectra, gravitational waves by LIGO/Virgo, and direct imaging with the Event Horizon Telescope, are currently the main information sources on plasma physics in extreme gravity. Modeling such physical phenomena Requires numerical methods that allow for the simulation of microscopic plasma dynamics in the presence of both strong gravity and electromagnetic fields. In Bacchini et al. (2018), we presented a detailed study of numerical techniques for the integration of free geodesic motion. In this paper, we extend the study by introducing electromagnetic forces in the simulation of charged particles in curved spacetimes. We extend the Hamiltonian energy-conserving method presented in Bacchini et al. to include the Lorentz force, and we test its performance compared to that of standard explicit Runge–Kutta and implicit midpoint rule schemes against analytic solutions. Then, we show the application of the numerical schemes to the integration of test particle trajectories in general relativistic magnetohydrodynamic (GRMHD) simulations by modifying the algorithms to handle grid-based electromagnetic fields. We test this approach by simulating ensembles of charged particles in a static GRMHD configuration obtained with the black hole accretion code (BHAC).

79 ASTRONOMY AND ASTROPHYSICS↗

High-order fully implicit solver for all-speed fluid dynamics: AUSM ride from nearly incompressible variable-density flows to shock dynamics

We introduce a novel Newton–Krylov (NK)-based fully implicit algorithm for solving fluid flows in a wide range of flow conditions—from variable density nearly incompressible to supersonic shock dynamics. The key enabling feature of our all-speed solver is the ability to efficiently solve conservation laws by choosing a set of independent variables that produce a well-conditioned Jacobian matrix for the linear iterations of the global nonlinear iterative solver. In particular, instead of choosing to discretize the conservative variables (density, momentum, total energy), which is traditionally used in Eulerian high-speed compressible fluid dynamics, we demonstrate superior performance by discretizing the primitive variables—pressure–velocity–temperature in the very low-Mach flow limits or density–velocity–temperature/entropy in the shock dynamics range. Moreover, our method allows us to avoid direct inversion of the mass matrix in discrete time derivatives, which is usually an additional source for stiffness, especially pronounced when going to very high-order schemes with non-orthogonal basis functions. Here, we show robust solutions obtained for discontinuous finite element discretization up to seventh-order accuracy. Another important aspect of the solution algorithm is the Advection Upstream Splitting Method (AUSM), adopted to compute numerical fluxes within our reconstructed discontinuous Galerkin (rDG) spatial discretization scheme. The use of the low-Mach modification of the hyperbolic flux operator is found to be necessary for enabling robust simulations of very stiff liquids and metals for Mach numbers below M=10 -5 , which is well known to be very computationally challenging for compressible solvers. We demonstrate that our fully implicit rDG-NK solver with the AUSM + -up flux treatment produces efficient and high-resolution numerical solutions at all speeds, ranging from vanishing Mach numbers to transonic and supersonic, without substantial modifications of the solution procedures. (At high speed, we add limiting and use a simpler preconditioning of the Krylov solver.) Numerical examples include nearly incompressible constant-property flow past a backward-facing step with heat transfer, low-Mach variable-property channel flow of water at supercritical state, phase change and melt pool dynamics for laser spot welding and selective laser melting in additive manufacturing, and Mach 3 flow in a wind tunnel with a step.

97 MATHEMATICS AND COMPUTING↗

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↗

Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior

Electric vehicles are a sustainable substitution to conventional vehicles. This work introduces an integrated framework for urban fast charging infrastructure to address the range anxiety issue. A mesoscopic simulation tool is developed to generate trip trajectories, and simulate charging behavior based on various trip attributes. The resulting charging demand is the key input to a mixed-integer nonlinear program that seeks charging station configuration. The model minimizes the total system cost including charging station and charger installation costs, and charging, queuing, and detouring delays. The problem is solved using a decomposition technique incorporating a commercial solver for small networks, and a heuristic algorithm for large-scale networks, in addition to the Golden Section method. The solution quality and significant superiority in the computational efficiency of the decomposition approach are confirmed in comparison with the implicit enumeration approach. Furthermore, the required infrastructure to support urban trips is explored for future market shares and technologies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Scalable Preconditioners for Structure Preserving Discretizations of Maxwell Equations in First Order Form

Here, we report multiple physical time-scales can arise in electromagnetic simulations when dissipative effects are introduced through boundary conditions, when currents follow external time-scales, and when material parameters vary spatially. In such scenarios, the time-scales of interest may be much slower than the fastest time-scales supported by the Maxwell equations, therefore making implicit time integration an efficient approach. The use of implicit temporal discretizations results in linear systems in which fast time-scales, which severely constrain the stability of an explicit method, can manifest as so-called stiff modes. This study proposes a new block preconditioner for structure preserving (also termed physics compatible) discretizations of the Maxwell equations in first order form. The intent of the preconditioner is to enable the efficient solution of multiple-time-scale Maxwell type systems. An additional benefit of the developed preconditioner is that it requires only a traditional multigrid method for its subsolves and compares well against alternative approaches that rely on specialized edge-based multigrid routines that may not be readily available. Lastly, results demonstrate parallel scalability at large electromagnetic wave CFL numbers on a variety of test problems.

97 MATHEMATICS AND COMPUTING↗

Image-based reconstruction of three-dimensional myocardial infarct geometry for patient-specific modeling of cardiac electrophysiology

Purpose: Accurate three-dimensional (3D) reconstruction of myocardial infarct geometry is crucial to patient-specific modeling of the heart aimed at providing therapeutic guidance in ischemic cardiomyopathy. However, myocardial infarct imaging is clinically performed using two-dimensional (2D) late-gadolinium enhanced cardiac magnetic resonance (LGE-CMR) techniques, and a method to build accurate 3D infarct reconstructions from the 2D LGE-CMR images has been lacking. The purpose of this study was to address this need. Methods: The authors developed a novel methodology to reconstruct 3D infarct geometry from segmented low-resolution (Lo-res) clinical LGE-CMR images. Their methodology employed the so-called logarithm of odds (LogOdds) function to implicitly represent the shape of the infarct in segmented image slices as LogOdds maps. These 2D maps were then interpolated into a 3D image, and the result transformed via the inverse of LogOdds to a binary image representing the 3D infarct geometry. To assess the efficacy of this method, the authors utilized 39 high-resolution (Hi-res) LGE-CMR images, including 36 in vivo acquisitions of human subjects with prior myocardial infarction and 3 ex vivo scans of canine hearts following coronary ligation to induce infarction. The infarct was manually segmented by trained experts in each slice of the Hi-res images, and the segmented data were downsampled to typical clinical resolution. The proposed method was then used to reconstruct 3D infarct geometry from the downsampled images, and the resulting reconstructions were compared with the manually segmented data. The method was extensively evaluated using metrics based on geometry as well as results of electrophysiological simulations of cardiac sinus rhythm and ventricular tachycardia in individual hearts. Several alternative reconstruction techniques were also implemented and compared with the proposed method. Results: The accuracy of the LogOdds method in reconstructing 3D infarct geometry, as measured by the Dice similarity coefficient, was 82.10% ± 6.58%, a significantly higher value than those of the alternative reconstruction methods. Among outcomes of electrophysiological simulations with infarct reconstructions generated by various methods, the simulation results corresponding to the LogOdds method showed the smallest deviation from those corresponding to the manual reconstructions, as measured by metrics based on both activation maps and pseudo-ECGs. Conclusions: The authors have developed a novel method for reconstructing 3D infarct geometry from segmented slices of Lo-res clinical 2D LGE-CMR images. This method outperformed alternative approaches in reproducing expert manual 3D reconstructions and in electrophysiological simulations.

60 APPLIED LIFE SCIENCES↗