Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random fields”

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 397 records · Page 22

Finding Matrix Product State Representations of Highly Excited Eigenstates of Many-Body Localized Hamiltonians

A key property of many-body localized Hamiltonians is the area law entanglement of even highly excited eigenstates. Matrix product states (MPS) can be used to efficiently represent low entanglement (area law) wave functions in one dimension. An important application of MPS is the widely used density matrix renormalization group (DMRG) algorithm for finding ground states of one-dimensional Hamiltonians. Here, we develop two algorithms, the shift-and-invert MPS (SIMPS) and excited state DMRG which find highly excited eigenstates of many-body localized Hamiltonians. Excited state DMRG uses a modified sweeping procedure to identify eigenstates, whereas SIMPS applies the inverse of the shifted Hamiltonian to a MPS multiple times to project out the targeted eigenstate. To demonstrate the power of these methods, we verify the breakdown of the eigenstate thermalization hypothesis in the many-body localized phase of the random field Heisenberg model, show the saturation of entanglement in the many-body localized phase, and generate local excitations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Charge-4e Superconductivity from Multicomponent Nematic Pairing: Application to Twisted Bilayer Graphene

We show that unconventional nematic superconductors with multicomponent order parameter in lattices with three- and sixfold rotational symmetries support a charge-4e vestigial superconducting phase above T c . The charge-4e state, which is a condensate of four-electron bound states that preserve the rotational symmetry of the lattice, is nearly degenerate with a competing vestigial nematic state, which is nonsuperconducting and breaks the rotational symmetry. This robust result is the consequence of a hidden discrete symmetry in the Ginzburg-Landau theory, which permutes quantities in the gauge sector and in the crystalline sector of the symmetry group. We argue that random strain generally favors the charge-4e state over the nematic phase, as it acts as a random mass to the former but as a random field to the latter. Furthermore, we propose that two-dimensional inhomogeneous systems displaying nematic superconductivity, such as twisted bilayer graphene, provide a promising platform to realize the elusive charge-4e superconducting phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Phenomenology of Spectral Functions in Disordered Spin Chains at Infinite Temperature

Studies of disordered spin chains have recently experienced a renewed interest, inspired by the question to which extent the exact numerical calculations comply with the existence of a many-body localization phase transition. For the paradigmatic random field Heisenberg spin chains, many intriguing features were observed when the disorder is considerable compared to the spin interaction strength. Here, we introduce a phenomenological theory that may explain some of those features. The theory is based on the proximity to the noninteracting limit, in which the system is an Anderson insulator. Taking the spin imbalance as an exemplary observable, we demonstrate that the proximity to the local integrals of motion of the Anderson insulator determines the dynamics of the observable at infinite temperature. In finite interacting systems our theory quantitatively describes its integrated spectral function for a wide range of disorders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cooperative spin coupling in PrFeO3

A transition from crystal-field to spin wave excitations has been experimentally observed in PrFeO3 using inelastic neutron scattering. Theoretical modeling with density functional theory and the mean field random phase approximation successfully reproduces the experimental observations and allows extraction of the values for the various exchange interactions. The study reveals that the strong coupling between the two magnetic sublattices of Pr and Fe is the fundamental mechanism underlying the low-temperature Pr magnetism. This coupling, analogous to the Dicke cooperative interaction between atoms and photons, polarizes the Pr moments, enhances the Pr-Pr interactions, and contributes to the formation of a quasidoublet, leading to the transition from single-particle to collective excitations within the Pr sublattice. Furthermore, this coupling induces spin reorientation on the Fe sublattice. The manipulation of magnetic moments via spin waves is achievable through the coupling between different magnetic sublattices in a bulk material containing multiple magnetic ions.

Garlea, Vasile [ORNL] (ORCID:0000000253227271)↗

Convolutional Dictionary Regularizers for Tomographic Inversion

There has been a growing interest in the use of data-driven regularizers to solve inverse problems associated with computational imaging systems. The convolutional sparse representation model has recently gained attention, driven by the development of fast algorithms for solving the dictionary learning and sparse coding problems for sufficiently large images and data sets. Nevertheless, this model has seen very limited application to tomographic reconstruction problems. In this paper, we present a model-based tomographic reconstruction algorithm using a learnt convolutional dictionary as a regularizer. The key contribution is the use of a data-dependent weighting scheme for the l 1 regularization to construct an effective denoising method that is integrated into the inversion using the Plug-and-Play reconstruction framework. Using simulated data sets we demonstrate that our approach can improve performance over traditional regularizers based on a Markov random field model and a patch-based sparse representation model for sparse and limited-view tomographic data sets.

