Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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,315 records · Page 73

SU-E-I-76: Matching Primary and Scattered X-Ray Spectra for Use in Calculating the Diagnostic Radiation Index of Protection

Purpose: Lightweight lead-free or lead-composite protective garments exploit k-edge interactions to attenuate scattered X-rays. Manufacturers specify the protective value of garments in terms of lead equivalence at a single kVp. This is inadequate, as the protection provided by such garments varies with radiation quality in different use conditions. We present a method for matching scattered X-ray spectra to primary X-ray spectra. The resulting primary spectra can be used to measure penetration through protective garments, and such measurements can be weighted and summed to determine a Diagnostic Radiation Index for Protection (DRIP). Methods: Scattered X-ray spectra from fluoroscopic procedures were modeled using Monte Carlo techniques in MCNP-X 2.7. Data on imaging geometry, operator position, patient size, and primary beam spectra were gathered from clinical fluoroscopy procedures. These data were used to generate scattered X-ray spectra resulting from procedural conditions. Technical factors, including kV and added filtration, that yielded primary X-ray spectra that optimally matched the generated scattered X-ray spectra were identified through numerical optimization using a sequential quadratic programming (SQP) algorithm. Results: The primary spectra generated with shape functions matched the relative flux in each bin of the scattered spectra within 5%, and half and quarter-value layers matched within 0.1%. The DRIP for protective garments can be determined by measuring the penetration through protective garments using the matched primary spectra, then calculating a weighted average according to the expected clinical use of the garment. The matched primary spectra are specified in terms of first and second half-value layers in aluminum and acrylic. Conclusion: Lead equivalence is inadequate for completely specifying the protective value of garments. Measuring penetration through a garment using full scatter conditions is very difficult. The primary spectra determined in this work allow for practical primary penetration measurements to be made with equipment readily available to clinical medical physicists.

61 RADIATION PROTECTION AND DOSIMETRY↗

Two-Level Convergence Theory for Multigrid Reduction in Time (MGRIT)

