Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse direct method”

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 181 records · Page 10

Sparse measurement medical CT reconstruction using multi-fused block matching denoising priors

A major challenge for medical X-ray CT imaging is reducing the number of X-ray projections to lower radiation dosage and reduce scan times without compromising image quality. However these under-determined inverse imaging problems rely on the formulation of an expressive prior model to constrain the solution space while remaining computationally tractable. Traditional analytical reconstruction methods like Filtered Back Projection (FBP) often fail with sparse measurements, producing artifacts due to their reliance on the Shannon-Nyquist Sampling Theorem. Consensus Equilibrium, which is a generalization of Plug and Play, is a recent advancement in Model-Based Iterative Reconstruction (MBIR), has facilitated the use of multiple denoisers are prior models in an optimization free framework to capture complex, non-linear prior information. However, 3D prior modelling in a Plug and Play approach for volumetric image reconstruction requires long processing time due to high computing requirement. Instead of directly using a 3D prior, this work proposes a BM3D Multi Slice Fusion (BM3D-MSF) prior that uses multiple 2D image denoisers fused to act as a fully 3D prior model in Plug and Play reconstruction approach. Our approach does not require training and are thus able to circumvent ethical issues related with patient training data and are readily deployable in varying noise and measurement sparsity levels. In addition, reconstruction with the BM3D-MSF prior achieves similar reconstruction image quality as fully 3D image priors, but with significantly reduced computational complexity. We test our method on clinical CT data and demonstrate that our approach improves reconstructed image quality.

Hossain, Maliha [ORNL]↗

An empirical investigation of methods for nonsymmetric linear systems

The present investigation is concerned with a comparison of methods for solving linear algebraic systems which arise from finite difference discretizations of the elliptic convection-diffusion equation in a planar region Omega with Dirichlet boundary conditions. Such linear systems are typically of the form Ax = b where A is an N x N sparse nonsymmetric matrix. In a discussion of discretizations, it is assumed that a regular rectilinear mesh of width h has been imposed on Omega. The discretizations considered include central differences, upstream differences, and modified upstream differences. Six methods for solving Ax = b are considered. Three variants of Gaussian elimination have been chosen as representatives of state-of-the-art software for direct methods under different assumptions about pivoting. Three iterative methods are also included.

Sherman, A. H.↗

Inverse transport problem solvers based on regularized and compressive sensing techniques

According to the direct exposure measurements from flash radiographic image, regularized-based method and compressive sensing (CS)-based method for inverse transport equation are presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. With a large number of measurements, least-square method is utilized to complete the reconstruction. Owing to the ill-posedness of the inverse problems, regularized algorithm is employed. Tikhonov method is applied with an appropriate posterior regularization parameter to get a meaningful solution. However, it's always very costly to obtain enough measurements. With limited measurements, CS sparse reconstruction technique Orthogonal Matching Pursuit (OMP) is applied to obtain the sparse coefficients by solving an optimization problem. This paper constructs and takes the forward projection matrix rather than Gauss matrix as measurement matrix. In the CS-based algorithm, Fourier expansion and wavelet expansion are adopted to convert an underdetermined system to a well-posed system. Simulations and numerical results of regularized method with appropriate regularization parameter and that of CS-based agree well with the reference value, furthermore, both methods avoid amplifying the noise. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Inference of phase field fracture models

The phase field approach to modeling fracture uses a diffuse damage field to represent cracks. This representation mollifies singularities that arise in computations with sharp interface models and some of the resultant difficulties in the mathematical and numerical treatment of fracture. Phase field fracture models have proven effective at representing crack propagation, branching, and merging. Specific formulations, beginning with brittle fracture, have also been shown to converge to classical solutions. Extensions to cover the range of material failure, including ductile and cohesive fracture, lead to an array of possible models. There exists a large body of literature focusing on this class of models and on the impact of model form on the predicted crack evolution. However, there have not been systematic studies into how optimal models may be chosen. Here, we take a first step in this direction by developing formal methods for identification of the best parsimonious model of phase field fracture given full-field data on the damage and deformation fields. We consider some of the main models that have been used for the degradation of elastic response due to damage and its propagation. Our approach builds upon Variational System Identification (VSI), a weak form variant of the Sparse Identification of Nonlinear Dynamics (SINDy). Furthermore, in this first communication we focus on synthetically generated data but we also consider central issues associated with the use of experimental full-field data, such as data sparsity and noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CodEx: A Modular Framework for Joint Temporal De-Blurring and Tomographic Reconstruction

