Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive discretization”

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

A novel adaptive discrete cosine transform-domain filter for gap-inpainting of high resolution PET scanners

Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗

Modification of the SAS4A Safety Analysis Code for Integration with the ADAPT Discrete Dynamic Event Tree Framework.

It is difficult to assess the consequences of a transient in a sodium-cooled fast reactor (SFR) using traditional probabilistic risk assessment (PRA) methods, as numerous safety-related sys- tems have passive characteristics. Often there is significant dependence on the value of con- tinuous stochastic parameters rather than binary success/failure determinations. One form of dynamic PRA uses a system simulator to represent the progression of a transient, tracking events through time in a discrete dynamic event tree (DDET). In order to function in a DDET environment, a simulator must have characteristics that make it amenable to changing physical parameters midway through the analysis. The SAS4A SFR system analysis code did not have these characteristics as received. This report describes the code modifications made to allow dynamic operation as well as the linking to a Sandia DDET driver code. A test case is briefly described to demonstrate the utility of the changes.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

A WENO-solver combined with adaptive momentum discretization for the Wigner transport equation and its application to resonant tunneling diodes

We present a novel numerical scheme for the deterministic solution of the Wigner transport equation, especially suited to deal with situations in which strong quantum effects are present. The unique feature of the algorithm is the expansion of the Wigner function in local basis functions, similar to finite element or finite volume methods. This procedure yields a discretization of the pseudo-differential operator that conserves the particle density on arbitrarily chosen grids. The high flexibility in refining the grid spacing together with the weighted essentially non-oscillatory (WENO) scheme for the advection term allows for an accurate and well-resolved simulation of the phase space dynamics. A resonant tunneling diode is considered as test case and a detailed convergence study is given by comparing the results to a non-equilibrium Green's functions calculation. The impact of the considered domain size and of the grid spacing is analyzed. The obtained convergence of the results towards a quasi-exact agreement of the steady state Wigner and Green's functions computations demonstrates the accuracy of the scheme, as well as the high flexibility to adjust to different physical situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling Predictive Simulation and UQ of Complex Multiphysics PDE Systems by the Development of Goal-Oriented Variational Sensitivity Analysis and a-Posteriori Error Estimation Methods

This project addressed the challenge of predictive computational analysis of strongly coupled, highly nonlinear multiphysics systems characterized by multiple physical phenomena that span a large range of length- and time-scales. Specifically, the project was focused on computational estimation of numerical error and sensitivity analysis of computational solutions with respect to variations in parameters and data. In addition, the project investigated the use of accurate computational estimates to guide efficient adaptive discretization. The project developed, analyzed and evaluated new variational adjoint-based techniques for integration, model, and data error estimation/control and sensitivity analysis, in evolutionary multiphysics multiscale simulations.

97 MATHEMATICS AND COMPUTING↗

A hybrid adaptive multiresolution approach for the efficient simulation of reactive flows

Computational studies that use block-structured adaptive mesh refinement (AMR) approaches suffer from unnecessarily high mesh resolution in regions adjacent to important solution features. This deficiency limits the performance of AMR codes. In this work a novel hybrid adaptive multiresolution (HAMR) approach to AMR-based calculations is introduced to address this issue. The multiresolution (MR) smoothness indicators are used to identify regions of smoothness on the mesh where the computational cost of individual physics solvers may be decreased by replacing direct calculations with interpolation. We suggest an approach to balance the errors due to the adaptive discretization and the interpolation of physics quantities such that the overall accuracy of the HAMR solution is consistent with that of the MR-driven AMR solution. The performance of the HAMR scheme is evaluated for a range of test problems, from pure hydrodynamics to turbulent combustion.

97 MATHEMATICS AND COMPUTING↗

TH-C-BRD-09: Successes and Limitations of Online Range Adaptive Spot Scanning Proton Therapy for NSCLC