Singanallur Vaidyanathan, Venkatakrishnan↗

Building Extraction at Scale Using Convolutional Neural Network: Mapping of the United States

Establishing up-to-date large scale building maps is essential to understand the urban dynamics, such as estimating population, urban planning, and many other applications. Although many computer vision tasks have been successfully carried out with deep convolutional neural networks, there is a growing need to understand their large scale impact on building mapping with remote sensing imagery. In this paper, taking advantage of the scalability of convolutional neural networks (CNNs) and using only few areas with the abundance of building footprints, for the first time we conduct a comparative analysis of four state-of-the-art CNNs for extracting building footprints across the entire continental United States. The four CNN architectures namely: Branch-out CNN, fully convolutional network (FCN), conditional random field as recurrent neural network (CRFasRNN), and SegNet, support semantic pixelwise labeling and focus on capturing textural information at multiscale. We use 1-meter resolution aerial images from National Agriculture Imagery Program as the test-bed, and compare the extraction results across the four methods. In addition, we propose to combine signed-distance labels with SegNet, the preferred CNN architecture identified by our extensive evaluations, to advance building extraction results to instance level. We further demonstrate the usefulness of fusing additional near IR information into the building extraction framework. Large scale experimental evaluations are conducted and reported using metrics that include: Precision, recall rate, intersection over union, and the number of buildings extracted. With the improved CNN model and no requirement of further postprocessing, we have generated building maps for the United States with an average processing time less than one minute for an area of size &#x223C;<!-- ~ --> 56 km 2 . Finally, the quality of extracted buildings and processing time demonstrated that the proposed CNN based framework fits the need of building extraction at scale.

97 MATHEMATICS AND COMPUTING↗

Distinguishing one from many using super-resolution compressive sensing

We present that distinguishing whether a signal corresponds to a single source or a limited number of highly overlapping point spread functions (PSFs) is a ubiquitous problem across all imaging scales, whether detecting receptor-ligand interactions in cells or detecting binary stars. Super-resolution imaging based upon compressed sensing exploits the relative sparseness of the point sources to successfully resolve sources which may be separated by much less than the Rayleigh criterion. However, as a solution to an underdetermined system of linear equations, compressive sensing requires the imposition of constraints which may not always be valid. One typical constraint is that the PSF is known. However, the PSF of the actual optical system may reflect aberrations not present in the theoretical ideal optical system. Even when the optics are well characterized, the actual PSF may reflect factors such as non-uniform emission of the point source (e.g. fluorophore dipole emission). As such, the actual PSF may differ from the PSF used as a constraint. Similarly, multiple different regularization constraints have been suggested including the l 1 -norm, l 0 -norm, and generalized Gaussian Markov random fields (GGMRFs), each of which imposes a different constraint. Other important factors include the signal-to-noise ratio of the point sources and whether the point sources vary in intensity. In this work, we explore how these factors influence super-resolution image recovery robustness, determining the sensitivity and specificity. In conclusion, we determine an approach that is more robust to the types of PSF errors present in actual optical systems.

42 ENGINEERING↗

Development and testing of texture discriminators for the analysis of trabecular bone in proximal femur radiographs

