Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scalar Field Data”

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

Uncertainty-Informed Volume Visualization using Implicit Neural Representation

The increasing adoption of Deep Neural Networks (DNNs) has led to their application in many challenging scientific visualization tasks. While advanced DNNs offer impressive generalization capabilities, understanding factors such as model prediction quality, robustness, and uncertainty is crucial. These insights can enable domain scientists to make informed decisions about their data. However, DNNs inherently lack ability to estimate prediction uncertainty, necessitating new research to construct robust uncertainty-aware visualization techniques tailored for various visualization tasks. In this work, we propose uncertainty-aware implicit neural representations to model scalar field data sets effectively and comprehensively study the efficacy and benefits of estimated uncertainty information for volume visualization tasks. We evaluate the effectiveness of two principled deep uncertainty estimation techniques: (1) Deep Ensemble and (2) Monte Carlo Dropout (MC-Dropout). These techniques enable uncertainty-informed volume visualization in scalar field data sets. Our extensive exploration across multiple data sets demonstrates that uncertainty-aware models produce informative volume visualization results. Moreover, integrating prediction uncertainty enhances the trustworthiness of our DNN model, making it suitable for robustly analyzing and visualizing real-world scientific volumetric data sets.

Saklani, Shanu↗

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗

AMM: Adaptive Multilinear Meshes

Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data. Usual solutions are designed broadly along two themes: reducing data precision, e.g., through compression, or adapting data resolution, e.g., using spatial hierarchies. Additionally, recent research suggests that combining the two approaches, i.e., adapting both resolution and precision simultaneously, can offer significant gains over using them individually. However, there currently exist no practical solutions to creating and evaluating such representations at scale. In this work, we present a new resolution-precision-adaptive representation to support hybrid data reduction schemes and offer an interface to existing tools and algorithms. Through novelties in spatial hierarchy, our representation, Adaptive Multilinear Meshes (AMM), provides considerable reduction in the mesh size. AMM creates a piecewise multilinear representation of uniformly sampled scalar data and can selectively relax or enforce constraints on conformity, continuity, and coverage, delivering a flexible adaptive representation. AMM also supports representing the function using mixed-precision values to further the achievable gains in data reduction. We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams. By interfacing with state-of-the-art rendering tools through VTK, we demonstrate the practical and computational advantages of our representation for visualization techniques. With an open-source release of our tool to create AMM, we make such evaluation of data reduction accessible to the community, which we hope will foster new opportunities and future data reduction schemes.

97 MATHEMATICS AND COMPUTING↗

Towards replacing physical testing of granular materials with a Topology-based Model

In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. Here, we provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.

36 MATERIALS SCIENCE↗

Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization

In topological data analysis and visualization, topological descriptors such as persistence diagrams, merge trees, contour trees, Reeb graphs, and Morse–Smale complexes play an essential role in capturing the shape of scalar field data. Herein we present a state–of–the–art report on scalar field comparison using topological descriptors. We provide a taxonomy of existing approaches based on visualization tasks associated with three categories of data: single fields, time–varying fields, and ensembles. These tasks include symmetry detection, periodicity detection, key event/feature detection, feature tracking, clustering, and structure statistics. Our main contributions include the formulation of a set of desirable mathematical and computational properties of comparative measures, and the classification of visualization tasks and applications that are enabled by these measures.

97 MATHEMATICS AND COMPUTING↗

Exploiting Colorimetry for Fidelity in Data Visualization

Advances in multimodal characterization methods fuel the generation of increasing immense hyper-dimensional data sets. Color mapping is employed for conveying higher dimensional data in two-dimensional (2D) representations for human consumption without relying on multiple projections. How one constructs these color maps, however, critically affects how accurately one perceives data. For simple scalar fields, perceptually uniform color maps and color selection have been shown to improve data readability and interpretation across research fields. In this work, we review core concepts underlying the design of perceptually uniform color maps and extend the concepts from scalar fields to two-dimensional vector fields and three-component composition fields frequently found in materials-chemistry research to enable high-fidelity visualization. Additionally, we develop the software tools PAPUC and CMPUC to enable researchers to utilize these colorimetry principles and employ perceptually uniform color spaces for rigorously meaningful color mapping of higher dimensional data representations. Last, we demonstrate how these approaches deliver immediate improvements in data readability and interpretation in microscopies and spectroscopies routinely used in discerning materials structure, chemistry, and properties.

36 MATERIALS SCIENCE↗

Oscillating scalar fields and the Hubble tension: A resolution with novel signatures

