Search NASA⌕ Search

SEARCH · Search NASA

Results for “temporal decomposition”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

An investigation of the use of temporal decomposition in space mission scheduling

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

Bullington, Stanley E.↗
DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Long duration battery sizing, siting, and operation under wildfire risk using progressive hedging

Battery sizing and siting problems are computationally challenging due to the need to make long-term planning decisions that are cognizant of short-term operational decisions. This paper considers sizing, siting, and operating batteries in a power grid to maximize their benefits, including price arbitrage and load shed mitigation, during both normal operations and periods with high wildfire ignition risk. Here we formulate a multi-scenario optimization problem for long duration battery storage while considering the possibility of load shedding during Public Safety Power Shutoff (PSPS) events that de-energize lines to mitigate severe wildfire ignition risk. To enable a computationally scalable solution of this problem with many scenarios of wildfire risk and power injection variability, we develop a customized temporal decomposition method based on a progressive hedging framework. Extending traditional progressive hedging techniques, we consider coupling in both placement variables across all scenarios and state-of-charge variables at temporal boundaries. This enforces consistency across scenarios while enabling parallel computations despite both spatial and temporal coupling. The proposed decomposition facilitates efficient and scalable modeling of a full year of hourly operational decisions to inform the sizing and siting of batteries. With this decomposition, we model a year of hourly operational decisions to inform optimal battery placement for a 240-bus WECC model in under 70 min of wall-clock time.

25 ENERGY STORAGE↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2025

Bayesian Calibration of Stochastic Agent Based Model via Random Forest

Agent-based models (ABM) provide an excellent framework for modeling outbreaks and interventions in epidemiology by explicitly accounting for diverse individual interactions and environments. However, these models are usually stochastic and highly parametrized, requiring precise calibration for predictive performance. When considering realistic numbers of agents and properly accounting for stochasticity, this high-dimensional calibration can be computationally prohibitive. This paper presents a random forest-based surrogate modeling technique to accelerate the evaluation of ABMs and demonstrates its use to calibrate an epidemiological ABM named CityCOVID via Markov chain Monte Carlo (MCMC). The technique is first outlined in the context of CityCOVID's quantities of interest, namely hospitalizations and deaths, by exploring dimensionality reduction via temporal decomposition with principal component analysis (PCA) and via sensitivity analysis. The calibration problem is then presented, and samples are generated to best match COVID-19 hospitalization and death numbers in Chicago from March to June in 2020. Further, these results are compared with previous approximate Bayesian calibration (IMABC) results, and their predictive performance is analyzed, showing improved performance with a reduction in computation.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Flow field characteristics of a 127-pin rod bundle with hexagonal spacer grids

A determination of nominal flow phenomena in liquid metal fast reactor (LMFR) fuel assemblies is critical toward generation-IV reactor development. Axially positioned spacer grids are used to maintain the geometry of hexagonal rod bundles and simultaneously introduce perturbations in the flow. Three-dimensional (3D) printed asymmetric honeycomb spacer grids were installed in a prototypical 127-pin LMFR fuel assembly model to study complex fluid dynamics interactions induced by the spacer grid and rods. To characterize flow dynamics in this intricate geometry, time-resolved particle image velocimetry (TR-PIV) using the matched-index-of-refraction method was employed to obtain non-intrusive velocity measurements for three axial planes (one near-wall and two interior planes) at a Reynolds number of 6000. The statistical TR-PIV results compared sub-channel-dependent normalized time-averaged velocity, velocity fluctuations, Reynolds stress, vorticity, and turbulence kinetic energy distributions. TR-PIV line profiles characterized downstream spacer grid flow dynamics. Two-point spatial and spatial–temporal cross-correlation fields revealed local coherent structures and quantified convection velocities of traveling vortices. Spatial–temporal decomposition using dynamic mode decomposition (DMD) applied to the near-wall vorticity fields extracted turbulent structures and flow instabilities in the wake region of the spacer grid, along with their decay and frequency rates. Reduced-order velocity fields from DMD reconstructions identified the most energy-containing coherent structures persistent in the near-wall region. This research provides experimental data sets and analyses of flow behavior in rod bundles with hexagonal spacer grids. In conclusion, the results are critical toward LMFR design and geometry optimization, crucial for the validation of computational fluid dynamics and reduced-order flow models.

