SEARCH · Search NASA

Results for “sparse representation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory

Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree–Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller–Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the “ragged list”) and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Here, our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the “fixed sparsity pattern”) for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Parametric, Data-Driven, Non-Intrusive Reduced-Order Model Framework for Crystal Plasticity Simulations of Voids

The influence of the internal structure at micrometer length scales on the deformation of polycrystalline materials can be effectively captured using crystal plasticity finite element methods (CPFEM). However, the complexity and nonlinearity of the deformation equations CPFEM solves demand significant computational power and resources to achieve accurate predictions, limiting its broader application. To address this challenge, we have identified a reduced-order representation of the complex data in order to establish a computationally efficient reduced-order models (ROM) and drastically reduce the computational expense of CPFEM. Specifically, in this work, we developed a parametric, data-driven, and non-intrusive ROM framework for CPFEM using proper orthogonal decomposition (POD) and sparse variational Gaussian process (SVGP) regression for single-crystal microstructures under tensile loading conditions. The developed protocol enables one to compress field into a latent/low-dimensional space described by principal component analysis (PCA) via the singular value decomposition (SVD) algorithm. As a result, the high-dimensional data are reduced to a significantly smaller amount of dimensions with POD bases and POD coefficients. Furthermore, we deployed an ensemble of SVGPs—extended from the classical Gaussian process (GP) regression for scalability and handling big data—in a massively parallel manner to train and predict latent POD coefficients using known POD bases from a set of previously obtained simulations results. Lastly, using the predicted POD coefficients, we reconstructed the full-field results and showed reasonable agreement compared with the true values obtained from running CPFEM. The developed framework is validated with a set of CPFEM simulations of a single embedded void in single-crystal aluminum alloy. While the framework is broadly applicable, this work specifically focuses on single-crystal microstructures, a single load case (e.g., tensile), and a specific void geometry (spherical).

Anisotropy↗

DOE OSTI2025

Experimental study of multiple-orientation muon tomography with image optimization in sparse data environments

Due to the high penetrating power of cosmic-ray muons, they can be used to probe very thick and dense objects. As muons are charged particles, they can be tracked by ionization detectors, determining the position and direction of the muons. With detectors on either side of an object to measure particle direction change, scattering information within the object can be found. This can be used to produce a scattering-intensity image within the object related to density and atomic number. Such imaging is typically performed with a single detector-object orientation, taking advantage of the more intense downward flux of muons, producing planar imaging with some depth-of-field information in the third dimension. Several simulation studies were published with multiorientation tomography, which can form a three-dimensional representation faster than a single-orientation view. In this study, experimental muon-scatter-based tomography was performed using a concrete filled steel drum with several different metal wedges inside, with the drum between detector planes. Data were collected from different detector-object orientations by rotating the steel drum. The data collected from each orientation were combined using two different tomographic methods. A traditional inverse Radon transform approach used for computed tomography and a combination of multiple depth-of-field reconstructions were applied to the data. As cosmic-ray muon flux imaging is rate limited, the imaging techniques were compared for sparse data. Using the combined depth-of-field reconstruction technique, fewer detector-object orientations were needed to reconstruct images that could be used to differentiate the metal wedges.

47 OTHER INSTRUMENTATION↗

DOE OSTI2020

How Low Can You Go? Using Synthetic 3D Imagery to Drastically Reduce Real-World Training Data for Object Detection

