Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit methods”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

ESMs Latent Space Exploration for Uncertainty Quantification and Spatiotemporal Downscaling

This final report for DOE Award DE-SC0023044 presents advances in two key areas of climate modeling: (1) representative climate model selection and (2) Earth System Model (ESM) downscaling using hybrid AI methods. The first section introduces a reordered, three-stage workflow to select representative GCM runs that more effectively balance historical skill with ensemble spread, validated across Texas, Bihar, and New York. The second section introduces two novel super-resolution frameworks, ViSIR and ViFOR, that integrate Vision Transformers with sinusoidal and Fourier-based implicit neural representations. These models achieve state-of-the-art reconstruction accuracy for ESM variables including surface temperature and heat fluxes. The report includes detailed methodology, benchmarks, and results, demonstrating significant gains in uncertainty quantification, spatial fidelity, and scalability for climate-impact studies.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Beyond Single-Reference Fixed-Node Approximation in Ab Initio Diffusion Monte Carlo Using Antisymmetrized Geminal Power Applied to Systems with Hundreds of Electrons

Diffusion Monte Carlo (DMC) is an exact technique to project out the ground state (GS) of a Hamiltonian. Since the GS is always bosonic, in Fermionic systems, the projection needs to be carried out while imposing antisymmetric constraints, which is a nondeterministic polynomial hard problem. In practice, therefore, the application of DMC on electronic structure problems is made by employing the fixed-node (FN) approximation, consisting of performing DMC with the constraint of having a fixed, predefined nodal surface. How do we get the nodal surface? The typical approach, applied in systems having up to hundreds or even thousands of electrons, is to obtain the nodal surface from a preliminary mean-field approach (typically, a density functional theory calculation) used to obtain a single Slater determinant. This is known as single reference. In this paper, we propose a new approach, applicable to systems as large as the C 60 fullerene, which improves the nodes by going beyond the single reference. In practice, we employ an implicitly multireference ansatz (antisymmetrized geminal power wave function constraint with molecular orbitals), initialized on the preliminary mean-field approach, which is relaxed by optimizing a few parameters of the wave function determining the nodal surface by minimizing the FN-DMC energy. We highlight the improvements of the proposed approach over the standard single-reference method on several examples and, where feasible, the computational gain over the standard multireference ansatz, which makes the methods applicable to large systems. We also show that physical properties relying on relative energies, such as binding energies, are affordable and reliable within the proposed scheme.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗
DOE OSTI2026

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗
DOE OSTI2026

Verification of an energy-conserving semi-implicit electrostatic particle-in-cell scheme for modeling high-density plasma at scale

A verification study of a semi-implicit energy-conserving electrostatic particle-in-cell algorithm is presented. The algorithm relaxes the time-step and mesh-size constraints that require resolution of the plasma period and Debye length associated with traditional explicit momentum-conserving particle-in-cell algorithms. Physical implications and applicability of using the semi-implicit scheme for modeling high-density plasmas are discussed. Where possible, numerical results are compared against analytical solutions. The simulation results indicate that the algorithm is stable at time steps larger than twice the inverse plasma frequency and cell sizes larger than the Debye length. It is found that the algorithm gives adequate results, provided that the distribution function and the spatiotemporal scales dictating the physics of the problem are resolved. As such, the algorithm may provide a robust method for kinetic modeling of high-density plasmas at scale.

Cyclotron resonance↗
DOE OSTI2026

Regularizing INR with Diffusion Prior for Self-Supervised 3D Reconstruction OF Neutron Computed Tomography Data

Recently, generative diffusion priors have made huge strides as inverse problem solvers, including the ability to be adapted for inference on out-of-distribution data. Concurrently, implicit neural representations (INRs) have emerged as fast and lightweight inverse imaging solvers that are amenable to hybrid approaches that combine learned priors with traditional inverse problem formulations. In this paper, we present a diffusive computed tomography (CT) inversion framework for regularizing INRs called Diffusive INR (DINR), designed to enable high-quality reconstruction from sparse-view neutron CT. Pretrained purely on synthetic data, DINR is evaluated on simulated and experimentally obtained observations of concrete microstructures, where traditional reconstruction methods suffer substantial degradation when the number of views is reduced. Our approach delivers superior performance, reduces reconstruction artifacts, and achieves gains in PSNR and SSIM, enabling accurate micro-structural characterization even under extreme data limitations compared to state-of-the-art sparse-view reconstruction techniques.

Hossain, Maliha [ORNL]↗
DOE OSTI2026

Augmenting Molecular Graphs with Geometries via Machine Learning Interatomic Potentials