42 ENGINEERING↗
DOE OSTI2025

NLR HPC Kestrel Jobs Data

Overview: Anonymized job-level records from the Kestrel HPC system at the National Laboratory of the Rockies (NLR). Each record represents a Slurm batch job with scheduling metadata, resource requests, utilization, energy estimates, and efficiency metrics. Sensitive fields (user, account, job name, submit line, working directory, submit script, and job type) are replaced with 7-character cryptographic hashes. System & Timeframe: Kestrel is located at the NLR campus. Standard compute nodes have 104 cores and 256 GB RAM; bigmem nodes have 2,000 GB. GPU nodes (gpu-h100 partition) use NVIDIA H100 GPUs. Data covers jobs submitted August 2023 through December 2025. Funding provided by the U.S. Department of Energy, EERE. Files: esif.hpc.kestrel.job-anon.zip — Anonymized job records (Hive-partitioned Parquet) datacard.md — Full dataset documentation ~11 million rows, 50 variables. Readable with PyArrow, pandas, DuckDB, Apache Spark, or any Parquet-compatible tool. Data Collection: Jobs collected via sacct with timezone-aware export (SLURM_TIME_FORMAT="%Y-%m-%dT%H:%M:%S%z"), loaded into PostgreSQL. Calculated columns updated via database triggers and batch functions. All timestamps use timestamptz and correctly handle DST transitions. Preprocessing: Anonymization of name, user, account, submit_line, work_dir, submit_script, and job_type via 7-char hex hashes Derived columns: queue_wait, cpu_eff, max/min/avg_mem_eff, energy estimates Simplified job state mapping (e.g., "CANCELLED by 132357" → "CANCELLED") Boolean flags: python_job, reframe_job Temporal decomposition: year, month, day, day_of_week, hour, minute from submit_time Shared node tracking: shared_job_count, nodes_shared, jobs_shared Key Variables: Scheduling: job_id, partition, state_simple, submit_time, start_time, end_time, queue_wait Resources: nodes_req/used, processors_req/used, memory_req, wallclock_req/used, gpus_requested Efficiency: cpu_eff, max/min/avg_mem_eff Energy: cpu_energy_tdp_estimated_max/used_watt_hours, consumed_energy_raw_joules, consumed_energy_raw_watt_hours Sharing: shared_job_count, nodes_shared, jobs_shared Partitions: short, standard, debug, gpu-h100 Job States: CANCELLED, COMPLETED, FAILED, PENDING, RUNNING QoS Levels: normal, high Important Notes: Timestamps include timezone offsets; DST transitions are handled correctly, though adding intervals across DST boundaries requires offset adjustment shared_job_count reflects physical node co-residency, not use of the shared partition Job step records and raw Slurm JSONB fields are excluded Do not attempt to re-identify individuals from hashed fields

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

From Competence to Efficiency: A Tale of GA Progress

Genetic algorithms (GAs) - search procedures based on the mechanics of natural selection and genetics - have grown in popularity for the solution of difficult optimization problems. Concomitant with this growth has been a rising cacaphony of complaint asserting that too much time must be spent by the GA practitioner diddling with codes, operators, and GA parameters; and even then these GA cassandras continue, and the user is still unsure that the effort will meet with success. At the same time, there has been a rising interest in GA theory by a growing community - a theorocracy - of mathematicians and theoretical computer scientists, and these individuals have turned their efforts increasingly toward elegant abstract theorems and proofs that seem to the practitioner to offer little in the way of answers for GA design or practice. What both groups seem to have missed is the largely unheralded 1993 assembly of integrated, applicable theory and its experimental confirmation. This theory has done two key things. First, it has predicted that simple GAs are severely limited in the difficulty of problems they can solve, and these limitations have been confirmed experimentally. Second, it has shown the path to circumventing these limitations in nontraditional GA designs such as the fast messy GA. This talk surveys the history, methodology, and accomplishment of the 1993 applicable theory revolution. After arguing that these accomplishments open the door to universal GA competence, the paper shifts the discussion to the possibility of universal GA efficiency in the utilization of time and real estate through effective parallelization, temporal decomposition, hybridization, and relaxed function evaluation. The presentation concludes by suggesting that these research directions are quickly taking us to a golden age of adaptation.

Goldberg, David E.↗
DOE OSTI2023

