Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 19 records

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integration methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.

97 MATHEMATICS AND COMPUTING↗

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

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

HPC↗

A Monte Carlo synthetic-acceleration method for solving the thermal radiation diffusion equation

We present a novel synthetic-acceleration-based Monte Carlo method for solving the equilibrium thermal radiation diffusion equation in three spatial dimensions. The algorithm performance is compared against traditional solution techniques using a Marshak benchmark problem and a more complex multiple material problem. Our results show that our Monte Carlo method is an effective solver for sparse matrix systems. For solutions converged to the same tolerance, it performs competitively with deterministic methods including preconditioned conjugate gradient and GMRES. We also discuss various aspects of preconditioning the method and its general applicability to broader classes of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reactor Decay Heat in {sup 239}Pu: Solving the {gamma} Discrepancy in the 4-3000-s Cooling Period

The {beta} feeding probability of {sup 102,104,105,106,107}Tc, {sup 105}Mo, and {sup 101}Nb nuclei, which are important contributors to the decay heat in nuclear reactors, has been measured using the total absorption technique. We have coupled for the first time a total absorption spectrometer to a Penning trap in order to obtain sources of very high isobaric purity. Our results solve a significant part of a long-standing discrepancy in the {gamma} component of the decay heat for {sup 239}Pu in the 4-3000 s range.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solving Unit Commitment Problems with Demand Responsive Loads

This work focuses on using variations of the Frank-Wolfe (FW) algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the IEEE Reliability Test System that the timeseries of demand responsive load decisions obtained through our approach are near optimal and describe how large-scale parallel implementations of our approach can be highly computationally efficient.

demand response↗

Solving kinetic equations with adaptive mesh in phase space for rarefied gas dynamics and plasma physics (Invited)

The paper describes an Adaptive Mesh in Phase Space (AMPS) technique for solving kinetic equations with deterministic mesh-based methods. The AMPS technique allows automatic generation of adaptive Cartesian mesh in both physical and velocity spaces using a Tree-of-Trees data structure. We illustrate advantages of AMPS for simulations of rarefied gas dynamics and electron kinetics on low temperature plasmas. In particular, we consider formation of the velocity distribution functions in hypersonic flows, particle kinetics near oscillating boundaries, and electron kinetics in a radio-frequency sheath. AMPS provide substantial savings in computational cost and increased efficiency of the mesh-based kinetic solvers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implementation of the Jacobian-free Newton-Krylov method for solving the for solving the first-order ice sheet momentum balance

We have implemented the Jacobian-free Newton-Krylov (JFNK) method for solving the rst-order ice sheet momentum equation in order to improve the numerical performance of the Community Ice Sheet Model (CISM), the land ice component of the Community Earth System Model (CESM). Our JFNK implementation is based on signicant re-use of existing code. For example, our physics-based preconditioner uses the original Picard linear solver in CISM. For several test cases spanning a range of geometries and boundary conditions, our JFNK implementation is 1.84-3.62 times more efficient than the standard Picard solver in CISM. Importantly, this computational gain of JFNK over the Picard solver increases when rening the grid. Global convergence of the JFNK solver has been signicantly improved by rescaling the equation for the basal boundary condition and through the use of an inexact Newton method. While a diverse set of test cases show that our JFNK implementation is usually robust, for some problems it may fail to converge with increasing resolution (as does the Picard solver). Globalization through parameter continuation did not remedy this problem and future work to improve robustness will explore a combination of Picard and JFNK and the use of homotopy methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Kinetic-j : A computational kernel for solving the linearized Vlasov equation applied to calculations of the kinetic, configuration space plasma current for time harmonic wave electric fields

We present the Kinetic-j code, a computational kernel for evaluating the linearized Vlasov equation withapplication to calculating the kinetic plasma response (current) to an applied time harmonic wave electricfield. This code addresses the need for a configuration space evaluation of the plasma current to enablekinetic full-wave solvers for waves in hot plasmas to move beyond the limitations of the traditional Fourierspectral methods. We benchmark the kernel via comparison with the standard k-space forms of the hotplasma conductivity tensor.

Green, David L.↗

General features of supersymmetric signals at the ILC: Solving the CERN LHC inverse problem

We present the first detailed, large-scale study of the minimal supersymmetric standard model (MSSM) at the {radical}(s)=500 GeV International Linear Collider (ILC), including full standard model backgrounds and detector simulation. This is the first realistic study of the capabilities of the ILC examining the physics of many distinct points in MSSM parameter space which are not linked to a particular supersymmetry (SUSY) breaking mechanism. Specifically, we investigate 242 points in the MSSM parameter space, which we term models, that correspond to the 162 pairs of models that were found by Arkani-Hamed et al. to give indistinguishable signatures at the LHC. We first determine whether the production of the various SUSY particles is visible above the standard model background for each of these parameter space points, and then make a detailed comparison of their various signatures. Assuming an integrated luminosity of 500 fb{sup -1} with 80% electron beam polarization, we find that only 82 out of 242 models lead to visible signatures of some kind with a significance {>=}5 and that only 57 (63) out of the 162 model pairs are distinguishable at 5 (3){sigma}. Our analysis includes PYTHIA and CompHEP SUSY signal generation, full matrix element SM backgrounds for all 2{yields}2, 2{yields}4 and 2{yields}6 processes, ILC-specific initial state radiation and beamstrahlung generated via WHIZARD/GuineaPig, and employs the fast SiD detector simulation org.lcsim. If SUSY is light, the ILC will do a good job at examining its details.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