In many computed tomography (CT) imaging applications, it is important to rapidly collect data from an object that is moving or changing with time. Tomographic acquisition is generally assumed to be step-and-shoot, where the object is rotated to each desired angle, and a view is taken. However, step-and-shoot acquisition is slow and can waste photons, so in practice fly-scanning is done where the object is continuously rotated while collecting data. However, this can result in motion-blurred views and consequently reconstructions with severe motion artifacts. In this paper, we introduce CodEx, a modular framework for joint de-blurring and tomographic reconstruction that can effectively invert the motion blur introduced in sparse view fly-scanning. The method is a synergistic combination of a novel acquisition method with a novel non-convex Bayesian reconstruction algorithm. CodEx works by encoding the acquisition with a known binary code that the reconstruction algorithm then inverts. Using a well chosen binary code to encode the measurements can improve the accuracy of the inversion process. The CodEx reconstruction method uses the alternating direction method of multipliers (ADMM) to split the inverse problem into iterative deblurring and reconstruction sub-problems, making reconstruction practical to implement. Here we present reconstruction results on both simulated and binned experimental data to demonstrate the effectiveness of our method.

42 ENGINEERING↗

Learning Physically Interpretable Atmospheric Models From Data With WSINDy

The multiscale and turbulent nature of Earth's atmosphere has historically rendered accurate weather modeling a hard problem. Recently, there has been an explosion of interest surrounding data-driven approaches to weather modeling, which in many cases show improved forecasting accuracy and computational efficiency when compared to traditional methods. However, many of the current data-driven approaches employ highly parameterized neural networks, often resulting in uninterpretable models and limited gains in scientific understanding. In this work, we address the interpretability problem by explicitly discovering partial differential equations governing atmospheric phenomena, identifying symbolic mathematical models with direct physical interpretations. The purpose of this paper is to demonstrate that, in particular, the weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm can learn effective atmospheric models from both simulated and assimilated data. Our approach adapts the standard WSINDy algorithm to work with high-dimensional fluid data of arbitrary spatial dimension.

58 GEOSCIENCES↗

Inter-Disciplinary Collaboration in Support of the Post-Standby TREAT Mission

Although analysis methods have advanced significantly in the last two decades, high fidelity multi- physics methods for reactors systems have been under development for only a few years and are not presently mature nor deployed. Furthermore, very few methods provide the ability to simulate rapid transients in three dimensions. Data for validation of advanced time-dependent multi- physics is sparse; at TREAT, historical data were not collected for the purpose of validating three-dimensional methods, let alone multi-physics simulations. Existing data continues to be collected to attempt to simulate the behavior of experiments and calibration transients, but it will be insufficient for the complete validation of analysis methods used for TREAT transient simulations. Hence, a 2018 restart will most likely occur without the direct application of advanced modeling and simulation methods. At present, the current INL modeling and simulation team plans to work with TREAT operations staff in performing reactor simulations with MAMMOTH, in parallel with the software packages currently being used in preparation for core restart (e.g., MCNP5, RELAP5, ABAQUS). The TREAT team has also requested specific measurements to be performed during startup testing, currently scheduled to run from February to August of 2018. These startup measurements will be crucial in validating the new analysis methods in preparation for ultimate application for TREAT operations and experiment design. This document describes the collaboration between modeling and simulation staff and restart, operations, instrumentation and experiment development teams to be able to effectively interact and achieve successful validation work during restart testing.

97 MATHEMATICS AND COMPUTING↗

