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 1,621 records · Page 90

Introduction of corrections taking into account interdependence of multigroup constants to the results of multigroup perturbation theory calculations

In multigroup calculations of reactivity and sensitivity coefficients, methodical errors can appear if the interdependence of multigroup constants is not taken into account. For this effect to be taken into account, so-called implicit components of the aforementioned values are introduced. A simple technique for computing these values is proposed. It is based on the use of subgroup parameters.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Comparison of Closures for Stochastic Advection-Dispersion

Perturbation-based moment equations for advection-dispersion equations with random advection have been shown to produce physically unrealistic multimodality. Despite similarities, macrodispersion theory applied to advection-dispersion equations produces moments that do not exhibit such multimodal behavior. This is because macrodispersion approximations, whether explicitly or implicitly, involve renormalized perturbations that remove secularity by including select higher-order terms. We consider basic differences between the two approaches using a low-order macrodispersion approximation to clarify why one produces physically meaningful behavior while the other does not. We demonstrate that using a conventional asymptotic expansion (in the order of velocity fluctuations) leads to equations that cannot produce physically meaningful (macro)dispersion, whether applied to moment equations or macrodispersion theory, proving that the resulting moment equations are in fact hyperbolic in one spatial dimension. We identify higher-order terms that must be added to the conventional expansion to recover second- and fourth-order macrodispersivity approximations. Finally, we propose a closed-form approximation to two-point covariance as a measure of uncertainty, in a manner consistent with the derivation of macrodispersivity. We demonstrate that this and all the macrodispersion-based approximations to moments are more accurate than the alternatives for an example of transport in stratified random media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The NonConforming Virtual Element Method for the Stokes Equations

In this paper, we present the nonconforming virtual element method (VEM) for the numerical approximation of velocity and pressure in the steady Stokes problem. The pressure is approximated using discontinuous piecewise polynomials, while each component of the velocity is approximated using the nonconforming virtual element space. On each mesh element the local virtual space contains the space of polynomials of up to a given degree, plus suitable nonpolynomial functions. The virtual element functions are implicitly defined as the solution of local Poisson problems with polynomial Neumann boundary conditions. As typical in VEM approaches, the explicit evaluation of the non-polynomial functions is not required. This approach makes it possible to construct nonconforming (virtual) spaces for any polynomial degree regardless of the parity, for two- and three-dimensional problems, and for meshes with very general polygonal and polyhedral elements. We show that the nonconforming VEM is inf-sup stable and establish optimal a priori error estimates for the velocity and pressure approximations. Finally, numerical examples confirm the convergence analysis and the effectiveness of the method in providing high-order accurate approximations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order staggered meshless method for elliptic problems

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attains $O(h^{m})$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.

97 MATHEMATICS AND COMPUTING↗

Algebraic Multigrid Preconditioners for Multiphase Flow in Porous Media

Multiphase flow is a critical process in a wide range of applications, including carbon sequestration, contaminant remediation, and groundwater management. Typically, this process is modeled by a nonlinear system of partial differential equations derived by considering the mass conservation of each phase (e.g., oil, water), along with constitutive laws for the relationship of phase velocity to phase pressure. In this study, we develop and study efficient solution algorithms for solving the algebraic systems of equations derived from a fully coupled and time-implicit treatment of models of multiphase flow. We explore the performance of several preconditioners based on algebraic multigrid (AMG) for solving the linearized problem, including “black-box” AMG applied directly to the system, a new version of constrained pressure residual multigrid (CPR-AMG) preconditioning, and a new preconditioner derived using an approximate Schur complement arising from the block factorization of the Jacobian. Finally, we show that the new methods are the most robust with respect to problem character, as determined by varying effects of capillary pressures, and we show that the block factorization preconditioner both is efficient and scales optimally with problem size.

97 MATHEMATICS AND COMPUTING↗

A Positive Asymptotic-Preserving Scheme for Linear Kinetic Transport Equations

We present a positive- and asymptotic-preserving numerical scheme for solving linear kinetic transport equations that relax to a diffusive equation in the limit of infinite scattering. The proposed scheme is developed using a standard spectral angular discretization and a classical micro-macro decomposition. The three main ingredients are a semi-implicit temporal discretization, a dedicated finite difference spatial discretization, and realizability limiters in the angular discretization. Under mild assumptions, the scheme becomes a consistent numerical discretization for the limiting diffusion equation when the scattering cross-section tends to infinity. The scheme also preserves positivity of the particle concentration on the space-time mesh and therefore fixes a common defect of spectral angular discretizations. The scheme is tested on the well-known line source benchmark problem with the usual uniform material medium as well as a medium composed of different materials that are arranged in a checkerboard pattern. We also tested the scheme on a Riemann problem with a nonuniform material medium. The observed order of space-time accuracy of the proposed scheme is reported.