Purpose: To determine the ability to adapt discrete spot-scanning proton therapy (SSPT) plans based on geometric changes of anatomy to minimize normal tissue dose and maintain target coverage. Methods: We developed and tested a range-correction algorithm to compensate for anatomy changes in SSPT with correction factors for target lateral size changes and energy scaling. This algorithm adjusts the energy of each spot from the original optimized treatment plan to match the new daily anatomy based on water equivalent path-length. To correct for the lateral target size changes, the peripheral spots were scaled based on phantom studies with variable target size. For energy change corrections, alternative cumulative scaling factor lookup tables were generated based on calculated central-axis and integral depth dose calculations for different energies. These various adaptive algorithms were performed on 7 lung cancer patients that were previously treated with proton therapy and who required at least one adaptive intervention. Single-field optimized SSPT plans were generated for these patients with clinical beam angles. Dose-volume histogram metrics were obtained for these patients for both the non-adaptive and the different adaptive plans applied to the last available weekly CT scan. Results: The doses to normal tissue were largely reduced for the spinal cord (Dmax), total lung (V20Gy), and contralateral lung (V20Gy) for all different methods of adaptive planning. With both corrections applied, the average changes for these metrics were −6.2Gy, −2.7%, and −4.9%, respectively. The same method generated unacceptably high target hot spots with average target V110% increase of 12.3%. Conclusion: Adaptive methods based on direct adjustments to proton range can reduce normal tissue doses under large anatomical changes but are insufficient in achieving clinically acceptable target doses and generate unacceptably sizeable hot spots. Adaptive planning methods for proton therapy will likely necessitate some aspect of reoptimization for acceptable clinical utility.

60 APPLIED LIFE SCIENCES↗

Discontinuous Galerkin gradient discretisations for the approximation of second-order differential operators in divergence form

We include in the gradient discretisation method (GDM) framework two numerical schemes based on discontinuous Galerkin approximations: the symmetric interior penalty Galerkin (SIPG) method, and the scheme obtained by averaging the jumps in the SIPG method. We prove that these schemes meet the main mathematical gradient discretisation properties on any kind of polytopal mesh, by adapting discrete functional analysis properties to our precise geometrical hypotheses. Therefore, these schemes inherit the general convergence properties of the GDM, which hold for instance in the cases of the p-Laplace problem and of the anisotropic and heterogeneous diffusion problem. This is illustrated by simple 1D and 2D numerical examples.

97 MATHEMATICS AND COMPUTING↗

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗

Quantum partition functions of composite particles in a hydrogen-helium plasma via path integral Monte Carlo

We compute two- and three-body cluster functions that describe contributions of composite entities, like hydrogen atoms, ions H{sup −}, H{sub 2}{sup +}, and helium atoms, and also charge-charge and atom-charge interactions, to the equation of state of a hydrogen-helium mixture at low density. A cluster function has the structure of a truncated virial coefficient and behaves, at low temperatures, like a usual partition function for the composite entity. Our path integral Monte Carlo calculations use importance sampling to sample efficiently the cluster partition functions even at low temperatures where bound state contributions dominate. We also employ a new and efficient adaptive discretization scheme that allows one not only to eliminate Coulomb divergencies in discretized path integrals, but also to direct the computational effort where particles are close and thus strongly interacting. The numerical results for the two-body function agree with the analytically known quantum second virial coefficient. The three-body cluster functions are compared at low temperatures with familiar partition functions for composite entities.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PHURBAS: AN ADAPTIVE, LAGRANGIAN, MESHLESS, MAGNETOHYDRODYNAMICS CODE. I. ALGORITHM

We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. Local, third-order, least-squares, polynomial interpolations (Moving Least Squares interpolations) are calculated from the field values of neighboring particles to obtain field values and spatial derivatives at the particle position. Field values and particle positions are advanced in time with a second-order predictor-corrector scheme. The particles move with the fluid, so the time step is not limited by the Eulerian Courant-Friedrichs-Lewy condition. Full spatial adaptivity is implemented to ensure the particles fill the computational volume, which gives the algorithm substantial flexibility and power. A target resolution is specified for each point in space, with particles being added and deleted as needed to meet this target. Particle addition and deletion is based on a local void and clump detection algorithm. Dynamic artificial viscosity fields provide stability to the integration. The resulting algorithm provides a robust solution for modeling flows that require Lagrangian or adaptive discretizations to resolve. This paper derives and documents the Phurbas algorithm as implemented in Phurbas version 1.1. A following paper presents the implementation and test problem results.

