Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convergence rate”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

nPINNs: nonlocal Physics-Informed Neural Networks for a parametrized nonlocal universal Laplacian operator. Algorithms and Applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius δ goes to zero, and to the fractional Laplacian as δ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We provide theoretical convergence rates with respect to δ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, δ and α, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order α(γ), which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as δ. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Improvements to the New CTH Code Verification & Validation Test Suite (FY2020)

The CTH multiphysics hydrocode, which is used for a wide range of important calculations, has undertaken in recent years to overhaul its software quality and testing processes. A key part of this effort entailed building a new, robust V&V test suite made up of traditional hydrocode verification problems, such as those listed in the ASC Tri-Lab Test Suite and the Enhanced Tri-Lab Test Suite, as well as validation problems for some of CTHs most frequently used equations of state, materials models, and other key capabilities. Substantial progress towards this goal was made in FY19. In FY20, this test suite has been expanded to include verification and validation tests of the Sesame and JWL equation of state models as well as the Mader verification problem from the Tri-Lab Test Suite and the Blake verification problem - a linear elastic analog to the Hunter problem from the Enhanced Tri-Lab Test Suite. This report documents CTH performance on the new test suite problems. Verification test results are compared to analytic solutions and, for most tests, convergence results are presented. Validation test results are compared to experimental data and mesh refinement studies are included. CTH performs well overall on the new test problems. Convergence rates for the Blake and Mader problems are comparable to those for similar ASC codes. The JWL and Sesame verification tests show good agreement with analytic solutions. Likewise, CTH simulation results show good agreement with experimental validation data for the Sesame and JWL equations of state for the materials tested. Future V&V work will focus on adding tests for other key capabilities like fracture and high explosive models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that extends the finite element method to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method (FEM) for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. We numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular and square meshes where the method coincides with the P 1 - P 0 Scott-Vogelius scheme, which is well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Combining DPG in space with DPG time-marching scheme for the transient advection-reaction equation

In this article, we present a general methodology to combine the Discontinuous PetrovGalerkin (DPG) method in space and time in the context of methods of lines for transient advection-reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). We also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection-reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Variance Reduction within Implicit Monte Carlo Thermal Radiation Transport using the Local Importance Function Transform [Slides]

System of equations derived by Fleck and Cummings to model time-dependent thermal radiative transfer (TRT) problems: Solution of radiation specific intensity (I), non-linearly coupled to material internal energy (U); Absorption and re-emission approximated by effective scattering events. Useful for high-energy density physics simulations: i.e., astrophysics, inertial confinement fusion (ICF). Whereas deterministic methods are fully discretized and free of statistical noise, Monte Carlo methods allow for dynamic sampling of the phase space at the price of statistical noise; Monte Carlo methods are also characterized by a slow $\frac{1}{√Ν}$ convergence rate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗
DOE OSTI2025

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The Virtual Element Method (VEM) is a Galerkin approximation method that extends the Finite Element Method (FEM) to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. Finally, we numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular meshes, where the method coincides with the $\mathbb{P}_1$ – $\mathbb{P}_0$ Scott-Vogelius scheme, and on square meshes, which are situations that are well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Subspace Methods in Multi-Parameter Seismic Full Waveform Inversion

In full waveform inversion (FWI) high-resolution subsurface model parameters are sought. FWI is normally treated as a nonlinear least-squares inverse problem, in which the minimum of the corresponding misfit function is found by updating the model parameters. When multiple elastic or acoustic properties are solved for, simple gradient methods tend to confuse parameter classes. This is referred to as parameter cross-talk; it leads to incorrect model solutions, poor convergence and strong dependence on the scaling of the different parameter types. Determining step lengths in a subspace domain, rather than directly in terms of gradients of different parameters, is a potentially valuable approach to address this problem. The particular subspace used can be defined over a span of different sets of data or different parameter classes, provided it involves a small number of vectors compared to those contained in the whole model space. Additionally, in a subspace method, the basis vectors are defined first, and a local minimum is found in the space spanned by these. We examine the application of the subspace method within acoustic FWI in determining simultaneously updates for velocity and density. We first discuss the choice of basis vectors to construct the spanned space, from linear updates by distinguishing only the contributions of different parameter classes towards nonlinear updates by adding the contributions of higher-order perturbations of each parameter class. The numerical character of FWI solutions generated via subspace methods involving different basis vectors is then analyzed and compared with traditional FWI methods. The subspace methods can provide better reconstructions of the model, especially for the velocity, as well as improved convergence rates, while the computational costs are still comparable with the traditional FWI methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Developing A Custom-Built Metal Aerosol Processing Chamber: Analysis of Aerosol Coagulation at Low Humidities