Deep convolutional neural networks (DCNNs) currently provide state-of-the-art performance on image classification and object detection tasks, and there are many global security mission areas where such models could be extremely useful. Crucially, the success of these models is driven in large part by the widespread availability of high-quality open source data sets such as Image Net, Common Objects in Context (COCO), and KITTI, which contain millions of images with thousands of unique labels. However, global security relevant objects-of-interest can be difficult to obtain: relevant events are low frequency and high consequence; the content of relevant images is sensitive; and adversaries and proliferators seek to obscure their activities. For these cases where exemplar data is hard to come-by, even fine-tuning an existing model with available data can be effectively impossible. Recent work demonstrated that models can be trained using a combination of real-world and synthetic images generated from 3D representations; that such models can exceed the performance of models trained using real-world data alone; and that the generated images need not be perfectly realistic (Tremblay, et al., 2018). However, this approach still required hundreds to thousands of real-world images for training and fine tuning, which for sparse, global security-relevant datasets can be an unrealistic hurdle. In this research, we validate the performance and behavior of DCNN models as we drive the number of real-world images used for training object detection tasks down to a minimal set. We perform multiple experiments to identify the best approach to train DCNNs from an extremely small set of real-world images. In doing so, we: Develop state-of-the-art, parameterized 3D models based on real-world images and sample from their parameters to increase the variance in synthetic image training data; Use machine learning explainability techniques to highlight and correct through targeted training the biases that result from training using completely synthetic images; and Validate our results by comparing the performance of the models trained on synthetic data to one another, and to a control model created by fine-tuning an existing ImageNet-trained model with a limited number (hundreds) of real-world images.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1981

The state of the atmosphere as inferred from the FGGE satellite observing systems during SOP-1

The statistical properties, and coverage, of satellite temperature sounding data are described. Tropical regions are observed every two days, extratropics from one to four times a day. Oceans are covered two to three times a day. Asynoptic coverage is comparable to the U.S. rawinsonde network twice daily coverage. Lack of ground truth for data sparse areas makes accuracy difficult to assess. The rms differences of layer mean temperatures obtained from collocating rawinsonde observations with satellite temperature profiles in space and time differ from rms differences of layer mean satellite temperature soundings. The FGGE satellite systems can infer the three dimensional motion field and improve the representation of the large scale state of the atmosphere.

Halem, M.↗

DOE OSTI2024

First experimental study of multiple orientation muon tomography, with image optimization in sparse data environments

Due to the high penetrating power of cosmic ray muons, they can be used to probe very thick and dense objects. As charged particles, they can be tracked by ionization detectors, determining the position and direction of the muons. With detectors on either side of an object, particle direction changes can be used to extract scattering information within an object. This can be used to produce a scattering intensity image within the object related to density and atomic number. Such imaging is typically performed with a single detector-object orientation, taking advantage of the more intense downward flux of muons, producing planar imaging with some depth-of-field information in the third dimension. Several simulation studies have been published with multi-orientation tomography, which can form a three-dimensional representation faster than a single orientation view. In this work we present the first experimental multiple orientation muon tomography study. Experimental muon-scatter based tomography was performed using a concrete filled steel drum with several different metal wedges inside, between detector planes. Data was collected from different detector-object orientations by rotating the steel drum. The data collected from each orientation were then combined using two different tomographic methods. Results showed that using a combination of multiple depth-of-field reconstructions, rather than a traditional inverse Radon transform approach used for CT, resulted in more useful images for sparser data. As cosmic ray muon flux imaging is rate limited, the imaging techniques were compared for sparse data. Using the combined depth-of-field reconstruction technique, fewer detector-object orientations were needed to reconstruct images that could be used to differentiate the metal wedge compositions.

Applied Physics (physics.app-ph)↗

NASA NTRS2015

Aerosol-Cloud Interactions in the South-East Atlantic: Knowledge Gaps, Planned Observations to Address Them, and Implications for Global Climate Change Modeling

