Search NASA⌕ Search

SEARCH · Search NASA

Results for “global refinement”

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 91 records · Page 5

Zooming in: SCREAM at 100 m using regional refinement over the San Francisco Bay Area

Pushing global climate models to large-eddy simulation (LES) scales over complex terrain has remained a major challenge. This study presents the first known implementation of a global model – SCREAM (Simple Cloud-Resolving E3SM Atmosphere Model) – at 100 m horizontal resolution using a regionally refined mesh (RRM) over the San Francisco Bay Area. Two hindcast simulations were conducted to test performance under both strong synoptic forcing and weak, boundary-layer-driven conditions. We demonstrate that SCREAM can stably run at LES scales while realistically capturing topography, surface heterogeneity, and coastal processes. The 100 m SCREAM-RRM substantially improves near-surface wind speed, temperature, humidity, and pressure biases compared to the baseline 3.25 km simulation, and better reproduces fine-scale wind oscillations and boundary-layer structures. These advances leverage SCREAM's scale-aware SHOC turbulence parameterization, which transitions smoothly across scales without tuning. Performance tests show that while CPU-only simulations remain costly, GPU acceleration with SCREAMv1 on NERSC's Perlmutter system enables two-day hindcasts to complete in under two wall-clock days. Our results open the door to LES-scale studies of orographic flows, boundary-layer turbulence, and coastal clouds within a fully comprehensive global modeling framework.

Geosciences↗

Spotlight: efficient automated global optimization in rietveld analysis of diffraction data

Performing reliable Rietveld analysis on tens or hundreds of powder diffraction datasets from parametric or time-resolved experiments often poses a bottleneck in extracting meaningful results from the data. While automated analysis of data has recently been demonstrated, high temperature annealing studies, during which phase transformations occur and lattice parameters may change due to repartitioning of elements, are prime examples where automation by a simple phase identification from a database of room temperature structures or automation by sequential refinements is likely to fail. To enable reliable, efficient, automated Rietveld analysis, we present a Python package named Spotlight , building on established Rietveld packages such as MAUD, GSAS , or GSAS-II , which extends the refinement of best fit parameters to a global optimization using an ensemble of optimizers leveraging hierarchical parallel execution on high-performance computing clusters. Spotlight further enables the efficient design of refinement plans through the iterative automated machine-learning of a surrogate for the refinement on which the global optimizations are performed until results from the surrogate converge to the response surface data. We demonstrate Spotlight with the analysis of uranium molybdenum and Ti–6Al–4V datasets, as well as in two open-source tutorials analyzing aluminium oxide and lead sulphate.

36 MATERIALS SCIENCE↗

A Comparative Assessment of Economic Model Predictive Control Strategies for Fuel Economy Optimization of Heavy-Duty Trucks