Spatio–Temporal Coarse–Graining Decomposition of the Global Ocean Geostrophic Kinetic Energy

We expand on a recent determination of the first global energy spectrum of the ocean’s surface geostrophic circulation using a coarse-graining (CG) method. We compare spectra from CG to those from spherical harmonics by treating land in a manner consistent with the boundary conditions. While the two methods yield qualitatively consistent domain-averaged results, spherical harmonics spectra are too noisy at gyre-scales (> 1000 km). More importantly, spherical harmonics are inherently global and cannot provide local information connecting scales with currents geographically. CG shows that the extra-tropics mesoscales (100–500 km) have a root-mean-square (rms) velocity of ~15 cm/s, which increases to ~30–40 cm/s locally in the Gulf Stream and Kuroshio and to ~16–28 cm/s in the ACC. There is notable hemispheric asymmetry in mesoscale energy-per-area, which is higher in the north due to continental boundaries. We estimate that ≈25–50% of total geostrophic energy is at scales smaller than 100 km, and is un(der)-resolved by pre-SWOT satellite products. Spectra of the time-mean circulation show that most of its energy (up to 70%) resides in stationary eddies with characteristic scales smaller than (< 500 km). This highlights the preponderance of ‘standing’ small-scale structures in the global ocean due to the temporally coherent forcing by boundaries. By coarse-graining in space and time, we compute the first spatio-temporal global spectrum of geostrophic circulation from AVISO and NEMO. These spectra show that every length-scale evolves over a wide range of time-scales with a consistent peak at ≈200 km and ≈2–3 weeks.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Temporal Convolutional Network Using Empirical Mode Decomposition to Detect Faults in Grid Connected Systems

Grid-connected power electronic systems require timely and reliable fault detection to prevent equipment damage and reduce downtime. This paper presents a forecasting-based anomaly detection pipeline that decomposes voltage and current measurements into intrinsic mode functions (IMFs) using empirical mode decomposition (EMD), then trains a causal temporal convolutional network (TCN) on normal-operation IMF data to predict short-horizon future dynamics. Deviations between forecasts and observations are summarized as reliability-weighted residual scores and thresholded per sensor using robust statistics with temporal persistence constraints to suppress false positives. To reduce runtime, EMD is performed on downsampled signals for detection, while raw-rate EMD is applied only within a short region of interest for high-frequency interpretability near detected events. Results on a simulated grid-connected converter system demonstrate that IMF-domain forecasting improves anomaly separability relative to raw-signal forecasting and provides interpretable evidence of faults across decomposition channels.

Sutton, Elizabeth [ORNL] (ORCID:0009000078885935)↗
DOE OSTI2024

Martensite decomposition during rapid heating of Ti-6Al-4V studied via in situ synchrotron X-ray diffraction

Martensite, α‘, commonly appears in Ti-6Al-4V upon rapid cooling from above the β-transus temperature. It is known that α‘ decomposes into α and β at high temperatures but well below the β-transus temperature. Here, we study the decomposition of martensitic Ti-6Al-4V under rapid laser heating, employing in situ synchrotron X-ray diffraction. A comparison is made with post-annealed Ti-6Al-4V under heating to elucidate changes without martensite decomposition. The fast acquisition of X-ray diffraction data at 250 Hz temporally resolves the decomposition process initiated by annihilating dislocations in α‘. The recovery process is accompanied by structural changes in martensite, followed by the phase transformation to β. Thermal profiles estimated from the lattice parameter data reveal the influence of heating rates and dislocation densities on the decomposition process. Throughout the analysis of the diffraction profiles with respect to estimated temperature, we propose a straightforward method for approximating the initiation temperature of martensite decomposition.

42 ENGINEERING↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2025

Multi-omics of a model bacterial consortium deciphers details of chitin decomposition in soil

Soil microorganisms interact to carry out decomposition of complex organic carbon and nitrogen compounds, such as chitin, but the high diversity and complexity of the soil microbiome and habitat have posed a challenge to elucidating such interactions. Here, we sought to address this challenge by analysis of a model soil consortium (MSC-2) consisting of eight soil bacterial species. Our aim was to elucidate the specific roles of the member species during chitin metabolism. Samples were collected from MSC-2 incubated in chitin-enriched soil over 3 months. Multi-omics was used to understand how the community composition, transcripts, proteins, and chitin decomposition shifted over time. The data clearly and consistently revealed a temporal shift during chitin decomposition with defined contributions by individual species. A Streptomyces genus member (sp001905665) was a key player in early steps of chitin decomposition, with other MSC-2 members being central in carrying out later steps. These results illustrate how multi-omics applied to a defined consortium untangles the interactions between soil microorganisms.