We have developed an intermediate size (906 L) aerosol processing chamber, and this work reports on the design and initial characterization of dry aerosol experiments. Specifically, we are determining wall-loss and coagulation correction factors using the observed size distribution measurements for surrogates of common aerosol classes: sodium chloride, sucrose, and biomass burning aerosol smoke. Results show that, on average, sodium chloride, sucrose, and smoke wall-loss rates converge to similar values on relatively short time scales (< 1 h). The fitted coagulation correction factor, W C -1 , for smoke particles (1.23 ± 0.312), indicates that on average they adhere to each other more than sodium chloride (0.969 ± 0.524) and sucrose (1.16 ± 1.38). The relative uncertainty is high for the coagulation correction, but it is consistent with our Monte Carlo error analysis. This study lays the foundation for future experiments at elevated humidity and supersaturation conditions to characterize the influence of particle shape on coagulation and cloud parameters.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints

Modern wind plants are increasingly tasked with multiple performance objectives. In addition to designing plants that maximize power output and minimize the levelized cost of energy (LCOE), the design and operation of wind plants is increasingly influenced by challenges regarding grid integration of variable generation renewables. This places a growing emphasis on making wind plants more controllable and predictable. WindSE is a Reynolds-averaged Navier-Stokes (RANS) model designed around analytical gradient and adjoint methods, with the ability to capture terrain-induced effects, as shown in Figure 1. The recent addition of an unsteady solver with an actuator line method (ALM) and ongoing work to enable massively parallel optimizations gives it a unique niche to explore coupled plant-level controls and design problems. This code is an open source python package built on the FEniCS framework that utilizes fast, parallel PETSc solvers to model fluid flow throughout wind-farm scale domains. Two recent studies performed using WindSE demonstrate the capability to optimize under a wide variety of flow conditions and objective functions. In the first, we present an optimization focused on modifying the layout of a wind farm with a fixed number of turbines for maximum total power output [1]. This study highlights the ability to quickly perform simulations using the steady Navier-Stokes solver combined with rotors represented as actuator disks while also stressing the importance of capturing terrain-induced effects. Gradient-based optimization using the RANS equations is viable due to the inclusion of efficiently computed adjoint derivatives. We interpret the physical results of the optimal layout and also discuss the computational cost of scaling to larger problems. In the second study, we present the capabilities of the unsteady Navier-Stokes solver, where rotor-blade profiles represented by actuator lines are optimized to enhance wake steering effects and overall power production [2]. We quantify the wind plant performance gains obtained from this type of simultaneous control co-design optimization as compared to optimizing the blade design and yaw independently. Figure 2 shows the differences between a baseline two-turbine system and an optimized system where we fine-tune the blade chord profile. Results and challenges from each study are quickly summarized and used to motivate the current development efforts within WindSE. Current and future work is focused on enabling higher-resolution studies with more degrees of freedom through parallelization of both the simulation and optimization algorithms. We present benchmarking results to show that WindSE performs well in both weak- and strong-scaling tests and further demonstrate that the optimizer obtains the same convergence rates in both shared- and distributed-memory environments. Using larger wind farms, we can study deep-array effects within an optimization context, allowing the use of objective functions that have been previously unstudied. As an example, we present ongoing work on a blockage metric which characterizes the loss of available kinetic energy due to wake effects from multiple upstream turbines.

adjoint optimization↗
DOE OSTI2023

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems: Preprint

Distributed control/optimization is a promising approach for network systems due to its advantages over centralized schemes, such as robustness, cost-effectiveness, and improved privacy. However, distributed methods can have drawbacks, such as slower convergence rates due to limited knowledge of the overall network model. Additionally, ensuring privacy in the communication of sensitive information can pose implementation challenges. To address this issue, we propose a distributed model identification algorithm that enables each agent to identify the sub-model that characterizes the relationship between its local control and the overall system outputs. The proposed algorithm maintains the privacy of local agents by only communicating through dummy variables. We demonstrate the efficacy of our algorithm in the context of power distribution systems by applying it to the voltage regulation of a modified IEEE distribution system. The proposed algorithm is well-suited to the needs of power distribution controls and offers an effective solution to the challenges of distributed model identification in network systems.