Highly Parallel Solver for Multi-scale Parquet Quantum Modeling of Strongly Correlated Materials

The parquet formalism to calculate the two-particle Green s functions of large systems requires the solution of a large, sparse, complex system of quadratic equations. If Nf Matsubara frequencies are used for a system of size Nc , and Newton s method is used to solve the nonlinear system, the Jacobian system has O(8Nt^3 ) variables and O(40Nt^4 ) complex entries where Nt = Nc Nf . For Nt = 1024, the nonlinear system has over 8.5 billion degrees of freedom and the sparse Jacobian will require over 351 TBytes of memory. The Jacobian is very expensive to store but the matrix-vector products can be computed directly. We are developing a highly scalable parallel solver that uses both OpenMP and MPI to exploit the multicore nodes. We present initial scalability results on the Cray XT5 that suggests the code can be scaled to solve larger problems with Nt 1024.

97 MATHEMATICS AND COMPUTING↗

Complex Sources and Impacts on Remediation and Monitoring Approaches

Remedy selection, implementation, and coordination with tank farm activities for adjacent waste sites need to be facilitated by a technically defensible description of sources and their relative strength and temporal contributions to groundwater contamination. Detailed data describing contaminant source releases are typically not available, so source locations are highly uncertain. Furthermore, data on sources and model parameters are not readily available through direct measurements. Instead, source data are often derived by extrapolation from a few direct and/or indirect measurements, while model parameters are commonly estimated using inverse modeling or calibration methods. Because the conceptual model of sources will influence the mass and timing of the flux of contaminants to groundwater, uncertainty in the source terms should be considered. Even though a best-fit model can often be identified, it may not be the best representation of the sources given the sparse, uncertain nature of the data used for estimating source terms. To support future feasibility studies, a systematic approach is needed for identifying remediation and monitoring activities appropriate under conditions of uncertainty. In this study, an integrated assessment of alternative conceptual model elements has been examined using the B-Complex site in the Hanford Central Plateau to demonstrate how multiple sources in a waste management complex can be described to identify their relative contributions to groundwater. The heterogeneous structure of the system is modeled based on available field information on the lithological data for both the vadose zone and aquifer. The approach includes a simulation assessment and linkages to site data, with an uncertainty analysis applied to evaluate the effects of source term uncertainty on contaminant mass flux to groundwater. An integrated assessment of alternative conceptual model elements was evaluated to identify how parameter uncertainty impacts both temporal and spatial uncertainties associated with vadose zone source terms. Modeling scenarios identify important characteristics of remediation target zones to provide context for how surface barriers, in situ remedies, and water-table treatment zones can be designed to account for source dynamics. Ramifications for remediation and monitoring are discussed within the context of the source term uncertainty. The described approach facilitates systematically addressing alternative conceptual model questions in relation to remediation and monitoring and supports the remedial investigation/ feasibility study process and the remediation strategy development for the Hanford Central Plateau.

Rockhold, Mark L.↗

Complex Sources and Impacts on Remediation and Monitoring Approaches - 19058