Southern Africa produces almost a third of the Earth's biomass burning (BB) aerosol particles, yet the fate of these particles and their influence on regional and global climate is poorly understood. Particles lofted into the mid-troposphere are transported westward over the South-East (SE) Atlantic, home to one of the three permanent subtropical Stratocumulus (Sc) cloud decks in the world. The stratocumulus "climate radiators" are critical to the regional and global climate system. They interact with dense layers of BB aerosols that initially overlay the cloud deck, but later subside and are mixed into the clouds. These interactions include adjustments to aerosol-induced solar heating and microphysical effects. As emphasized in the latest IPCC report, the global representation of these aerosol-cloud interaction processes in climate models is one of the largest uncertainty in estimates of future climate. Hence, new observations over the SE Atlantic have significant implications for global climate change scenarios. We discuss the current knowledge of aerosol and cloud property distributions based on satellite observations and sparse suborbital sampling, and describe planned field campaigns in the region. Specifically, we describe the scientific objectives and implementation of the following four synergistic, international research activities aimed at providing a process-level understanding of aerosol-cloud interactions over the SE Atlantic: 1) ORACLES (Observations of Aerosols above Clouds and their interactions), a five-year investigation between 2015 and 2019 with three Intensive Observation Periods (IOP), recently funded by the NASA Earth-Venture Suborbital Program, 2) CLARIFY-2016 (Cloud-Aerosol-Radiation Interactions and Forcing: Year 2016), a comprehensive observational and modeling programme funded by the UK's Natural Environment Research Council (NERC), and supported by the UK Met Office. 3) LASIC (Layered Atlantic Smoke Interactions with Clouds), a funded deployment of the DOE (Department of Energy) ARM Mobile Facility (AMF1) to Ascension Island, nominally for April 1 2016 - March 31 2017, and 4) ONFIRE (Observations of Fire's Impact on the southeast Atlantic Region), a proposed deployment of the NCAR C-130 aircraft to Sao Tome Island in 2017.

Aerosol-cloud↗

DOE OSTI2022

Deep Learning for Simultaneous Inference of Hydraulic and Transport Properties

Abstract Identification of a heterogeneous conductivity field and reconstruction of a contaminant release history are key aspects of subsurface remediation. These two goals are achieved by combining model predictions with sparse and noisy hydraulic head and concentration measurements. Solution of this inverse problem is notoriously difficult due to, in part, high dimensionality of the parameter space and high computational cost of repeated forward solves. We use a convolutional adversarial autoencoder (CAAE) to parameterize a heterogeneous non‐Gaussian conductivity field via a low‐dimensional latent representation. A three‐dimensional dense convolutional encoder‐decoder (DenseED) network serves as a forward surrogate of the flow and transport model. The CAAE‐DenseED surrogate is fed into the ensemble smoother with multiple data assimilation (ESMDA) algorithm to sample from the Bayesian posterior distribution of the unknown parameters, forming a CAAE‐DenseED‐ESMDA inversion framework. The resulting CAAE‐DenseED‐ESMDA inversion strategy is used to identify a three‐dimensional contaminant source and conductivity field. A comparison of the inversion results from CAAE‐ESMDA with physical flow and transport simulator and from CAAE‐DenseED‐ESMDA shows that the latter yields accurate reconstruction results at the fraction of the computational cost of the former.

Zhou, Zitong↗

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]↗

NASA NTRS2006

NASA Tech Briefs, May 2006

T-Shaped Emitter Metal Structures for HBTs Rigorous Estimation of SNR of a PSK Communication Link Advanced Ka-Band Transceiver With Monopulse Tracking EMI Filters for Low-Temperature Applications Lightweight Electronic Camera for Research on Clouds Pilot Weather Advisor System Waveguide Power-Amplifier Module for 80 to 150 GHz Better Back Contacts for Solar Cells on Flexible Substrates Topics covered include:Tunable, Highly Stable Lasers for Coherent Lidar; Improved Photon-Emission-Microscope System; Program Synthesizes UML Sequence Diagrams; Aspect-Oriented Subprogram Synthesizes UML Sequence Diagrams; Updated Computational Model of Cosmic Rays Near Earth; Software for Alignment of Segments of a Telescope Mirror; Simulation of Dropping of Cargo With Parachutes; DAVE-ML Utility Program; Robust Control for the Mercury Laser Altimeter; Thermally Stable Piezoelectric and Pyroelectric Polymers; Combustion Synthesis of Ca3(PO4)2 Net-Shape Surgical Implants; Stochastic Representation of Chaos Using Terminal Attractors; Two High-Temperature Foil Journal Bearings; Using Plates To Represent Fillets in Finite-Element Modeling; Repairing Chipped Silicide Coatings on Refractory Metal Substrates; Simplified Fabrication of Helical Copper Antennas; Graded-Index "Whispering-Gallery" Optical Microresonators; Optical Profilometers Using Adaptive Signal Processing; Manufacture of Sparse-Spectrum Optical Microresonators; Exact Tuning of High-Q Optical Microresonators by Use of UV; Automation for "Direct-to" Clearances in Air-Traffic Control; Improved Traps for Removing Gases From Coolant Liquids; and Lunar Constellation of Frozen Elliptical Inclined Orbits.