nite difference methods↗

Efficient Operator-Coarsening Multigrid Schemes for Local Discontinuous Galerkin Methods

An efficient hp-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We show that traditional multigrid coarsening of the primal formulation leads to poor and suboptimal multigrid performance, whereas coarsening of the flux formulation leads to essentially optimal convergence and is equivalent to a purely geometric multigrid method. The resulting operator-coarsening schemes do not require the entire mesh hierarchy to be explicitly built, thereby obviating the need to compute quadrature rules, lifting operators, and other mesh-related quantities on coarse meshes. We show that good multigrid convergence rates are achieved in a variety of numerical tests on two-dimensional and three-dimensional uniform and adaptive Cartesian grids, as well as for curved domains using implicitly defined meshes and for multiphase elliptic interface problems with complex geometry. Extensions, e.g., to non-LDG discretizations and fully unstructured meshes, are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

A Scalable Multigrid Reduction Framework for Multiphase Poromechanics of Heterogeneous Media

Simulation of multiphase poromechanics involves solving a multiphysics problem in which multiphase flow and transport are tightly coupled with the porous medium deformation. To capture this dynamic interplay, fully implicit methods, also known as monolithic approaches, are usually preferred. The main bottleneck of a monolithic approach is that it requires solution of large linear systems that result from the discretization and linearization of the governing balance equations. Because such systems are nonsymmetric, indefinite, and highly ill-conditioned, preconditioning is critical for fast convergence. Recently, most efforts in designing efficient preconditioners for multiphase poromechanics have been dominated by physics-based strategies. Current state-of-the-art “black-box” solvers such as algebraic multigrid (AMG) are ineffective because they cannot effectively capture the strong coupling between the mechanics and the flow subproblems, as well as the coupling inherent in the multiphase flow and transport process. In this work, we develop an algebraic framework based on multigrid reduction (MGR) that is suited for tightly coupled systems of PDEs. Using this framework, the decoupling between the equations is done algebraically through defining appropriate interpolation and restriction operators. One can then employ existing solvers for each of the decoupled blocks or design a new solver based on knowledge of the physics. We demonstrate the applicability of our framework when used as a “black-box” solver for multiphase poromechanics. Here, we show that the framework is flexible to accommodate a wide range of scenarios, as well as efficient and scalable for large problems.

97 MATHEMATICS AND COMPUTING↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Multilevel Techniques for Compression and Reduction of Scientific Data---The Unstructured Case

Previous work on multilevel techniques for compression and reduction of scientific data is extended to the case of data given on unstructured meshes in two and three dimensions. The centerpiece of the work is a decomposition algorithm which is shown to be optimal, in terms of both storage and operational complexity, applicable to unstructured grids in both two and three dimensions, and which implicitly gives a Riesz basis that can be exploited to reduce the data while maintaining rigorous bounds on the loss incurred. The flexibility of the approach is illustrated by applications to potential flow around an airfoil and the effect of compression on quantities of interest relevant to airfoil design; compression of computational simulation of a nonlinear reaction-diffusion system with special attention given to the problem of time series reduction; and, data from a simulation of magnetically confined plasma in a fusion reactor reduced so as to preserve the electric field computed from the data.

97 MATHEMATICS AND COMPUTING↗

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗

Topological cell clustering in the ATLAS calorimeters and its performance in LHC Run 1

The reconstruction of the signal from hadrons and jets emerging from the proton–proton collisions at the Large Hadron Collider (LHC) and entering the ATLAS calorimeters is based on a three-dimensional topological clustering of individual calorimeter cell signals. The cluster formation follows cell signal-significance patterns generated by electromagnetic and hadronic showers. In this, the clustering algorithm implicitly performs a topological noise suppression by removing cells with insignificant signals which are not in close proximity to cells with significant signals. The resulting topological cell clusters have shape and location information, which is exploited to apply a local energy calibration and corrections depending on the nature of the cluster. Lastly, topological cell clustering is established as a well-performing calorimeter signal definition for jet and missing transverse momentum reconstruction in ATLAS.

43 PARTICLE ACCELERATORS↗

Light-front wavefunctions of mesons by design