data-driven modeling↗
DOE OSTI2022

First-collision source treatment for ray effect mitigation in discrete-ordinate radiation transport solutions

Deterministic transport codes play a fundamental role in the modelling and simulation of neutron transport. One of the most common deterministic methods is the method of discrete ordinates, also known as the S method. While offering significant advantages over other deterministic methods or stochastic methods like Monte Carlo, the method of discrete ordinates suffers from non-physical artifacts in its local solution due to its discretization of angle. These artifacts, referred to as ray effects because of their ray-like appearance, tend to be worse in problems with small sources in areas with little scattering. Significant effort has gone into developing methods to mitigate ray effects, such as the first-collision source treatment, which separates the angular flux into the uncollided and collided fluxes and solving them using non-traditional techniques such as ray tracing. One such code capable of doing this is Lawrence Livermore National Laboratory's deterministic transport code ARDRA. Current ray tracing methods typically trace to a set of points inside a zone to compute an overall flux. However, this approach has significant drawbacks, such as a low order of convergence and not being conservative. Therefore, a new method has been developed that traces instead to a set of points on each of a zone's surfaces and computing the currents, before using these to obtain the flux. A comparison between these two ray tracing methods showed significant advantages to the new surface method, including inherent conservation, a higher convergence rate, and an increase in calculable information like leakage. This work performed under the auspices of the U.S. Department of Energy by Lawrence Liver- more National Laboratory under Contract DE-AC52-07NA27344. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

FedOSAA: Improving Federated Learning with One-Step Anderson Acceleration

Federated learning (FL) is a distributed machine learning approach that enables multiple local clients and a central server to collaboratively train a model while keeping the data on their own devices. First-order methods, particularly those incorporating variance reduction techniques, are the most widely used FL algorithms due to their simple implementation and stable performance. However, these methods tend to be slow and require a large number of communication rounds to reach the global minimizer. We propose FedOSAA, a novel approach that preserves the simplicity of first-order methods while achieving the rapid convergence typically associated with second-order methods. Our approach applies one Anderson acceleration (AA) step following classical local updates based on first-order methods with variance reduction, such as FedSVRG and SCAFFOLD, during local training. This AA step is able to leverage curvature information from the history points and gives a new update that approximates the Newton-GMRES direction, thereby significantly improving the convergence. We establish a local linear convergence rate to the global minimizer of FedOSAA for smooth and strongly convex loss functions. Numerical comparisons show that FedOSAA substantially improves the communication and computation efficiency of the original first-order methods, achieving performance comparable to second-order methods like GIANT.

Feng, Xue [University of California, Davis]↗
DOE OSTI2022

Code Verification and Solution Verification framework in pin-resolved neutron transport code MPACT

Program verification in scientific computing encompasses the application of formal and mathematical techniques to a scientific computing code for its credibility, accuracy, and validity. Code Verification identifies bugs and performance issues in the software development stage. Solution Verification assesses the applicability of the code and the accuracy of the solution to problems of interest. Both activities utilize application cases and quantify the error against prescribed acceptance criteria. However, simply executing more application cases does not guarantee stronger or more comprehensive credibility. Here, we establish a verification framework that involves Code Verification and Solution Verification, both of which work together such that the overarching goal of “converge to the correct answer for the intended application” can be reasonably inferred. The application of such a verification framework is demonstrated using the pin-resolved neutron transport code MPACT, where standard unit tests and regression tests are covered, and where the Method of Exact Solutions and the Method of Manufactured Solutions are successfully used. Additionally, the applicability of Method of Manufactured Solutions is extended to the OECD/NEA C5G7 benchmark problems of practical material and geometric configurations. Solution Verification activities are demonstrated on a practical hierarchy of application models of increasing complexity ranging from 2D pin cell problems to 3D assembly problems. The convergence behavior and rate of convergence with respect to each individual variable are studied and provided. This framework can be adapted broadly to other fields involving scientific computing codes.

97 MATHEMATICS AND COMPUTING↗