Source record↗

DOE OSTI2025

ARCH: Large-scale knowledge graph via aggregated narrative codified health records analysis

Objective: Electronic health record (EHR) systems contain a wealth of clinical data stored as both codified data and free-text narrative notes (NLP). The complexity of EHR presents challenges in feature representation, information extraction, and uncertainty quantification. Here, to address these challenges, we proposed an efficient Aggregated naRrative Codified Health (ARCH) records analysis to generate a large-scale knowledge graph (KG) for a comprehensive set of EHR codified and narrative features. Methods: Using data from 12.5 million Veterans Affairs patients, ARCH first derives embedding vectors and generates similarities along with associated p-values to measure the strength of relatedness between clinical features with statistical certainty quantification. Next, ARCH performs a sparse embedding regression to remove indirect linkage between features to build a sparse KG. Finally, ARCH was validated on various clinical tasks, including detecting known relationships between entity pairs, predicting drug side effects, disease phenotyping, as well as sub-typing Alzheimer’s disease patients. Results: ARCH produces high-quality clinical embeddings and KG for over 60,000 codified and narrative EHR concepts. The KG and embeddings are visualized in the R-shiny powered web-API.3 ARCH achieved high accuracy in detecting EHR concept relationships, with AUCs of 0.926 (codified) and 0.861 (NLP) for similar EHR concepts, and 0.810 (codified) and 0.843 (NLP) for related pairs. It detected drug side effects with a 0.723 AUC, which improved to 0.826 after fine-tuning. Using both codified and NLP features, the detection power increased significantly. Compared to other methods, ARCH has superior accuracy and enhances weakly supervised phenotyping algorithms’ performance. Notably, it successfully categorized Alzheimer’s patients into two subgroups with varying mortality rates. Conclusion: The proposed ARCH algorithm generates large-scale high-quality semantic representations and knowledge graph for both codified and NLP EHR features, useful for a wide range of predictive modeling tasks.

Electronic health records↗

DOE OSTI2025

From PINNs to PIKANs: recent advances in physics-informed machine learning

Physics-Informed Neural Networks (PINNs) have emerged as a key tool in Scientific Machine Learning since their introduction in 2017, enabling the efficient solution of ordinary and partial differential equations using sparse measurements. Over the past few years, significant advancements have been made in the training and optimization of PINNs, covering aspects such as network architectures, adaptive refinement, domain decomposition, and the use of adaptive weights and activation functions. A notable recent development is the Physics-Informed Kolmogorov-Arnold Networks (PIKANS), which leverage a representation model originally proposed by Kolmogorov in 1957, offering a promising alternative to traditional PINNs. In this review, we provide a comprehensive overview of the latest advancements in PINNs, focusing on improvements in network design, feature expansion, optimization techniques, uncertainty quantification, and theoretical insights. We also survey key applications across a range of fields, including biomedicine, fluid and solid mechanics, geophysics, dynamical systems, heat transfer, chemical engineering, and beyond. Lastly, we review computational frameworks and software tools developed by both academia and industry to support PINN research and applications.

Kolmogorov-Arnold networks↗

DOE OSTI2023

Machine learning for detection of 3D features using sparse x-ray tomographic reconstruction

In many inertial confinement fusion (ICF) experiments, the neutron yield and other parameters cannot be completely accounted for with one and two dimensional models. This discrepancy suggests that there are three dimensional effects that may be significant. Sources of these effects include defects in the shells and defects in shell interfaces, the fill tube of the capsule, and the joint feature in double shell targets. Due to their ability to penetrate materials, x rays are used to capture the internal structure of objects. Methods such as computational tomography use x-ray radiographs from hundreds of projections, in order to reconstruct a three dimensional model of the object. In experimental environments, such as the National Ignition Facility and Omega-60, the availability of these views is scarce, and in many cases only consists of a single line of sight. Mathematical reconstruction of a 3D object from sparse views is an ill-posed inverse problem. These types of problems are typically solved by utilizing prior information. Neural networks have been used for the task of 3D reconstruction as they are capable of encoding and leveraging this prior information. We utilize half a dozen, different convolutional neural networks to produce different 3D representations of ICF implosions from the experimental data. Deep supervision is utilized to train a neural network to produce high-resolution reconstructions. These representations are used to track 3D features of the capsules, such as the ablator, inner shell, and the joint between shell hemispheres. Machine learning, supplemented by different priors, is a promising method for 3D reconstructions in ICF and x-ray radiography, in general.