Remedy selection, implementation, and coordination with tank farm activities for adjacent waste sites need to be facilitated by a technically defensible description of sources and their relative strength and temporal contributions to groundwater contamination. Detailed data describing contaminant source releases are typically not available, so source locations are highly uncertain. Furthermore, data on sources and model parameters are not readily available through direct measurements. Instead, source data are often derived by extrapolation from a few direct and/or indirect measurements, while model parameters are commonly estimated using inverse modeling or calibration methods. Because the conceptual model of sources will influence the mass and timing of the flux of contaminants to groundwater, uncertainty in the source terms should be considered. Even though a best-fit model can often be identified, it may not be the best representation of the sources given the sparse, uncertain nature of the data used for estimating source terms. To support future feasibility studies, a systematic approach is needed for identifying remediation and monitoring activities appropriate under conditions of uncertainty. In this study, an integrated assessment of alternative conceptual model elements has been examined using the B-Complex site in the Hanford Central Plateau to demonstrate how multiple sources in a waste management complex can be described to identify their relative contributions to groundwater. The heterogeneous structure of the system is modeled based on available field information on the lithological data for both the vadose zone and aquifer. The approach includes a simulation assessment and linkages to site data, with an uncertainty analysis applied to evaluate the effects of source term uncertainty on contaminant mass flux to groundwater. An integrated assessment of alternative conceptual model elements was evaluated to identify how parameter uncertainty impacts both temporal and spatial uncertainties associated with vadose zone source terms. Modeling scenarios identify important characteristics of remediation target zones to provide context for how surface barriers, in situ remedies, and water-table treatment zones can be designed to account for source dynamics. Ramifications for remediation and monitoring are discussed within the context of the source term uncertainty. The described approach facilitates systematically addressing alternative conceptual model questions in relation to remediation and monitoring and supports the remedial investigation/ feasibility study process and the remediation strategy development for the Hanford Central Plateau. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Implementing abstract multigrid or multilevel methods

Multigrid methods can be formulated as an algorithm for an abstract problem that is independent of the partial differential equation, domain, and discretization method. In such an abstract setting, problems not arising from partial differential equations can be treated. A general theory exists for linear problems. The general theory was motivated by a series of abstract solvers (Madpack). The latest version was motivated by the theory. Madpack now allows for a wide variety of iterative and direct solvers, preconditioners, and interpolation and projection schemes, including user callback ones. It allows for sparse, dense, and stencil matrices. Mildly nonlinear problems can be handled. Also, there is a fast, multigrid Poisson solver (two and three dimensions). The type of solvers and design decisions (including language, data structures, external library support, and callbacks) are discussed. Based on the author's experiences with two versions of Madpack, a better approach is proposed. This is based on a mixed language formulation (C and FORTRAN + preprocessor). Reasons for not using FORTRAN, C, or C++ (individually) are given. Implementing the proposed strategy is not difficult.

Douglas, Craig C.↗

Experiments in Reconstructing Twentieth-Century Sea Levels

One approach to reconstructing historical sea level from the relatively sparse tide-gauge network is to employ Empirical Orthogonal Functions (EOFs) as interpolatory spatial basis functions. The EOFs are determined from independent global data, generally sea-surface heights from either satellite altimetry or a numerical ocean model. The problem is revisited here for sea level since 1900. A new approach to handling the tide-gauge datum problem by direct solution offers possible advantages over the method of integrating sea-level differences, with the potential of eventually adjusting datums into the global terrestrial reference frame. The resulting time series of global mean sea levels appears fairly insensitive to the adopted set of EOFs. In contrast, charts of regional sea level anomalies and trends are very sensitive to the adopted set of EOFs, especially for the sparser network of gauges in the early 20th century. The reconstructions appear especially suspect before 1950 in the tropical Pacific. While this limits some applications of the sea-level reconstructions, the sensitivity does appear adequately captured by formal uncertainties. All our solutions show regional trends over the past five decades to be fairly uniform throughout the global ocean, in contrast to trends observed over the shorter altimeter era. Consistent with several previous estimates, the global sea-level rise since 1900 is 1.70 +/- 0.26 mm/yr. The global trend since 1995 exceeds 3 mm/yr which is consistent with altimeter measurements, but this large trend was possibly also reached between 1935 and 1950.

Ray, Richard D.↗

Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used technique proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗

Performance issues for iterative solvers in device simulation

Due to memory limitations, iterative methods have become the method of choice for large scale semiconductor device simulation. However, it is well known that these methods still suffer from reliability problems. The linear systems which appear in numerical simulation of semiconductor devices are notoriously ill-conditioned. In order to produce robust algorithms for practical problems, careful attention must be given to many implementation issues. This paper concentrates on strategies for developing robust preconditioners. In addition, effective data structures and convergence check issues are also discussed. These algorithms are compared with a standard direct sparse matrix solver on a variety of problems.

Fan, Qing↗