Purpose: Texture analysis of femur radiographs may serve as a potential low cost technique to predict osteoporotic fracture risk and has received considerable attention in the past years. A further application of this technique may be the measurement of the quality of specific bone compartments to provide useful information for treatment of bone fractures. Two challenges of texture analysis are the selection of the best suitable texture measure and reproducible placement of regions of interest (ROIs). The goal of this in vitro study was to automatically place ROIs in radiographs of proximal femur specimens and to calculate correlations between various different texture analysis methods and the femurs' anchorage strength. Methods: Radiographs were obtained from 14 femoral specimens and bone mineral density (BMD) was measured in the femoral neck. Biomechanical testing was performed to assess the anchorage strength in terms of failure load, breakaway torque, and number of cycles. Images were segmented using a framework that is based on the usage of level sets and statistical in-shape models. Five ROIs were automatically placed in the head, upper and lower neck, trochanteric, and shaft compartment in an atlas subject. All other subjects were registered rigidly, affinely, and nonlinearly, and the resulting transformation was used to map the five ROIs onto the individual femora. Results: In each ROI, texture features were extracted using gray level co-occurence matrices (GLCM), third-order GLCM, morphological gradients (MGs), Minkowski dimensions (MDs), Minkowski functionals (MFs), Gaussian Markov random fields, and scaling index method (SIM). Coefficients of determination for each texture feature with parameters of anchorage strength were computed. In a stepwise multiregression analysis, the most predictive parameters were identified in different models. Texture features were highly correlated with anchorage strength estimated by the failure load of up to R{sup 2}=0.61 (MF and MG features, p<0.01) and were partially independent of BMD. The correlations were dependent on the choice of the ROI and the texture measure. The best predictive multiregression model for failure load R{sub adj}{sup 2}=0.86 (p<0.001) included a set of recently developed texture methods (MF and SIM) but excluded bone mineral density and commonly used texture measures. Conclusions: The results suggest that texture information contained in trabecular bone structure visualized on radiographs may predict whether an implant anchorage can be used and may determine the local bone quality from preoperative radiographs.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Statistical CT noise reduction with multiscale decomposition and penalized weighted least squares in the projection domain

Purposes: The suppression of noise in x-ray computed tomography (CT) imaging is of clinical relevance for diagnostic image quality and the potential for radiation dose saving. Toward this purpose, statistical noise reduction methods in either the image or projection domain have been proposed, which employ a multiscale decomposition to enhance the performance of noise suppression while maintaining image sharpness. Recognizing the advantages of noise suppression in the projection domain, the authors propose a projection domain multiscale penalized weighted least squares (PWLS) method, in which the angular sampling rate is explicitly taken into consideration to account for the possible variation of interview sampling rate in advanced clinical or preclinical applications. Methods: The projection domain multiscale PWLS method is derived by converting an isotropic diffusion partial differential equation in the image domain into the projection domain, wherein a multiscale decomposition is carried out. With adoption of the Markov random field or soft thresholding objective function, the projection domain multiscale PWLS method deals with noise at each scale. To compensate for the degradation in image sharpness caused by the projection domain multiscale PWLS method, an edge enhancement is carried out following the noise reduction. The performance of the proposed method is experimentally evaluated and verified using the projection data simulated by computer and acquired by a CT scanner. Results: The preliminary results show that the proposed projection domain multiscale PWLS method outperforms the projection domain single-scale PWLS method and the image domain multiscale anisotropic diffusion method in noise reduction. In addition, the proposed method can preserve image sharpness very well while the occurrence of 'salt-and-pepper' noise and mosaic artifacts can be avoided. Conclusions: Since the interview sampling rate is taken into account in the projection domain multiscale decomposition, the proposed method is anticipated to be useful in advanced clinical and preclinical applications where the interview sampling rate varies.

60 APPLIED LIFE SCIENCES↗

Combined iterative reconstruction and image-domain decomposition for dual energy CT using total-variation regularization

Purpose: Dual-energy CT (DECT) is being increasingly used for its capability of material decomposition and energy-selective imaging. A generic problem of DECT, however, is that the decomposition process is unstable in the sense that the relative magnitude of decomposed signals is reduced due to signal cancellation while the image noise is accumulating from the two CT images of independent scans. Direct image decomposition, therefore, leads to severe degradation of signal-to-noise ratio on the resultant images. Existing noise suppression techniques are typically implemented in DECT with the procedures of reconstruction and decomposition performed independently, which do not explore the statistical properties of decomposed images during the reconstruction for noise reduction. In this work, the authors propose an iterative approach that combines the reconstruction and the signal decomposition procedures to minimize the DECT image noise without noticeable loss of resolution. Methods: The proposed algorithm is formulated as an optimization problem, which balances the data fidelity and total variation of decomposed images in one framework, and the decomposition step is carried out iteratively together with reconstruction. The noise in the CT images from the proposed algorithm becomes well correlated even though the noise of the raw projections is independent on the two CT scans. Due to this feature, the proposed algorithm avoids noise accumulation during the decomposition process. The authors evaluate the method performance on noise suppression and spatial resolution using phantom studies and compare the algorithm with conventional denoising approaches as well as combined iterative reconstruction methods with different forms of regularization. Results: On the Catphan©600 phantom, the proposed method outperforms the existing denoising methods on preserving spatial resolution at the same level of noise suppression, i.e., a reduction of noise standard deviation by one order of magnitude. This improvement is mainly attributed to the high noise correlation in the CT images reconstructed by the proposed algorithm. Iterative reconstruction using different regularization, including quadratic orq-generalized Gaussian Markov random field regularization, achieves similar noise suppression from high noise correlation. However, the proposed TV regularization obtains a better edge preserving performance. Studies of electron density measurement also show that our method reduces the average estimation error from 9.5% to 7.1%. On the anthropomorphic head phantom, the proposed method suppresses the noise standard deviation of the decomposed images by a factor of ∼14 without blurring the fine structures in the sinus area. Conclusions: The authors propose a practical method for DECT imaging reconstruction, which combines the image reconstruction and material decomposition into one optimization framework. Compared to the existing approaches, our method achieves a superior performance on DECT imaging with respect to decomposition accuracy, noise reduction, and spatial resolution.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-J-224: Multimodality Segmentation of Head and Neck Tumors