Wolfe, Bradley T. (ORCID:0000000268301614)↗

DOE OSTI2024

Unifying Combinatorial and Graphical Methods in Artificial Intelligence

Recently, a new graph Laplacian, called the inner product Laplacian, was introduced which generalizes many existing Laplacians, including the normalized and combinatorial Laplacian and their weighted variants. The key observation behind the inner product Laplacian is that by defining appropriate inner product spaces on the vertices and edges, the standard Laplacians can be recovered as Hodge Laplacians over the simplicial complex formed by the edges and vertices. These inner product spaces form a natural way to incorporate non-combinatorial information into the definition of a domain-specific Laplacian. In particular, in contrast to current domain-specific weighting schemes which rely solely on edge weights, information regarding the similarity of non-adjacent vertices and arbitrary pairs of edges can be effectively incorporated into the Laplacian. In order to illustrate this approach we consider the problem of calculating the potential energy of an atomistic configuration using Graph Neural Networks. In comparison with start-of-the-art approaches, such as SchNet, our approach replaces a learned (via auto-encoder) representation of the atom types with an inner product space on atoms based on scientific knowledge (e.g., electronegativity). We will illustrate how this approach captures key chemical properties of the molecules and compare the energy calculations with state-of-the-art neural network approaches. However, to compute the resulting Laplacian involves a mixture of sparse and dense matrix computation and yields a dense matrix as the basis for the graph convolution. This dense convolutional kernel necessitates moving away from the standard message passing framework for graph neural networks and increases the computational cost of applying the kernel. In order to mitigate these costs we investigate means of leveraging the mixed sparse and dense computations to reduce the overall computational cost and how these approaches can be automatically transferred to energy efficient hardware (e.g., field programmable gate arrays (FPGAs)).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1986

Computer simulation of a wind tunnel test section with discrete finite-length wall slots

A computer simulation of a slotted wind tunnel test section which includes a discrete, finite-length wall slot representation with plenum chamber constraints and accounts for the nonlinear effects of the dynamic pressure of the slot outflow jet and of the low energy of slot inflow air was developed. The simulation features were selected to be those appropriate for the intended subsequent use of the simulation in a wall interference assessment procedure using sparsely located wall pressure measurements. It is demonstrated that accounting for slot discreteness is important in interpreting wall pressure measured between slots, and that accounting for nonlinear slot flow effects produces significant changes in tunnel-induced velocity distributions and, in particular, produces a longitudinal component of tunnel-induced velocity due to model lift. A characteristic mode of tunnel flow interaction with constraints imposed by the plenum chamber and diffuser entrance is apparent in simulation results and is derived analytically through a simplified analysis.

Kemp, W. B., Jr.↗

DOE OSTI2022

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

SHMIP The subglacial hydrology model intercomparison Project

Subglacial hydrology plays a key role in many glaciological processes, including ice dynamics via the modulation of basal sliding. Owing to the lack of an overarching theory, however, a variety of model approximations exist to represent the subglacial drainage system. The Subglacial Hydrology Model Intercomparison Project (SHMIP) provides a set of synthetic experiments to compare existing and future models. We present the results from 13 participating models with a focus on effective pressure and discharge. For many applications (e.g. steady states and annual variations, low input scenarios) a simple model, such as an inefficient-system-only model, a flowline or lumped model, or a porous-layer model provides results comparable to those of more complex models. However, when studying short term (e.g. diurnal) variations of the water pressure, the use of a two-dimensional model incorporating physical representations of both efficient and inefficient drainage systems yields results that are significantly different from those of simpler models and should be preferentially applied. The results also emphasise the role of water storage in the response of water pressure to transient recharge. Finally, we find that the localisation of moulins has a limited impact except in regions of sparse moulin density.

58 GEOSCIENCES↗