An official website of the United States government
This paper is concerned with developing an efficient numerical algorithm for the fast implementation of the sparse grid method for computing the d-dimensional integral of a given function. The new algorithm, called the MDI-SG (multilevel dimension iteration sparse grid) method, implements the sparse grid method based on a dimension iteration/reduction procedure. It does not need to store the integration points, nor does it compute the function values independently at each integration point; instead, it reuses the computation for function evaluations as much as possible by performing the function evaluations at all integration points in a cluster and iteratively along coordinate directions. It is shown numerically that the computational complexity (in terms of CPU time) of the proposed MDI-SG method is of polynomial order O(d3Nb)(b≤2) or better, compared to the exponential order O(N(logN)d−1) for the standard sparse grid method, where N denotes the maximum number of integration points in each coordinate direction. As a result, the proposed MDI-SG method effectively circumvents the curse of dimensionality suffered by the standard sparse grid method for high-dimensional numerical integration.
more »
« less
This content will become publicly available on October 28, 2026
Mass conservative limiting and applications to the approximation of the steady-state radiation transport equations
A limiting technique for scalar transport equations is presented. The originality of the method is that it does not require solving nonlinear optimization problems nor does it rely on the construction of a low-order approximation. The method has minimal complexity and is numerically demonstrated to maintain high-order accuracy. The performance of the method is illustrated on the radiation transport equation.
more »
« less
- Award ID(s):
- 2110868
- PAR ID:
- 10640480
- Publisher / Repository:
- 2024 Elsevier Inc., Journal of Computational Physics 521 (2025) 113531
- Date Published:
- Journal Name:
- Journal of computational physics
- ISSN:
- 0021-9991
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Sensitivity analysis with atmospheric chemical transport models may be used to quantify influences of specific emissions on pollutant concentrations. This information facilitates efficient environmental decision‐making regarding emissions control strategies for pollutants that affect human health and public welfare. The multicomplex step method (MCX) is a sensitivity analysis approach that enables calculation of first‐ and higher‐order sensitivities of a nonlinear algorithm with analytical accuracy. Compared to the well‐known finite difference method, the MCX method is also straight‐forward to compute yet does not suffer from precision errors due to subtracting numbers with common leading digits and eliminates the requirement of tuning the step size. The aerosol inorganic equilibrium thermodynamic model, ISORROPIA, which treats ammonium, chloride, nitrate, sodium, sulfate, calcium, potassium, and magnesium, was augmented to leverage the multicomplex step method (ISORROPIA‐MCX) to analyze the influence that the total amount of a pollutant has on concentrations partitioned into different phases. This enables simultaneous calculation of the first‐order, second‐order, and cross‐sensitivity terms in the Taylor Series expansion when evaluating the impact of changes in input parameters on an output variable, increasing the accuracy of the estimated effect when the functions are nonlinear. ISORROPIA encodes highly nonlinear processes which showcases the computational advantages of the multicomplex step method as well as the limitations of the approach for fractured solution surfaces. With ISORROPIA‐MCX, the influence of total concentrations of aerosol precursors on aerosol acidity are evaluated with cross‐sensitivity terms for the first time.more » « less
-
null (Ed.)In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However, a key practical difficulty of sketching an SVD is that the user does not know how far the sketched singular vectors/values are from the exact ones. Indeed, the user may be forced to rely on analytical worst-case error bounds, which may not account for the unique structure of a given problem. As a result, the lack of tools for error estimation often leads to much more computation than is really necessary. To overcome these challenges, this paper develops a fully data-driven bootstrap method that numerically estimates the actual error of sketched singular vectors/values. Furthermore, the method is computationally inexpensive, because it operates only on sketched objects, and hence it requires no extra passes over the full matrix being factored.more » « less
-
Abstract The two-moment method is widely used to approximate the full neutrino transport equation in core-collapse supernova (CCSN) simulations, and different closures lead to subtle differences in the simulation results. In this paper, we compare the effects of closure choices on various physical quantities in 1D and 2D time-dependent CCSN simulations with our multigroup radiation hydrodynamics code Fornax. We find that choices of the third-order closure relations influence the time-dependent simulations only slightly. Choices of the second-order closure relation have larger consequences than choices of the third-order closure, but these are still small compared to the remaining variations due to ambiguities in some physical inputs such as the nuclear equation of state. We also find that deviations in Eddington factors are not monotonically related to deviations in physical quantities, which means that simply comparing the Eddington factors does not inform one concerning which closure is better.more » « less
-
In the present work, we develop a novel particle method for a general class of mean field control problems, with source and terminal constraints. Specific examples of the problems we consider include the dynamic formulation of thep-Wasserstein metric, optimal transport around an obstacle, and measure transport subject to acceleration controls. Unlike existing numerical approaches, our particle method is meshfree and does not require global knowledge of an underlying cost function or of the terminal constraint. A key feature of our approach is a novel way of enforcing the terminal constraint via a soft, nonlocal approximation, inspired by recent work on blob methods for diffusion equations.We prove convergence of our particle approximation to solutions of the continuum mean-field control problem in the sense of Γ-convergence. A byproduct of our result is an extension of existing discrete-to-continuum convergence results for mean field control problems to more general state and measure costs, as arise when modeling transport around obstacles, and more general constraint sets, including controllable linear time invariant systems. Finally, we conclude by implementing our method numerically and using it to compute solutions the example problems discussed above. We conduct a detailed numerical investigation of the convergence properties of our method, as well as its behavior in sampling applications and for approximation of optimal transport maps.more » « less