Here, we present a detailed investigation of a subdominant oscillating scalar field [“early dark energy” (EDE)] in the context of resolving the Hubble tension. Consistent with earlier work, but without relying on fluid approximations, we find that a scalar field frozen due to Hubble friction until log 10 ($z_c$) ~ 3.5, reaching $ρ_{\text{EDE}}(z_c)/ρ_{\text{tot}}$ ~ 10 % and diluting faster than matter afterwards, can bring cosmic microwave background (CMB), baryonic acoustic oscillations, supernovae luminosity distances, and the late-time estimate of the Hubble constant from the SH0ES Collaboration into agreement. A scalar field potential that scales as $V (\phi) \propto \phi ^{2n}$ with 2 ≲ $\textit{n}$ ≲ 3.4 around the minimum is preferred at the 68% confidence level, and the Planck polarization places additional constraints on the dynamics of perturbations in the scalar field. In particular, the data prefer a potential that flattens at large field displacements. A Markov-chain Monte Carlo analysis of mock data shows that the next-generation CMB observations (i.e., CMB-S4) can unambiguously detect the presence of the EDE at a very high significance. This projected sensitivity to the EDE dynamics is mainly driven by improved measurements of the E-mode polarization. We also explore new observational signatures of EDE scalar field dynamics: (i) We find that depending on the strength of the tensor-to-scalar ratio, the presence of the EDE might imply the existence of isocurvature perturbations in the CMB. (ii) We show that a strikingly rapid, scale-dependent growth of EDE field perturbations can result from parametric resonance driven by the anharmonic oscillating field for $\textit{n}$ ≈ 2. This instability and ensuing potentially nonlinear, spatially inhomogeneous, dynamics may provide unique signatures of this scenario.

79 ASTRONOMY AND ASTROPHYSICS↗

A Practical Solver for Scalar Data Topological Simplification

This paper presents a practical approach for the optimization of topological simplification, a central pre-processing step for the analysis and visualization of scalar data. Given an input scalar field f and a set of “signal” persistence pairs to maintain, our approaches produces an output field g that is close to f and which optimizes (i) the cancellation of “non-signal” pairs, while (ii) preserving the “signal” pairs. In contrast to pre-existing simplification algorithms, our approach is not restricted to persistence pairs involving extrema and can thus address a larger class of topological features, in particular saddle pairs in three-dimensional scalar data. Our approach leverages recent generic persistence optimization frameworks and extends them with tailored accelerations specific to the problem of topological simplification. Extensive experiments report substantial accelerations over these frameworks, thereby making topological simplification optimization practical for real-life datasets. Our approach enables a direct visualization and analysis of the topologically simplified data, e.g., via isosurfaces of simplified topology (fewer components and handles). We apply our approach to the extraction of prominent filament structures in three-dimensional data. Specifically, we show that our pre-simplification of the data leads to practical improvements over standard topological techniques for removing filament loops. Here, we also show how our approach can be used to repair genus defects in surface processing. Finally, we provide a C++ implementation for reproducibility purposes.

97 MATHEMATICS AND COMPUTING↗

Quantifying scalar field dynamics with DESI 2024 Y1 BAO measurements

Quintessence scalar fields are a natural candidate for evolving dark energy. Unlike the phenomenological w 0 ⁢w a parameterization of the dark energy equation of state, they cannot accommodate the phantom regime of dark energy w⁡(z) <–1, or crossings into the phantom regime. Recent baryon acoustic oscillation (BAO) measurements by the Dark Energy Spectroscopic Instrument (DESI) indicate a preference for evolving dark energy over a cosmological constant, ranging from 2.6⁢σ –3.9⁢σ when fitting to w 0⁢ w a , and combining the DESI BAO measurements with other cosmological probes. In this work, we directly fit three simple scalar field models to the DESI BAO data, combined with cosmic microwave background anisotropy measurements and supernova datasets. We find the best fit model to include a 2–4% kinetic scalar field energy Ω scf,k , for a canonical scalar field with a quadratic or linear potential. However, only the DESY-Y5 supernova dataset combination shows a preference for quintessence over Λ cold dark matter (CDM) at the 95% confidence level. Fitting to the supernova datasets Pantheon, Pantheon+, DES-Y5, and Union3, we show that the mild tension (n σ < 3.4) under Λ ⁢CDM emerges from a BAO preference for smaller values of fractional mass-energy density Ω m < 0.29, while all supernova datasets, except for Pantheon, prefer larger values, Ω m > 0.3. The tension under Λ ⁢CDM remains noticeable (n σ < 2.8), when replacing two of the DESI BAO redshift bins with effective redshifts z eff = 0.51, and z eff = 0.706 with comparable BOSS DR 12 BAO measurements at z eff = 0.51, and z eff = 0.61. Furthermore, canonical scalar fields as dark energy are successful in mitigating that tension.

79 ASTRONOMY AND ASTROPHYSICS↗

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using highperformance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. Finally, we evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization.

97 MATHEMATICS AND COMPUTING↗

Dark matter trigger for early dark energy coincidence