Comparison of sparse domain approaches for 4D SPECT dynamic image reconstruction

Purpose: Dynamic imaging (DI) provides additional diagnostic information in emission tomography in comparison to conventional static imaging at the cost of being computationally more challenging. Dynamic single photon emission computed tomography (SPECT) reconstruction is particularly difficult because of the limitations in the sampling geometry present in most existing scanners. We have developed an algorithm Spline Initialized Factor Analysis of Dynamic Structures (SIFADS) that is a matrix factorization method for reconstructing the dynamics of tracers in tissues and blood directly from the projections in dynamic cardiac SPECT, without first resorting to any 3D reconstruction. Methods: SIFADS is different from "pure" factor analysis in dynamic structures (FADS) in that it employs a dedicated spline-based pre-initialization. In this paper, we analyze the convergence properties of SIFADS and FADS using multiple metrics. The performances of the two approaches are evaluated for numerically simulated data and for real dynamic SPECT data from canine and human subjects. Results: For SIFADS, metrics analyzed for reconstruction algorithm convergence show better features of the metric curves vs iterations. In addition, SIAFDS provides better tissue segmentations than that from pure FADS. Measured computational times are also typically better for SIFADS implementations than those with pure FADS. Conclusion: The analysis supports the utility of the pre-initialization of a factorization algorithm for better dynamic SPECT image reconstruction.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Lanczos eigensolution method for high-performance computers

The theory, computational analysis, and applications are presented of a Lanczos algorithm on high performance computers. The computationally intensive steps of the algorithm are identified as: the matrix factorization, the forward/backward equation solution, and the matrix vector multiples. These computational steps are optimized to exploit the vector and parallel capabilities of high performance computers. The savings in computational time from applying optimization techniques such as: variable band and sparse data storage and access, loop unrolling, use of local memory, and compiler directives are presented. Two large scale structural analysis applications are described: the buckling of a composite blade stiffened panel with a cutout, and the vibration analysis of a high speed civil transport. The sequential computational time for the panel problem executed on a CONVEX computer of 181.6 seconds was decreased to 14.1 seconds with the optimized vector algorithm. The best computational time of 23 seconds for the transport problem with 17,000 degs of freedom was on the the Cray-YMP using an average of 3.63 processors.

Bostic, Susan W.↗

Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement

We report thatpProbing is a general technique that is used to reduce the variance of the Hutchinson stochastic estimator for the trace of the inverse of a large, sparse matrix A. The variance of the estimator is the sum of the squares of the off-diagonal elements of A -1 . Therefore, this technique computes probing vectors that when used in the estimator annihilate the largest off-diagonal elements. For matrices that display decay of the magnitude of |A$^{-1}_{ij}$| with the graph distance between nodes i and j, this is achieved through graph coloring of increasing powers A k . Equivalently, when a matrix stems from a lattice discretization, it is computationally beneficial to find a distance-k coloring of the lattice. Previously, a hierarchical coloring was proposed so that k can be increased at runtime as needed without discarding previous work. In this work, we study probing for the more general problem of computing the trace of a permutation of A -1 , say PA -1 . The motivation comes from lattice quantum chromodynamics (QCD), where we need to construct “disconnected diagrams” to extract flavor-separated generalized parton functions. In lattice QCD, where the matrix has a four-dimensional toroidal lattice structure, these nonlocal operators correspond to a PA -1 , where P is the permutation relating to some displacement $\vec{p}$ in one or more dimensions. We focus on a single dimension displacement (p), but our methods are general. We show that probing on A k or (PA) k does not annihilate the largest magnitude elements. To resolve this issue, our displacement-based probing works on PA k using a new coloring scheme that works directly on appropriately displaced neighborhoods on the lattice. We prove lower bounds on the number of colors needed and study the effect of this scheme on variance reduction, both theoretically and experimentally on a real-world lattice QCD calculation. We achieve orders of magnitude speedup over the unprobed or the naively probed methods.

97 MATHEMATICS AND COMPUTING↗