This paper provides a comparative assessment of three control strategies that fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC) in an effort to minimize fuel consumption for a heavy-duty truck. The online MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. Three candidate economic MPC formulations are evaluated: a time-based formulation that directly penalizes predicted fuel consumption, a simplified time-based formulation that penalizes braking effort in place of fuel consumption, and a distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity based on DP. The performance of each approach is presented for three representative route profiles, using a medium-fidelity proprietary Volvo model of the heavy-duty truck’s longitudinal dynamics. Results demonstrate 4-7% fuel economy improvement across all three formulations, when compared to a baseline strategy. Furthermore, we present a detailed analysis of energy usage by “type” (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control approach.

33 ADVANCED PROPULSION SYSTEMS↗

LandScan Mosaic

The LandScan program at Oak Ridge National Laboratory (ORNL), in collaboration with the National Geospatial-Intelligence Agency (NGA), continues to deliver the most accurate and up to date global, high resolution gridded population data. Additionally, the latest advancements in the LandScan HD methodology led to reduced latency in development of rapid updates for geopolitical events. With momentum towards reporting more up to date population estimates, feedback from the user community expressed interest in reporting population estimates in ranges - whether to express a level of uncertainty or confirm to leadership and stakeholders the modeled data are estimates. Building upon the need to understand uncertainty or confidence in the modeled data and report ranges at the global scale, LandScan Mosaic was developed. LandScan Mosaic represents the next generation of high-resolution population modeling, building upon the established success of previous LandScan HD iterations. While LandScan HD employed a deterministic big data fusion approach, LandScan Mosaic enhances this methodology by integrating advanced machine learning techniques to impute missing, yet crucial, population model parameters. This advancement allows for probabilistic modeling of building occupancy and population distribution, incorporating uncertainty quantification through Monte Carlo sampling methods. By combining big data fusion with machine learning-driven imputation and stochastic modeling, LandScan Mosaic provides a more comprehensive and robust representation of population dynamics. LandScan Mosaic will be following the in the footsteps of its longstanding counterpart LandScan Global and releasing a global gridded population raster, at the 3-arcsecond resolution. This technical report documents the current stage of development of LandScan Mosaic, detailing the methodologies and data sources behind the modeling. Stakeholders are encouraged to use this document as an authoritative reference for insight into Mosaic’s data development processes. However, readers should note that LandScan Mosaic remains in a late-stage research and development phase, and methodologies and data presented here are subject to refinements ahead of the anticipated global release in Summer 2025. Feedback and inquiries from users and stakeholders are welcomed as we continue to refine and enhance this important population resource.

97 MATHEMATICS AND COMPUTING↗

Assessing Adaptive Mesh Refinement (AMR) in a Forced Shallow-Water Model with Moisture

Two forced shallow-water flow scenarios are explored in a 2D fourth-order finite-volume dynamical core with adaptive mesh refinement (AMR) to investigate AMR’s ability to track and resolve complex evolving features. Traditional shallow-water test cases are mainly characterized by large-scale smooth flows that do not effectively test the multiscale abilities of variable-resolution and AMR models to resolve sharp gradients and small-scale flow filaments. Therefore, adding forcing mechanisms to the shallow-water system to model key atmospheric processes adds complexity and creates small-scale phenomena. These can serve as foci for dynamic grid refinement while remaining simple enough to study the numerical design of a model’s dynamical core. The first shallow-water flow scenario represents a strengthening, tropical cyclone–like, vortex that is driven by a Betts–Miller-like convection scheme. The second shallow-water test is built upon a barotropically unstable jet with an added Kessler-like warm rain scheme that leads to precipitating frontal zones. The key feature of both tests is that there is significant sensitivity to the model grid while converging (structurally) at high resolution. Both test cases are investigated for a series of uniform resolutions and a variety of AMR tagging criteria. The AMR simulations demonstrate that grid refinement can resolve local features without requiring global high-resolution meshes. However, the results are sensitive to the refinement criteria. Criteria that trigger refinement early in a simulation reproduce the uniform-resolution reference solutions most reliably. Finally, in contrast, AMR criteria that delay refinement for several days require careful tuning of the AMR thresholds to improve results compared with uniform-resolution simulations.

54 ENVIRONMENTAL SCIENCES↗

FACETS Dynamical Downscaling Simulations over North America by the CAM-MPAS Variable-Resolution Model

Comprehensive assessment of climate datasets created by statistical or dynamical models is important for effectively communicating model projection and associated uncertainty to stakeholders and decision-makers. The Department of Energy FACETS project aims to foster such communication through development of metrics and their demonstration on a hierarchy of downscaled climate datasets to quantify aspects of climate change projections that are credible, particularly for supporting decisions related to the energy-water-land nexus. As a part of this effort, we have produced a regional climate dataset using the Model for Prediction Across Scales coupled to the Community Atmosphere Model (CAM-MPAS). This global modeling framework is configured with variable-resolution meshes featuring higher resolutions over North America, as well as quasi-uniform resolution meshes across the globe. The variable-resolution configurations allow fine-scale features to be better resolved inside the refinement and interact with global-scale circulations. The dataset includes multiple uniform- (240km and 120km) and variable-resolution (200-50km, 100-25km, and 46-12km) simulations that are designed to be compatible with other regional climate simulations that contribute to the hierarchy of downscaled climate datasets of the project. Furthermore, the dataset consists of simulations for both the present-day (1989-2010) and future (2079-2100) climate and post-processing of the model output has been coordinated across the project for consistency to facilitate common analysis across the hierarchy of datasets. Altogether, this CAM-MPAS model dataset provides a unique opportunity to assess the influence of resolutions and modeling framework on model credibility and climate change projection.

Sakaguchi, Koichi↗

Evaluation of tropical channel refinement using MPAS‐A aquaplanet simulations

Abstract Climate models with variable‐resolution grids offer a computationally less expensive way to provide more detailed information and increased accuracy by resolving processes that cannot be adequately represented by a coarser grid. This study uses the Model for Prediction Across Scales‐Atmosphere (MPAS‐A), consisting of a nonhydrostatic dynamical core and a subset of Weather Research and Forecasting (WRF) model physics, to investigate the potential benefits of using tropical channel refinement. The simulations are performed with an idealized aquaplanet configuration using 30 and 240 km global grid spacing, and two variable‐resolution grids spanning the same grid spacing range; one with a narrow (20°S–20°N) and one with a wide (30°S–30°N) tropical channel refinement. Increasing resolution in the tropics impacts both the tropical and extratropical circulation. Compared to the 30 km global grid, both refined channel simulations exhibit slightly stronger updrafts inside the Hadley cell resulting in more resolved precipitation. Using a wider tropical refinement leads to a closer correspondence with the global high‐resolution grid. While different grid spacings produce similar cloud size distributions that are consistent with observations, the dependence of precipitation rate on cloud size varies among simulations. The refined channel simulations show improved tropical and extratropical precipitation relative to the global coarse simulation. All simulations show a single precipitation peak centered on the equator. Although the results show that tropical refinement is an effective method for avoiding artifacts due to grid resolution sensitivities seen in earlier studies that only refined a portion of the tropics, some biases remain well inside of the refinement region.

54 ENVIRONMENTAL SCIENCES↗

Economic Optimal Control for Minimizing Fuel Consumption of Heavy-Duty Trucks in a Highway Environment

This paper provides a comparative assessment of three economic optimal control strategies, aimed at minimizing the fuel consumption of heavy-duty trucks in a highway environment, under a representative lead vehicle model informed by traffic data. These strategies fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC). We then show how two of the three strategies can be adapted to accommodate the presence of traffic and optimally navigate signalized intersections using infrastructure-to-vehicular (I2V) communication. The MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. The three candidate economic MPC formulations that are evaluated include: a nonlinear time-based formulation that directly penalizes predicted fuel consumption, a nonlinear time-based formulation that penalizes braking effort as a surrogate for fuel consumption, and a linear distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity profile obtained from DP. Using a medium-fidelity Simulink model, based on a Volvo truck's longitudinal and engine dynamics, we analyze the optimization's performance on four highway routes under various traffic scenarios. Results demonstrate 3.7-8.3% fuel economy improvement on highway routes without traffic and 6.5-10% on the same routes with traffic included. Furthermore, we present a detailed analysis of energy usage by "type" (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control strategy.

33 ADVANCED PROPULSION SYSTEMS↗

Interpretation of Trace Gas Data Using Inverse Methods and Global Chemical Transport Models

This is a theoretical research project aimed at: (1) development, testing, and refining of inverse methods for determining regional and global transient source and sink strengths for long lived gases important in ozone depletion and climate forcing, (2) utilization of inverse methods to determine these source/sink strengths which use the NCAR/Boulder CCM2-T42 3-D model and a global 3-D Model for Atmospheric Transport and Chemistry (MATCH) which is based on analyzed observed wind fields (developed in collaboration by MIT and NCAR/Boulder), (3) determination of global (and perhaps regional) average hydroxyl radical concentrations using inverse methods with multiple titrating gases, and, (4) computation of the lifetimes and spatially resolved destruction rates of trace gases using 3-D models. Important goals include determination of regional source strengths of methane, nitrous oxide, and other climatically and chemically important biogenic trace gases and also of halocarbons restricted by the Montreal Protocol and its follow-on agreements and hydrohalocarbons used as alternatives to the restricted halocarbons.

Prinn, Ronald G.↗

The Scientific and Societal Need for Accurate Global Remote Sensing of Marine Suspended Sediments

Population pressure, commercial development, and climate change are expected to cause continuing alteration of the vital oceanic coastal zone environment. These pressures will influence both the geology and biology of the littoral, nearshore, and continental shelf regions. A pressing need for global observation of coastal change processes is an accurate remotely-sensed data product for marine suspended sediments. The concentration, delivery, transport, and deposition of sediments is strongly relevant to coastal primary production, inland and coastal hydrology, coastal erosion, and loss of fragile wetland and island habitats. Sediment transport and deposition is also related to anthropogenic activities including agriculture, fisheries, aquaculture, harbor and port commerce, and military operations. Because accurate estimation of marine suspended sediment concentrations requires advanced ocean optical analysis, a focused collaborative program of algorithm development and assessment is recommended, following the successful experience of data refinement for remotely-sensed global ocean chlorophyll concentrations.

Acker, James G.↗

Multipath Mitigation via Clustering for Position Estimation Refinement in Urban Environments

Position estimation using global navigation satellite systems (GNSS) suffers from poor accuracy within urban canyons due to significant signal disruption caused by tall buildings. This issue can be attributed to the GNSS signals reflecting off buildings resulting in severe multipath reflections which degrade the receiver's performance. In this paper, we introduce an innovative approach to filter GNSS satellite measurements to improve the accuracy of the estimated position by leveraging a clustering algorithm. This approach utilizes a predictive GNSS availability service to filter out non-line-of-sight measurements. Then, a subset of line-of-sight satellite measurement combinations are evaluated using a clustering algorithm. When combined, results show these techniques can reduce the mean horizontal error measured in an urban canyon by nearly an order of magnitude, from ~ 18 meters to ~ 2 meters when using a single point positioning solver.

GPS↗

Multipath Mitigation via Clustering for Position Estimation Refinement in Urban Environments

Position estimation using global navigation satellite systems (GNSS) suffers from poor accuracy within urban canyons due to significant signal disruption caused by tall buildings. This issue can be attributed to the GNSS signals reflecting off buildings resulting in severe multipath reflections which degrade the receiver's performance. In this paper, we introduce an innovative approach to filter GNSS satellite measurements to improve the accuracy of the estimated position by leveraging a clustering algorithm. This approach utilizes a predictive GNSS availability service to filter out non-line-of-sight measurements. Then, a subset of line-of-sight satellite measurement combinations are evaluated using a clustering algorithm. When combined, results show these techniques can reduce the mean horizontal error measured in an urban canyon by nearly an order of magnitude, from ~ 18 meters to ~ 2 meters when using a single point positioning solver.

GPS↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

Measuring and modeling diffuse scattering in protein X-ray crystallography

X-ray diffraction has the potential to provide rich information about the structural dynamics of macromolecules. To realize this potential, both Bragg scattering, which is currently used to derive macromolecular structures, and diffuse scattering, which reports on correlations in charge density variations, must be measured. Until now, measurement of diffuse scattering from protein crystals has been scarce because of the extra effort of collecting diffuse data. Here, we present 3D measurements of diffuse intensity collected from crystals of the enzymes cyclophilin A and trypsin. The measurements were obtained from the same X-ray diffraction images as the Bragg data, using best practices for standard data collection. To model the underlying dynamics in a practical way that could be used during structure refinement, we tested translation–libration–screw (TLS), liquid-like motions (LLM), and coarse-grained normal-modes (NM) models of protein motions. The LLM model provides a global picture of motions and was refined against the diffuse data, whereas the TLS and NM models provide more detailed and distinct descriptions of atom displacements, and only used information from the Bragg data. Whereas different TLS groupings yielded similar Bragg intensities, they yielded different diffuse intensities, none of which agreed well with the data. In contrast, both the LLM and NM models agreed substantially with the diffuse data. In conclusion, these results demonstrate a realistic path to increase the number of diffuse datasets available to the wider biosciences community and indicate that dynamics-inspired NM structural models can simultaneously agree with both Bragg and diffuse scattering.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improvement of the prediction of surface ozone concentration over conterminous U.S. by a computationally efficient second-order Rosenbrock solver in CAM4-Chem

The global chemistry-climate model (CAM4-Chem) overestimates the surface ozone concentration over the conterminous U.S. (CONUS). Reasons for this positive bias include emission, meteorology, chemical mechanism, and solver. In this study, we explore the last possibility by examining the sensitivity to the numerical methods for solving the chemistry equations. A second-order Rosenbrock (ROS-2) solver is implemented in CAM4-Chem to examine its influence on the surface ozone concentration and the computational performance of the chemistry program. Results show that under the same time step size (1800 s), statistically significant reduction of positive bias is achieved by the ROS-2 solver. The improvement is as large as 5.2 ppb in Eastern U.S. during summer season. The ROS-2 solver is shown to reduce the positive bias in Europe and Asia as well, indicating the lower surface ozone concentration over the CONUS predicted by the ROS-2 solver is not a trade-off consequence with increasing the ozone concentration at other global regions. In addition, by refining the time step size to 180 s, the first-order implicit solver does not provide statistically significant improvement of surface ozone concentration. It reveals that the better prediction from the ROS-2 solver is not only due to its accuracy but also due to its suitability for stiff chemistry equations. As an added benefit, the computation cost of the ROS-2 solver is almost half of first-order implicit solver. The improved computational efficiency of the ROS-2 solver is due to the reuse of the Jacobian matrix and lower upper (LU) factorization during its multistage calculation.

54 ENVIRONMENTAL SCIENCES↗

Implications of a prereionization 21-cm absorption signal for fuzzy dark matter

The EDGES experiment recently announced evidence for a broad absorption feature in the sky-averaged radio spectrum around 78 MHz, as may result from absorption in the 21 cm line by neutral hydrogen at z ∼15 – 20. If confirmed, one implication is that the spin temperature of the 21 cm line is coupled to the gas temperature by z = 20. The known mechanism for accomplishing this is the Wouthuysen-Field effect, whereby Lyman-alpha photons scatter in the intergalactic medium (IGM) and impact the hyperfine level populations. This suggests that early star formation had already produced a copious Lyman-alpha background by z = 20, and strongly constrains models in which the linear matter power spectrum is suppressed on small-scales, since halo and star formation are delayed in such scenarios. Here we consider the case that the dark matter consists of ultra-light axions with macroscopic de Broglie wavelengths (fuzzy dark matter, FDM). Here we assume that star formation tracks halo formation and adopt two simple models from the current literature for the halo mass function in FDM. We further suppose that the fraction of halo baryons which form stars is less than a conservative upper limit of f ⋆ ≤ 0.05, and that ∼10 4 Lyman-alpha to Lyman-limit photons are produced per stellar baryon. We find that the requirement that the 21 cm spin temperature is coupled to the gas temperature by z = 20 places a lower-limit on the FDM particle mass of m a ≥ 5 × 10 −21 eV. The constraint is insensitive to the precise minimum mass of halos where stars form. As the global 21 cm measurements are refined, the coupling redshift could change and we quantify how the FDM constraint would be modified. A rough translation of the FDM mass bound to a thermal relic warm dark matter (WDM) mass bound is also provided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Influence of Atmospheric Rivers on Mountain Snowpack in the Western U.S.

In the coastal mountain regions of western North America, most extreme precipitation is associated with atmospheric rivers, narrow bands of moisture originating in the tropics. Here we quantify how the interannual variability in atmospheric rivers influences snowpack in the western United States in observations and a model. We simulate the historical climate with the Model for Prediction Across Scales with physics from the Community Atmosphere Model Version 5 (MPAS-CAM5) using prescribed sea surface temperatures. In the global variable resolution domain, regional refinement (at 30 km) is applied to our region of interest over western North America and upwind over the northeast Pacific. To better characterize internal variability, we conduct simulations with three ensemble members over 30 years of the historical period. In the Cascade Mountains, with some exceptions, winters with more atmospheric river days are associated with less snowpack. In California’s Sierra Nevada the sign is the opposite. In observations, the results are consistent in winter, but statistically significant only for California. In spring, internal variance plays an important role in determining the sign of the relationship between number of atmospheric river days and snowpack. Cumulative atmospheric river days starting in winter through spring, on the other hand, yield a spring relationship with the same sign as the winter one for a given location. Thus, the impact of atmospheric rivers on winter snowpack has a greater influence on spring snowpack than spring atmospheric rivers, in the model for both regions and in California consistently in observations.

Goldenson, Naomi L.↗

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