Abstract We develop a mechanism to build the light-front wavefunctions (LFWFs) of meson bound states on a small-sized basis function representation. Unlike in a standard Hamiltonian formalism, the Hamiltonian in this method is implicit, and the information of the system is carried directly by the functional form and adjustable parameters of the LFWFs. In this work, we model the LFWFs for four charmonium states, $$\eta _c$$ η c , $$J/\psi $$ J / ψ , $$\psi '$$ ψ ′ , and $$\psi (3770)$$ ψ ( 3770 ) as superpositions of orthonormal basis functions. We choose the basis functions as eigenfunctions of an effective Hamiltonian, which has a longitudinal confining potential in addition to the transverse confining potential from light-front holographic QCD. We determine the basis function parameters and superposition coefficients by employing both guidance from the nonrelativistic description of the meson states and the experimental measurements of the meson decay widths. With the obtained wavefunctions, we study the features of those meson states, including charge radii and parton distribution functions. We use the $$J/\psi $$ J / ψ LFWF to calculate the meson production in diffractive deep inelastic scattering and ultra-peripheral heavy-ion collisions, and the $$\eta _c$$ η c LFWF to calculate its diphoton transition form factor. Both results show good agreement with experiments. The obtained LFWFs have simple-functional forms and can be readily used to predict additional experimental observables.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Neural networks for large eddy simulations of wall-bounded turbulence: numerical experiments and challenges

Here, we examine the application of neural network-based methods to improve the accuracy of large eddy simulations of incompressible turbulent flows. The networks are trained to learn a mapping between flow features and the subgrid scales, and applied locally and instantaneously—in the same way as traditional physics-based subgrid closures. Models that use only the local resolved strain rate are poorly correlated with the actual subgrid forces obtained from filtering direct numerical simulation data. We see that highly accurate models in a priori testing are inaccurate in forward calculations, owing to the preponderance of numerical errors in implicitly filtered large eddy simulations. A network that accounts for the discretization errors is trained and found to be unstable in a posteriori testing. We identify a number of challenges that the approach faces, including a distribution shift that affects networks that fail to account for numerical errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit solvent machine-learned coarse-grained model of sodium polystyrene sulfonate to capture polymer structure and dynamics

In this article, strongly charged polyelectrolytes (PEs) demonstrate complex solution behavior as a function of chain length, concentrations, and ionic strength. The viscosity behavior is important to understand and is a core quantity for many applications, but aspects remain a challenge. Molecular dynamics simulations using implicit solvent coarse-grained (CG) models successfully reproduce structure, but are often inappropriate for calculating viscosities. To address the need for CG models which reproduce viscoelastic properties of one of the most studied PEs, sodium polystyrene sulfonate (NaPSS), we report our recent efforts in using Bayesian optimization to develop CG models of NaPSS which capture both polymer structure and dynamics in aqueous solutions with explicit solvent. We demonstrate that our explicit solvent CG NaPSS model with the ML-BOP water model [Chan et al. Nat Commun 10, 379 (2019)] quantitatively reproduces NaPSS chain statistics and solution structure. The new explicit solvent CG model is benchmarked against diffusivities from atomistic simulations and experimental specific viscosities for short chains. We also show that our Bayesian-optimized CG model is transferable to larger chain lengths across a range of concentrations. Overall, this work provides a machine-learned model to probe the structural, dynamic, and rheological properties of polyelectrolytes such as NaPSS and aids in the design of novel, strongly charged polymers with tunable structural and viscoelastic properties

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Policy Considerations When Federating Facilities for Experimental and Observational Data Analysis

Today’s computational, experimental, and observational facilities afford us tremendous opportunities to couple theory and experiment at increasingly large scales. Empirical sensing capabilities are growing dramatically with beam line and detector improvements, and with advances in our ability to deploy large-scale data gathering observations of the natural world. The coupling of computational simulations and analysis to process the data from experimental and observational facilities is giving rise to cross-facility workflows. Such federations of facilities are in fact becoming an explicit requirement for large-scale scientific discovery. As we scale up these pipelines of scientific discovery, each participating facility needs to establish and align policies so that the federation can work seamlessly in an end-to-end manner. This chapter outlines specific policy considerations in enabling the federation of facilities for data analysis. Design choices and vital policy decisions cover the areas of data acquisition and storage, data transfer, computational resource allocation and co-scheduling, seamless federated user access, and cross-cutting governance. By highlighting the explicit and implicit interdependencies between facilities, we aim to provide facility designers and policymakers the information on policy issues to address early in a facility’s operations, thus enabling successful cross-facility federation and improved experimental and observational data analysis outcomes.

Shankar, Mallikarjun (Arjun)↗