79 ASTRONOMY AND ASTROPHYSICS↗

A Posteriori Analysis of Adaptive Multiscale Operator Decomposition Methods for Multiphysics Problems

This project was concerned with the accurate computational error estimation for numerical solutions of multiphysics, multiscale systems that couple different physical processes acting across a large range of scales relevant to the interests of the DOE. Multiscale, multiphysics models are characterized by intimate interactions between different physics across a wide range of scales. This poses significant computational challenges addressed by the proposal, including: (1) Accurate and efficient computation; (2) Complex stability; and (3) Linking different physics. The research in this project focused on Multiscale Operator Decomposition methods for solving multiphysics problems. The general approach is to decompose a multiphysics problem into components involving simpler physics over a relatively limited range of scales, and then to seek the solution of the entire system through some sort of iterative procedure involving solutions of the individual components. MOD is a very widely used technique for solving multiphysics, multiscale problems; it is heavily used throughout the DOE computational landscape. This project made a major advance in the analysis of the solution of multiscale, multiphysics problems.

97 MATHEMATICS AND COMPUTING↗

A Simulation Modeling Approach to Optimizing Nuclear Waste Dispositioning

The dispositioning of nuclear waste generated at facilities across the country is an ongoing battle that affects us all. National laboratories and research centers dealing in medical research, clean energy, and other nuclear activities such as the Department of Energy (DOE) facilities face the need to properly manage and dispose of nuclear waste. A dynamic modeling solution would enable the DOE and others to make decisions on waste disposal and technological options. In doing so, this research explores modeling techniques using available data to address these situations. The focus being on developing an initial robust and adaptable discrete event model using the ExtendSim tool. This modeling effort will target the dispositioning of transuranic waste at the Savannah River National Laboratory (SRNL) which can be expanded to represent the current state of disposition process for waste generated at other DOE facilities. The model aims to assess resource allocation and waste processing options to stabilize productivity and cut the backlog of nuclear waste. By assessing the results of different scenarios, this research aims to provide actionable insights for the DOE. This approach has the potential to significantly improve the management of radioactive waste, offering the capability of evaluating options for optimizing the process for nuclear waste disposal. The findings of this study can serve as a valuable resource for decision-makers and other national laboratories, or research entities engaged in nuclear operations by enabling them to make more informed choices.

Andaverde, Alexis↗

ASGarD: Adaptive Sparse Grid Discretization

Many areas of science exhibit physical processes that are described by high dimensional partial differential equations (PDEs), e.g., the 4D, 5D and 6D models describing magnetized fusion plasmas, models describing quantum chemistry, or derivatives pricing. Such problems are affected by the so-called “curse of dimensionality” where the number of degrees of freedom (or unknowns) required to be solved for scales as N D where N is the number of grid points in any given dimension D. A simple, albeit naive, 6D example is demonstrated in the left panel of Figure 1. With N = 1000 grid points in each dimension, the memory required just to store the solution vector, not to mention forming the matrix required to advance such a system in time, would exceed an exabyte - and also the available memory on the largest of supercomputers available today. The right panel of Figure 1 demonstrates potential savings for a range of problem dimensionalities and grid resolution. While there are methods to simulate such high-dimensional systems, they are mostly based on Monte-Carlo methods, which rely on a statistical sampling such that the resulting solutions include noise. Since the noise in such methods can only be reduced at a rate proportional to $\sqrt{N_p}$ where N p is the number of Monte-Carlo samples, there is a need for continuum, or grid/mesh-based methods for high-dimensional problems, which both do not suffer from noise and bypass the curse of dimensionality. We present a simulation framework that provides such a method using adaptive sparse grids.

97 MATHEMATICS AND COMPUTING↗

Adaptive Sparse Grid Discretization (ASGarD)

This code solves the Vlasov-Poisson equations in 6-dimensions without approximation. It uses sparse grid discretization to solve the high-dimensional PDEs. The code functions as a discontinuous Galerkin finite element solver. Advantages/benefits include no approximations, supports high-dimensionality, leadership-scale capability, and implicit time advance.

Hahn, Steven [Oak Ridge National Laboratory (ORNL)↗