Purpose: Develop an algorithm that is able to automatically segment tumor volume in Head and Neck cancer by integrating information from CT, PET and MR imaging simultaneously. Methods: Twenty three patients that were recruited under an adaptive radiotherapy protocol had MR, CT and PET/CT scans within 2 months prior to start of radiotherapy. The patients had unresectable disease and were treated either with chemoradiotherapy or radiation therapy alone. Using the Velocity software, the PET/CT and MR (T1 weighted+contrast) scans were registered to the planning CT using deformable and rigid registration respectively. The PET and MR images were then resampled according to the registration to match the planning CT. The resampled images, together with the planning CT, were fed into a multi-channel segmentation algorithm, which is based on Gaussian mixture models and solved with the expectation-maximization algorithm and Markov random fields. A rectangular region of interest (ROI) was manually placed to identify the tumor area and facilitate the segmentation process. The auto-segmented tumor contours were compared with the gross tumor volume (GTV) manually defined by the physician. The volume difference and Dice similarity coefficient (DSC) between the manual and autosegmented GTV contours were calculated as the quantitative evaluation metrics. Results: The multimodality segmentation algorithm was applied to all 23 patients. The volumes of the auto-segmented GTV ranged from 18.4cc to 32.8cc. The average (range) volume difference between the manual and auto-segmented GTV was −42% (−32.8%–63.8%). The average DSC value was 0.62, ranging from 0.39 to 0.78. Conclusion: An algorithm for the automated definition of tumor volume using multiple imaging modalities simultaneously was successfully developed and implemented for Head and Neck cancer. This development along with more accurate registration algorithms can aid physicians in the efforts to interpret the multitude of imaging information available in radiotherapy today. This project was supported by a grant by Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is supported by NIH/NIBIB (1R01-EB016777), National Natural Science Foundation of China (No.61471226 and No.61201441), Research funding from Shandong Province (No.BS2012DX038 and No.J12LN23), and Research funding from Jinan City (No.201401221 and No.20120109)

60 APPLIED LIFE SCIENCES↗

A multimodality segmentation framework for automatic target delineation in head and neck radiotherapy

Purpose: To develop an automatic segmentation algorithm integrating imaging information from computed tomography (CT), positron emission tomography (PET), and magnetic resonance imaging (MRI) to delineate target volume in head and neck cancer radiotherapy. Methods: Eleven patients with unresectable disease at the tonsil or base of tongue who underwent MRI, CT, and PET/CT within two months before the start of radiotherapy or chemoradiotherapy were recruited for the study. For each patient, PET/CT and T1-weighted contrast MRI scans were first registered to the planning CT using deformable and rigid registration, respectively, to resample the PET and magnetic resonance (MR) images to the planning CT space. A binary mask was manually defined to identify the tumor area. The resampled PET and MR images, the planning CT image, and the binary mask were fed into the automatic segmentation algorithm for target delineation. The algorithm was based on a multichannel Gaussian mixture model and solved using an expectation–maximization algorithm with Markov random fields. To evaluate the algorithm, we compared the multichannel autosegmentation with an autosegmentation method using only PET images. The physician-defined gross tumor volume (GTV) was used as the “ground truth” for quantitative evaluation. Results: The median multichannel segmented GTV of the primary tumor was 15.7 cm{sup 3} (range, 6.6–44.3 cm{sup 3}), while the PET segmented GTV was 10.2 cm{sup 3} (range, 2.8–45.1 cm{sup 3}). The median physician-defined GTV was 22.1 cm{sup 3} (range, 4.2–38.4 cm{sup 3}). The median difference between the multichannel segmented and physician-defined GTVs was −10.7%, not showing a statistically significant difference (p-value = 0.43). However, the median difference between the PET segmented and physician-defined GTVs was −19.2%, showing a statistically significant difference (p-value =0.0037). The median Dice similarity coefficient between the multichannel segmented and physician-defined GTVs was 0.75 (range, 0.55–0.84), and the median sensitivity and positive predictive value between them were 0.76 and 0.81, respectively. Conclusions: The authors developed an automated multimodality segmentation algorithm for tumor volume delineation and validated this algorithm for head and neck cancer radiotherapy. The multichannel segmented GTV agreed well with the physician-defined GTV. The authors expect that their algorithm will improve the accuracy and consistency in target definition for radiotherapy.