Accurate molecular property predictions require 3D geometries, which are typically obtained using expensive methods such as density functional theory (DFT). Here, we attempt to obtain molecular geometries by relying solely on machine learning interatomic potential (MLIP) models. To this end, we first curate a large-scale molecular relaxation dataset comprising 3.5 million molecules and 300 million snapshots. Then MLIP pre-trained models are trained with supervised learning to predict energy and forces given 3D molecular structures. Once trained, we show that the pre-trained models can be used in different ways to obtain geometries either explicitly or implicitly. First, it can be used to obtain approximate low-energy 3D geometries via geometry optimization. While these geometries do not consistently reach DFT-level chemical accuracy or convergence, they can still improve downstream performance compared to non-relaxed structures. To mitigate potential biases and enhance downstream predictions, we introduce geometry fine-tuning based on the relaxed 3D geometries. Second, the pre-trained models can be directly fine-tuned for property prediction when ground truth 3D geometries are available. Our results demonstrate that MLIP pre-trained models trained on relaxation data can learn transferable molecular representations to improve downstream molecular property prediction and can provide practically valuable but approximate molecular geometries that benefit property predictions. Our code is publicly available at: https://github.com/divelab/AIRS/.

Fu, Cong [Texas A & M Univ., College Station, TX (↗
DOE OSTI2024

A robust spectral element implementation of the $k - τ$ RANS model in Nek5000/NekRS

The $k - ω$ Reynolds Averaged Navier Stokes (RANS) model is one of the industry standard approaches for modeling of turbulent flows. It performs better than the $k - ϵ$ model for low Reynolds number flows and is also more suitable for boundary layers with adverse pressure gradients. Major drawback of the model, however, is that the asymptotic value of $ω$ at the walls is singular, necessitating the use of a contrived “sufficiently” large value for $ω$ as the boundary condition for its transport equation. Here, this invariably leads to the solution being sensitive to near wall grid spacing. While an acceptable solution for low order (finite volume) methods, the excessive near wall gradients lead to persistent numerical stability issues in high order codes. To alleviate the problem, specifically in the context of the high order spectral element code Nek5000, a regularized $k - ω$ approach was formulated in our prior work (Tomboulides et al., 2018). The formulation, however, relies on the use of wall distance and its gradients for modeling the closure terms and can pose problems for simulations in complex geometries. This work presents a novel implementation of the $k - τ$ RANS model in Nek5000, where $τ = 1/ω$, eliminating the need for regularization, owing to the asymptotically bounded behavior of the source terms in the $τ$ transport equation, and also eliminating dependence on wall distance. Robustness and stability of the $k - τ$ model is ensured through implicit treatment of the source terms and their careful numerical implementation and demonstrated through several cases aimed at verification and validation. Studies include both canonical and engineering relevant problems, viz., turbulent channel flow, pipe flow, backward facing step, flow over NACA 0012 airfoil and flow in a T-junction. Results from the $k - τ$ model are shown to be consistent with regularized $k - ω$ model and also with the $k - ω$ SST model in OpenFOAM (for select studies). Comparison with experimental data is also shown, where available, to bolster validation efforts for the $k - τ$ model implementation through prediction of key turbulent quantities of interest.

Nek5000↗
DOE OSTI2026

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗
DOE OSTI2024

Pressure stability in explicitly coupled simulations of poromechanics with application to CO 2 sequestration

We study in detail the pressure stabilizing effects of the non-iterated fixed-stress splitting in poromechanical problems which are nearly undrained and incompressible. When applied in conjunction with a spatial discretization which does not satisfy the discrete inf–sup condition, namely a mixed piecewise linear–piecewise constant spatial discretization, the explicit fixed-stress scheme can have a pressure stabilizing effect in transient problems. This effect disappears, however, upon time step refinement or the attainment of steady state. The interpretation of the scheme as an Augmented Lagrangian method similar to Uzawa iteration for incompressible flow helps explain these results. Moreover, due to the slowly evolving solution within undrained seal regions, we show that the explicit fixed-stress scheme requires very large time steps to reveal its pressure stabilizing effect in examples of geologic CO 2 sequestration. We note that large time steps can result in large errors in drained regions, such as the aquifer or reservoir regions of these examples, and can prevent convergence of nonlinear solvers in the case of multiphase flows, which can make the explicit scheme an unreliable source of pressure stabilization. We conclude by demonstrating that pressure jump stabilization is as effective in the explicit fixed-stress setting as in the fully implicit setting for undrained problems, while maintaining the stability and convergence of the fixed-stress split for drained problems.

58 GEOSCIENCES↗
DOE OSTI2025

QM Investigation of Rare Earth Ion Interactions with First Hydration Shell Waters and Protein-Based Coordination Models

Here, conventional methods for extracting rare earth metals (REMs) from mined mineral ores are inefficient, expensive, and environmentally damaging. Recent discovery of lanmodulin (LanM), a protein that coordinates REMs with high-affinity and selectivity over competing ions, provides inspiration for new REM refinement methods. Here, we used quantum mechanical (QM) methods to investigate trivalent lanthanide cation (Ln 3+ ) interactions with coordination systems representing bulk solvent water and protein binding sites. Energy decomposition analysis (EDA) showed differences in the energetic components of Ln 3+ interaction with representatives of solvent (water, H 2 O) and protein binding sites (acetate, CH 3 COO – ), highlighting the importance of accurate description of electrostatics and polarization in computational modeling of REM interactions with biological and bioinspired molecules. Relative binding free energies were obtained for Ln 3+ with coordination complexes originating from binding sites in PDB structures of a lanthanum binding peptide (PDB entry 7CCO) and LanM, with explicit consideration of the first hydration shell waters, according to quasi-chemical theory (QCT). Beyond the first shell, the bulk solvent environment was represented with an implicit continuum model. Ln 3+ interactions with (H 2 O) 9 and both binding site models became more favorable, moving down the periodic series. This trend was more pronounced with the protein binding site models than with water, resulting in affinity increasing with periodic number, except for the last REM, Lu 3+ , which bound less favorably than the preceding element, Yb 3+ . Using the truncated 7CCO binding site model, the magnitude and trend of the experimental Ln 3+ relative binding free energies for the whole 7CCO peptide were reproduced. Conversely, the previously reported experimental data for LanM show a preference for the earlier lanthanides; this is likely due to longer-range interactions and cooperative effects, which are not represented by the reduced models. Using the truncated 7CCO binding site model, the magnitude and trend of the experimental Ln 3+ relative binding free energies for the whole 7CCO peptide were reproduced. In contrast to the previously reported experimental data for LanM, the peptide preferentially binds the earlier lanthanides. This difference likely arises due to longer-range interactions and cooperative effects not represented by the peptide. Further investigation of Ln 3+ interactions with whole proteins using polarizable molecular mechanics models with explicit solvent is warranted to understand the influence of longer-ranged interactions, cooperativity, and bulk solvent. Nevertheless, the present work provides new insights into Ln 3+ interactions with biomolecules and presents an effective computational platform for designing specific single-site REM binding peptides more efficiently.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Ground and excited state gradients with end-to-end differentiable semiempirical quantum chemistry

Accurate and efficient gradients of molecular energy with respect to nuclear degrees of freedom are essential for geometry optimization and molecular dynamics, including simulations that go beyond the Born–Oppenheimer regime. A common approach involves deriving analytical formulas for new electronic structure methods, which is often conceptually difficult and requires tedious coding. Here, we implement analytical, semi-numerical, and automatic differentiation (AD)-based gradient pathways for semiempirical Hamiltonian models in the PYSEQM software package, leveraging both graphics processing unit (GPU) and central processing unit (CPU) architectures. We further extend these capabilities to excited states calculated using the configuration interaction singles and time-dependent Hartree–Fock ansätze. We benchmark wall time, peak memory usage, and accuracy across three molecular families of varying chemical complexity, including systems of up to a thousand atoms. For ground-state simulations, analytical and AD gradients achieve near-identical GPU runtimes, while semi-numerical gradients are slower on GPU but remain competitive on CPU. For excited states, both analytical and custom AD approaches using implicit differentiation show similar performance and low memory requirements, whereas gradients with full AD are memory-limited. AD gradients match analytical ones in accuracy across all tested systems, aided by a quaternion-based diatomic frame rotation for two-center quantities that ensures smooth energy surfaces. Overall, automatic differentiation emerges as a practical alternative to analytical gradients in semiempirical quantum chemistry, offering high accuracy while allowing seamless integration in AI-driven workflows and popular packages, such as PyTorch and JAX. Our results provide actionable guidance for selecting optimal gradient strategies in large-scale ground- and excited-state molecular dynamics simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗
DOE OSTI2026

Langevin and Fokker-Planck analyses for diffusion-mediated passing of circular and discorectangular species in two-dimensional channels

The propensity for pairs of diffusing species to pass each other within narrow channels or pores is of basic interest as a first-passage-type problem. It is also of relevance for solution-phase transport in nanoporous materials, and in particular for catalytic conversion reactions where high yield requires that product species can efficiently pass reactant species to exit the pores. Here, we analyze a two-dimensional model with nonoverlapping circular and discorectangular species confined to a rectangular channel, and where passing is mediated by Brownian dynamics in an implicit solvent. For narrower channels where passing is still possible, the discorectangle must align with the channel to pass the circular species. Behavior of the passing propensity, 𝑃, can be assessed by strongly damped Langevin simulations, or within an equivalent Fokker-Planck equation (FPE) formalism. The latter corresponds to a diffusion problem in a “higher-dimensional channel” with a constriction. We assess the variation of the passing propensity, 𝑃, for a broad range of channel width including its scaling just above the threshold where passing is sterically blocked. Analysis of 𝑃 versus the rotational diffusion coefficient 𝐷 𝑟 of the discorectangle reveals a significant decrease in 𝑃 for lower 𝐷 𝑟 for moderate channel width. This prompts a direct analysis of the regime where 𝐷 𝑟 → 0 , for which the FPE can be reduced to a three-dimensional diffusion problem, precise analysis of which is facilitated by adaptive-mesh finite element methods. The dependence of 𝑃 on the aspect ratio of the discorectangle is also assessed.

Rahman, Md Khaledur [Ames Laboratory (AMES), Ames,↗
DOE OSTI2026

Structure-aware Initialization via Numerical Continuation and Informed Priors

Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.

Data integrity↗
DOE OSTI2025

16 O + 16 O fusion at sub-coulomb energies

A simple optical model (OPM) method using non-monotonic (NM) potentials characterized by a repulsive core from the microscopic theory of the Pauli-led energy-density functional (EDF) has been developed to investigate the 16 O + 16 O fusion at sub-Coulomb energies relevant to the oxygen burning. Here, the study involves the analysis of the experimental fusion cross-section (FCS) data in energy range 6.92 ≤ E cm ≤ 13.83 MeV, which includes the Coulomb barrier region E cm = 10.0–11.92 MeV. Apart from an excellent description of the existing FCS data in the studied energy range, the associated hindrance, characterized by the S-factor reaching a maximum and then gradually falling off at lower energies, so far suggested empirically for the system, is reproduced down to 4 MeV for the first time in the simple OPM. An S-factor maximum of S 0 = 3.15 × 10 25 MeV.b at E 0 = 7.14 MeV is observed with T ≃ 2.6 GK, which conforms to the values reported for quiescent and explosive burning. Our reaction rate, deduced from the NM potential, compares well with the Caughlan and Fowler data. Dominant partial waves implicit in the observed maximum S-factor in the studied Gamow range are also explored. Our present findings, with the success of NM potentials, suggest that the nucleus–nucleus potential is non-monotonic.

16O+16O↗
DOE OSTI2025

Optimising the processing and storage of visibilities using lossy compression

The next-generation radio astronomy instruments are providing a massive increase in sensitivity and coverage, largely through increasing the number of stations in the array and the frequency span sampled. The two primary problems encountered when processing the resultant avalanche of data are the need for abundant storage and the constraints imposed by I/O, as I/O bandwidths drop significantly on cold storage. An example of this is the data deluge expected from the SKA Telescopes of more than 60 PB per day, all to be stored on the buffer filesystem. While compressing the data is an obvious solution, the impacts on the final data products are hard to predict. In this paper, we chose an error-controlled compressor – MGARD – and applied it to simulated SKA-Mid and real pathfinder visibility data, in noise-free and noise-dominated regimes. As the data have an implicit error level in the system temperature, using an error bound in compression provides a natural metric for compression. MGARD ensures the compression incurred errors adhere to the user-prescribed tolerance. To measure the degradation of images reconstructed using the lossy compressed data, we proposed a list of diagnostic measures, exploring the trade-off between these error bounds and the corresponding compression ratios, as well as the impact on science quality derived from the lossy compressed data products through a series of experiments. We studied the global and local impacts on the output images for continuum and spectral line examples. We found relative error bounds of as much as 10%, which provide compression ratios of about 20, have a limited impact on the continuum imaging as the increased noise is less than the image RMS, whereas a 1% error bound (compression ratio of 8) introduces an increase in noise of about an order of magnitude less than the image RMS. For extremely sensitive observations and for very precious data, we would recommend a 0.1% error bound with compression ratios of about 4. These have noise impacts two orders of magnitude less than the image RMS levels. At these levels, the limits are due to instabilities in the deconvolution methods. We compared the results to the alternative compression tool DYSCO, in both the impacts on the images and in the relative flexibility. MGARD provides better compression for similar error bounds and has a host of potentially powerful additional features.

Techniques: interferometric↗