Current cosmological measurements present a persistent tension in the value of the current cosmic expansion rate, the Hubble constant, as inferred from cosmic microwave background (CMB) and large-scale structure (LSS) data compared to that inferred from the classical distance ladder. Early dark energy (EDE), whose cosmological role is localized in time around the epoch of matter-radiation equality just prior to the release of the CMB photons, is designed to resolve this "Hubble tension". However, the model introduces a new coincidence problem: Why should the EDE dynamics occur near matter-radiation equality if EDE is decoupled from both matter and radiation? The resolution of this problem may lie in an early dark sector (EDS), wherein the dark matter mass is dependent on the EDE scalar field. In this work, we construct such an EDS model and show that it naturally resolves the EDE coincidence problem at the background level without any fine-tuning of the coupling to dark matter or of the initial conditions. When fitting to current cosmological data, including that from the local distance ladder, CMB, and LSS, our EDS maximum-likelihood model performs comparably to EDE for resolving the Hubble tension. However, fitting the Planck CMB data requires a specific range of initial field positions to balance the scalar field fluctuations that drive acoustic oscillations, providing testable differences with other EDE models and a platform for future model-building.

79 ASTRONOMY AND ASTROPHYSICS↗

Searching for parity violation in SDSS DR16 Lyman-α forest data

The four-point correlation function is the lowest order correlation function for scalar fields that can be used to probe statistical parity invariance in an isotropic universe. There are intriguing claims of detection of parity violation in the 4-point function of BOSS galaxy clustering data. We apply the same estimator to the public SDSS Data Release 16 Lyman-α forest data. Lyman-α forest data probes a different redshift range and is sensitive to a different density regime using a completely different technique. A detection would therefore be a strong indication of new physics. We identify an accurate covariance matrix as a crucial impediment to performing this measurement accurately, consistent with existing literature on galaxy 4-point function. Here, we discuss several approaches to estimating the covariance matrix, several of which produce spurious detection. Using a robust, but very suboptimal, covariance matrix derived from subsample bootstrapping, we find no evidence for parity violation.

79 ASTRONOMY AND ASTROPHYSICS↗

Reconstructing quintessence

We present an Effective Field Theory based reconstruction of quintessence models of dark energy directly from cosmological data. We show that current cosmological data possess enough constraining power to test several quintessence model properties for redshifts z ϵ [0, 1.5] with no assumptions about the behavior of the scalar field potential. We use measurements of the cosmic microwave background, supernovae distances, and the clustering and lensing of galaxies to constrain the evolution of the dark energy equation of state, Swampland Conjectures, the shape of the scalar field reconstructed potential, and the structure of its phase space. The standard cosmological model still remains favored by data and, within quintessence models, deviations from its expansion history are bounded to be below the 10% level at 95% confidence at any redshift below z = 1.5.

79 ASTRONOMY AND ASTROPHYSICS↗

The cosmology of ultralight scalar dark matter coupled to right-handed neutrinos

We consider ultralight scalar dark matter that couples to right-handed neutrinos. Due to the high density of neutrinos in the early universe, the background neutrino density dominates the dynamics of the scalar field, and qualitatively alters the field’s cosmological evolution. This effect has not been included in previous literature, and changes the interpretation of cosmological data and its interplay with laboratory experiments. To illustrate these points a simplified model of a 1 + 1 setup with a single scalar field is analyzed.

Cosmology of Theories BSM↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

Testing Scale-Dependent Modified Gravity with DESI DR1

The Dark Energy Spectroscopic Instrument (DESI) provides an unprecedented opportunity to test deviations from general relativity (GR) that introduce a new physical scale within its redshift range. Using the connection between a Yukawa-like potential and the Hu-Sawicki $f(R)$ model, we place strong constraints on the range of a hypothetical fifth force mediated by a massive scalar field. We analyze the power spectrum measurements from DESI Data Release 1 using a baseline EFT model that employs the fkpt approach for the loop integrals. We find no evidence for deviations from GR and obtain the constraint $\log_{10} |f_{R_0}| < -4.59$ (95% C.L.). This corresponds to an upper bound at redshift zero on the scale at which corrections to GR become important, $λ< 17.81$ Mpc, or equivalently, a lower bound on the mass of the additional gravitational mediator of $m_ϕ> 3.60 \times 10^{-31}$ eV. We find that the modified gravity parameter $f_{R_0}$ is largely orthogonal to the cosmological parameters in the model, such that no additional projection effects relative to the GR case are introduced in this Full-Shape analysis. Furthermore, a second modified gravity parameter, the power index $n$, which modulates the time-variation of the associated mass, is found to be consistent with previous analyses that fixed it to unity. Adding DESI BAO data or other cosmological probes does not significantly change these results. The conclusions remain similar if the background evolution is described by evolving dark energy instead of a cosmological constant. Additionally, we test the robustness of the baseline model by varying the maximum wavenumber used in the Full-Shape analysis and analyzing the DESI targets separately. Finally, we analyze the degeneracies between the modified-gravity parameters and the sum of neutrino masses.

Gonzalez, D. [Guanajuato U.; UNAM, CCF] (ORCID:000↗