Here we develop a two-grid convergence theory for the parallel-in-time scheme known as multigrid reduction in time (MGRIT), as it is implemented in the open-source package [XBraid: Parallel Multigrid in Time, http://llnl.gov/casc/xbraid]. MGRIT is a scalable and multilevel approach to parallel-in-time simulations that nonintrusively uses existing time-stepping schemes, and in a specific two-level setting it is equivalent to the widely known parareal algorithm. The goal of this paper is twofold. First, we present a two-level MGRIT convergence analysis for linear problems where the spatial discretization matrix can be diagonalized, and then apply this analysis to our two basic model problems, the heat equation and the advection equation. One important assumption is that the coarse and fine time-grid propagators can be diagaonalized by the same set of eigenvectors, which is often the case when the same spatial discretization operator is used on the coarse and fine time grids. In many cases, the MGRIT algorithm is guaranteed to converge, and we demonstrate numerically that the theoretically predicted convergence rates are sharp in practice for our model problems. Second, we explore how the convergence of MGRIT compares to the stability of the chosen time-stepping scheme. In particular, we demonstrate that a stable time-stepping scheme does not necessarily imply convergence of MGRIT, although MGRIT with FCF-relaxation always converges for the diffusion dominated problems considered here.

97 MATHEMATICS AND COMPUTING↗

Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components

Here, we develop a manifold sampling algorithm for the minimization of a nonsmooth composite function $f \triangleq \psi + h \circ F$ when $\psi$ is smooth with known derivatives, $h$ is a known, nonsmooth, piecewise linear function, and $F$ is smooth but expensive to evaluate. The trust-region algorithm classifies points in the domain of $h$ as belonging to different manifolds and uses this knowledge when computing search directions. Since $h$ is known, classifying objective manifolds using only the values of $F$ is simple. We prove that all cluster points of the sequence of the manifold sampling algorithm iterates are Clarke stationary; this holds although points evaluated by the algorithm are not assumed to be differentiable and when only approximate derivatives of $F$ are available. Numerical results show that manifold sampling using zeroth-order information about $F$ is competitive with algorithms that employ exact subgradient values from $\partial f$.

97 MATHEMATICS AND COMPUTING↗

Selection and Assessment of Phenomenological Models of Tumor Growth

We address general approaches to the rational selection and validation of mathematical and computational models of tumor growth using methods of Bayesian inference. The model classes are derived from a general diffuse-interface, continuum mixture theory and focus on mass conservation of mixtures with up to four species. Synthetic data are generated using higher-order base models. We discuss general approaches to model calibration, validation, plausibility, and selection based on Bayesian-based methods, information theory, and maximum information entropy. We also address computational issues and provide numerical experiments based on Markov chain Monte Carlo algorithms and high performance computing implementations.

59 BASIC BIOLOGICAL SCIENCES↗

METRICS FOR INTERCOMPARISON OF REMAPPING ALGORITHMS (MIRA)

The MIRA project comprises of a set of Python drivers that enable rigorous intercomparison of remapping algorithms by providing the infrastructure for computing the numerical metrics of interest for ESM. This work is funded by the SciDAC Coupling Approaches for Next-Generation Architectures (CANGA) project.

SciDAC↗

Enhancements to the Munson-Dawson Model for Rock Salt

The Munson-Dawson (MD) constitutive model was originally developed in the 1980's to predict the thermomechanical behavior of rock salt. Since then, it has been used to simulate the evolution of the underground in nuclear waste repositories, mines, and storage caverns for gases and liquids. This report covers three enhancements to the MD model. (1) New transient and steady-state rate terms were added to capture salt's creep behavior at low equivalent stresses (below about 8 MPa). These new terms were calibrated against a series of triaxial compression creep experiments on salt from the Waste Isolation Pilot Plant. (2) The equivalent stress measure was changed from the Tresca stress to the Hosford stress. By varying a single exponent, the Hosford stress can reduce to the Tresca stress, the von Mises stress, or a range of behaviors in-between. This exponent was calibrated against true triaxial compression experiments on salt hollow cylinders. (3) The MD model's numerical implementation was overhauled, adding a line search algorithm to the implicit solution scheme. The new implementation was verified against analytical solutions, and benchmarked against a pre-existing implementation on a room closure simulation. The new implementation pre- dicted virtually identical room closure, yet sped up the simulation by 16x . (The source code of the new implementation is included in an appendix of this report.)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Robust Learning with Implicit Residual Networks

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show that this choice leads to the improved stability of both forward and backward propagations, has a favorable impact on the generalization power, and allows for control the robustness of the network with only a few hyperparameters. In addition, the proposed reformulation of ResNet does not introduce new parameters and can potentially lead to a reduction in the number of required layers due to improved forward stability. Finally, we derive the memory-efficient training algorithm, propose a stochastic regularization technique, and provide numerical results in support of our findings.

Reshniak, Viktor↗

Fornax: A Flexible Code for Multiphysics Astrophysical Simulations

This paper describes the design and implementation of our new multigroup, multidimensional radiation hydrodynamics code Fornax and provides a suite of code tests to validate its application in a wide range of physical regimes. Instead of focusing exclusively on tests of neutrino radiation hydrodynamics relevant to the core-collapse supernova problem for which Fornax is primarily intended, we present here classical and rigorous demonstrations of code performance relevant to a broad range of multidimensional hydrodynamic and multigroup radiation hydrodynamic problems. Our code solves the comoving-frame radiation moment equations using the M1 closure, utilizes conservative high-order reconstruction, employs semi-explicit matter and radiation transport via a high-order time stepping scheme, and is suitable for application to a wide range of astrophysical problems. To this end, we first describe the philosophy, algorithms, and methodologies of Fornax and then perform numerous stringent code tests that collectively and vigorously exercise the code, demonstrate the excellent numerical fidelity with which it captures the many physical effects of radiation hydrodynamics, and show excellent strong scaling well above 100,000 MPI tasks.

79 ASTRONOMY AND ASTROPHYSICS↗

thornado-hydro: A Discontinuous Galerkin Method for Supernova Hydrodynamics with Nuclear Equations of State

This paper describes algorithms for non-relativistic hydrodynamics in the toolkit for high-order neutrino radiation hydrodynamics (thornado), which is being developed for multiphysics simulations of core-collapse supernovae (CCSNe) and related problems with Runge–Kutta discontinuous Galerkin (RKDG) methods. More specifically, thornado employs a spectral type nodal collocation approximation, and we have extended limiters — a slope limiter to prevent non-physical oscillations and a bound-enforcing limiter to prevent non-physical states — from the standard RKDG framework to be able to accommodate a tabulated nuclear equation of state (EoS). To demonstrate the efficacy of the algorithms with a nuclear EoS, we first present numerical results from basic test problems in idealized settings in one and two spatial dimensions, employing Cartesian, spherical-polar, and cylindrical coordinates. Then, we apply the RKDG method to the problem of adiabatic collapse, shock formation, and shock propagation in spherical symmetry, initiated with a 15 M ⊙ progenitor. Herein, we find that the extended limiters improve the fidelity and robustness of the RKDG method in idealized settings. The bound-enforcing limiter improves robustness of the RKDG method in the adiabatic collapse application, while we find that slope limiting in characteristic fields is vulnerable to structures in the EoS — more specifically, in the phase transition from nuclei and nucleons to bulk nuclear matter. The success of these applications marks an important step toward applying RKDG methods to more realistic CCSN simulations with thornado in the future.

Nuclear astrophysics (1129)↗

Bottomonium suppression in pNRQCD and open quantum system approach

By employing the potential non-relativistic quantum chromodynamics (pNRQCD) effective field theory within an open quantum system framework, we derive a Lindblad equation governing the evolution of the heavy-quarkonium reduced density matrix, accurate to next-to-leading order (NLO) in the ratio of the state's binding energy to the medium's temperature [1]. The derived NLO Lindblad equation provides a more reliable description of heavy-quarkonium evolution in the quark-gluon plasma at low temperatures compared to the leading-order truncation. For phenomenological applications, we numerically solve this equation using the quantum trajectories algorithm. By averaging over Monte Carlo-sampled quantum jumps, we obtain solutions without truncation in the angular momentum quantum number of the considered states. Our analysis highlights the importance of quantum jumps in the nonequilibrium evolution of bottomonium states within the quark-gluon plasma [2]. Additionally, we demonstrate that the quantum regeneration of singlet states from octet configurations is essential to explain experimental observations of bottomonium suppression. The heavy-quarkonium transport coefficients used in our study align with recent lattice QCD determinations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Limitations of traditional tools for beyond design basis external hazard PRA

Probabilistic risk assessment (PRA) is being used increasingly by the nuclear industry for safety during normal operations as well as for the protection against external hazards. Computation of total risk in an external hazard PRA is dependent on hazard assessment, fragility assessment, and systems analysis. A systems analysis for propagation of component fragilities is conducted using event and fault trees. The event and fault trees for an actual power plant can be fairly large in size, which imposes computational challenges. Hence, certain assumptions are employed for computational efficiency. These assumptions typically represent the conditions imposed during the design basis (DB) scenario. The traditional PRA tools based on these assumptions are also widely applied to perform risk assessment in the context of beyond design basis (BDB) scenarios. However, some of these assumptions may not be valid for certain BDB scenarios. In addition, the probability of dependent failures also increases in BDB scenarios due to common cause failures (CCF) which usually results from design modifications, human errors, etc. In this manuscript, a simple and a relatively more complex illustrative examples are used to show the limitation of these assumptions in the numerical quantification of risk for the case of BDB conditions. Case studies with CCF events across multiple fault trees are also presented to illustrate the effect of these assumptions when traditional approach is used in BDB risk assessment. It is shown that the assumptions are valid for the case of DB conditions but may lead to excessively conservative risk estimates in the case of BDB conditions. Finally, a Bayesian network based top-down algorithm is proposed as an alternative tool for accurate numerical quantification of total risk in systems analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Calibrated Blade-Element/Momentum Theory Aerodynamic Model of the MARIN Stock Wind Turbine: Preprint

In this paper, a calibrated blade-element/momentum theory aerodynamic model of the MARIN stock wind turbine is developed and documented. The model is created using open-source software and calibrated to closely emulate experimental data obtained by the DeepCwind Consortium using a genetic algorithm optimization routine. The provided model will be useful for those interested in validating interested in validating floating wind turbine numerical simulators that rely on experiments utilizing the MARIN stock wind turbine—for example, the International Energy Agency Wind Task 30’s Offshore Code Comparison Collaboration Continued, with Correlation project.

17 WIND ENERGY↗

Sensitivity estimation in time-of-flight list-mode positron emission tomography

Purpose: An accurate quantification of the images in positron emission tomography (PET) requires knowing the actual sensitivity at each voxel, which represents the probability that a positron emitted in that voxel is finally detected as a coincidence of two gamma rays in a pair of detectors in the PET scanner. This sensitivity depends on the characteristics of the acquisition, as it is affected by the attenuation of the annihilation gamma rays in the body, and possible variations of the sensitivity of the scanner detectors. In this work, the authors propose a new approach to handle time-of-flight (TOF) list-mode PET data, which allows performing either or both, a self-attenuation correction, and self-normalization correction based on emission data only. Methods: The authors derive the theory using a fully Bayesian statistical model of complete data. The authors perform an initial evaluation of algorithms derived from that theory and proposed in this work using numerical 2D list-mode simulations with different TOF resolutions and total number of detected coincidences. Effects of randoms and scatter are not simulated. Results: The authors found that proposed algorithms successfully correct for unknown attenuation and scanner normalization for simulated 2D list-mode TOF-PET data. Conclusions: A new method is presented that can be used for corrections for attenuation and normalization (sensitivity) using TOF list-mode data.

60 APPLIED LIFE SCIENCES↗

MAESTRO: AN ADAPTIVE LOW MACH NUMBER HYDRODYNAMICS ALGORITHM FOR STELLAR FLOWS

Many astrophysical phenomena are highly subsonic, requiring specialized numerical methods suitable for long-time integration. In a series of earlier papers we described the development of MAESTRO, a low Mach number stellar hydrodynamics code that can be used to simulate long-time, low-speed flows that would be prohibitively expensive to model using traditional compressible codes. MAESTRO is based on an equation set derived using low Mach number asymptotics; this equation set does not explicitly track acoustic waves and thus allows a significant increase in the time step. MAESTRO is suitable for two- and three-dimensional local atmospheric flows as well as three-dimensional full-star flows. Here, we continue the development of MAESTRO by incorporating adaptive mesh refinement (AMR). The primary difference between MAESTRO and other structured grid AMR approaches for incompressible and low Mach number flows is the presence of the time-dependent base state, whose evolution is coupled to the evolution of the full solution. We also describe how to incorporate the expansion of the base state for full-star flows, which involves a novel mapping technique between the one-dimensional base state and the Cartesian grid, as well as a number of overall improvements to the algorithm. We examine the efficiency and accuracy of our adaptive code, and demonstrate that it is suitable for further study of our initial scientific application, the convective phase of Type Ia supernovae.

79 ASTRONOMY AND ASTROPHYSICS↗

Data–driven model reduction for the Bayesian solution of inverse problems

One of the prime challenges in the Bayesian solution of inverse problems governed by partial differential equations (PDEs) is the computational cost of repeatedly evaluating numerical PDE models, as required by Markov chain Monte Carlo (MCMC) methods for posterior sampling. This paper presents a data-driven projection-based model reduction technique to reduce this computational cost. The proposed technique has two distinctive features. To begin, the model reduction strategy is tailored to inverse problems: the snapshots used to construct the reduced-order model are computed adaptively from the posterior distribution. Posterior exploration and model reduction are thus pursued simultaneously. Second, to avoid repeated evaluations of the full-scale numerical model as in a standard MCMC method, we couple the full-scale model and the reduced-order model together in the MCMC algorithm. This maintains accurate inference while reducing its overall computational cost. In numerical experiments considering steady-state flow in a porous medium, the data-driven reduced-order model achieves better accuracy than a reduced-order model constructed using the classical approach. It also improves posterior sampling efficiency by several orders of magnitude compared with a standard MCMC method.

97 MATHEMATICS AND COMPUTING↗

DISENTANGLING THE ICL WITH THE CHEFs: ABELL 2744 AS A CASE STUDY

Measurements of the intracluster light (ICL) are still prone to methodological ambiguities, and there are multiple techniques in the literature to address them, mostly based on the binding energy, the local density distribution, or the surface brightness. A common issue with these methods is the a priori assumption of a number of hypotheses on either the ICL morphology, its surface brightness level, or some properties of the brightest cluster galaxy (BCG). The discrepancy in the results is high, and numerical simulations just place a boundary on the ICL fraction in present-day galaxy clusters in the range 10%–50%. We developed a new algorithm based on the Chebyshev–Fourier functions to estimate the ICL fraction without relying on any a priori assumption about the physical or geometrical characteristics of the ICL. We are able to not only disentangle the ICL from the galactic luminosity but mark out the limits of the BCG from the ICL in a natural way. We test our technique with the recently released data of the cluster Abell 2744, observed by the Frontier Fields program. The complexity of this multiple merging cluster system and the formidable depth of these images make it a challenging test case to prove the efficiency of our algorithm. We found a final ICL fraction of 19.17 ± 2.87%, which is very consistent with numerical simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