chitin↗
DOE OSTI2025

EVT 16s Data and Large Supplementary Files

Soil microorganisms often interact to carry out decomposition of complex organic carbon and nitrogen compounds, such as chitin, but the high diversity and complexity of the soil microbiome and habitat has posed a challenge to elucidating such interactions between soil microorganisms. Here, we seek to address this challenge through analysis of a model soil consortium (MSC-2) of eight soil bacterial species. Our aim was to elucidate specific roles of the member species during chitin metabolism. Samples were collected from MSC-2 incubated in chitin-enriched soil over three months. Multi-omics was used to understand how the community composition, transcripts, proteins and chitin decomposition shifted over time. The data clearly and consistently revealed a temporal shift during chitin decomposition with defined contributions by individual species. A Streptomyces genus member (sp001905665) was a key player in early steps of chitin decomposition, with other MSC-2 members being central in carrying out later steps. These results illustrate how multi-omics applied to a defined consortium untangles interactions between soil microorganisms.

McClure, Ryan [Pacific Northwest National Laborato↗
NASA NTRS1998

A Search for Giant Convection Cells on the Sun

Giant convection cells (slow, long-lived cellular flows in the Sun's convection zone with typical diameters greater than about 100,000 km) have been the subject of many searches over the last 30 years. If such flows exist, they should play a key role in structuring the Sun's large scale magnetic field and in driving the large scale axisymmetric flows: the differential rotation and meridional circulation. Detailed observations of the flows in these cells may also allow us to better predict future magnetic field configurations and the solar activity associated with them. Line-of-sight velocity data from the Michelson Doppler Interferometer on the ESA/NASA Solar and Heliospheric Observatory provides us with new opportunities to search for giant cells. This data is free of any atmospheric distortion and has been obtained continuously without any day/night gaps for more than two months at a time. These two-month datasets are important because giant cells are expected to have lifetimes somewhat longer that the Sun's 27 day rotation period. Any reappearance of a flow pattern after 27 days would be an important confirmation of the existence of these cells. The approach taken in this search is to separate the giant cell velocity signal from the other, stronger velocity signals by using a spherical harmonic representation of the spatial structures and a fourier decomposition of the temporal behavior. Any giant cell signal should be characterized by low spatial wavenumbers with temporal frequencies appropriate to the solar rotation of these patterns.

Hathaway, David H.↗
NASA NTRS2012

Drought Indicators Based on Model Assimilated GRACE Terrestrial Water Storage Observations

The Gravity Recovery and Climate Experiment (GRACE) twin satellites observe time variations in Earth's gravity field which yield valuable information about changes in terrestrial water storage (TWS). GRACE is characterized by low spatial (greater than 150,000 square kilometers) and temporal (greater than 10 day) resolution but has the unique ability to sense water stored at all levels (including groundwater) systematically and continuously. The GRACE Data Assimilation System (GRACE-DAS), based on the Catchment Land Surface Model (CLSM) enhances the value of the GRACE water storage data by enabling spatial and temporal downscaling and vertical decomposition into moisture 39 components (i.e. groundwater, soil moisture, snow), which individually are more useful for scientific applications. In this study, GRACE-DAS was applied to North America and GRACE-based drought indicators were developed as part of a larger effort that investigates the possibility of more comprehensive and objective identification of drought conditions by integrating spatially, temporally and vertically disaggregated GRACE data into the U.S. and North American Drought Monitors. Previously, the Drought Monitors lacked objective information on deep soil moisture and groundwater conditions, which are useful indicators of drought. Extensive datasets of groundwater storage from USGS monitoring wells and soil moisture from the Soil Climate Analysis Network (SCAN) were used to assess improvements in the hydrological modeling skill resulting from the assimilation of GRACE TWS data. The results point toward modest, but statistically significant, improvements in the hydrological modeling skill across major parts of the United States, highlighting the potential value of GRACE assimilated water storage field for improving drought detection.

Houborg, Rasmus↗