60 APPLIED LIFE SCIENCES↗

MO-DE-207A-09: Low-Dose CT Image Reconstruction Via Learning From Different Patient Normal-Dose Images

Purpose: To investigate a novel low-dose CT (LdCT) image reconstruction strategy for lung CT imaging in radiation therapy. Methods: The proposed approach consists of four steps: (1) use the traditional filtered back-projection (FBP) method to reconstruct the LdCT image; (2) calculate structure similarity (SSIM) index between the FBP-reconstructed LdCT image and a set of normal-dose CT (NdCT) images, and select the NdCT image with the highest SSIM as the learning source; (3) segment the NdCT source image into lung and outside tissue regions via simple thresholding, and adopt multiple linear regression to learn high-order Markov random field (MRF) pattern for each tissue region in the NdCT source image; (4) segment the FBP-reconstructed LdCT image into lung and outside regions as well, and apply the learnt MRF prior in each tissue region for statistical iterative reconstruction of the LdCT image following the penalized weighted least squares (PWLS) framework. Quantitative evaluation of the reconstructed images was based on the signal-to-noise ratio (SNR), local binary pattern (LBP) and histogram of oriented gradients (HOG) metrics. Results: It was observed that lung and outside tissue regions have different MRF patterns predicted from the NdCT. Visual inspection showed that our method obviously outperformed the traditional FBP method. Comparing with the region-smoothing PWLS method, our method has, in average, 13% increase in SNR, 15% decrease in LBP difference, and 12% decrease in HOG difference from reference standard for all regions of interest, which indicated the superior performance of the proposed method in terms of image resolution and texture preservation. Conclusion: We proposed a novel LdCT image reconstruction method by learning similar image characteristics from a set of NdCT images, and the to-be-learnt NdCT image does not need to be scans from the same subject. This approach is particularly important for enhancing image quality in radiation therapy.

60 APPLIED LIFE SCIENCES↗

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗

Sequential Learning with Active Partial Labeling for Building Metadata

Modern buildings are instrumented with thousands of sensing and control points. The ability to automatically extract the physical context of each point, e.g., the type, location, and relationship with other points, is the key to enabling building analytics at scale. However, this process is costly as it usually requires domain expertise with a deep understanding of the building system and its point naming scheme. In this study, we aim to reduce the human effort required for mapping sensors to their context, i.e., metadata mapping. We formulate the problem as a sequential labeling process and use the conditional random field to exploit the regular and dependent structures observed in the metadata. We develop a suite of active learning strategies to adaptively select the most informative subsequences in point names for human labeling, which significantly reduces the inputs from domain experts.We evaluated our approach on three different buildings and observed encouraging performance in metadata mapping from the proposed solution.

99 GENERAL AND MISCELLANEOUS↗

Parallel Element Agglomeration Multilevel Monte Carlo Library (ParELAGMC)

ParELAGMC is a parallel distributed memory C++ library for multilevel Monte Carlo (MLMC) simulations with algebraically constructed coarse spaces for estimating statistical moments of a quantity of interest involving solutions of partial differential equations with uncertain coefficients. A primary focus of the library is the scalable generation of Gaussian random fields using a novel stochastic PDE (SPDE) sampling technique for large-scale simulations. A key feature in the SPDE sampling technique is a novel non-matching mesh embedding technique to mitigate artificial boundary artifacts that are inherent in the method. Example applications to uncertainty quantification of subsurface flow simulations in the mixed finite element setting are provided as well.

Osborn, SarahV.↗