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 73 records · Page 4

Stratigraphic Identification with Airborne Electromagnetic Methods at the Hanford Site, Washington

Stratigraphic units can influence the fate and transport of subsurface contaminants within groundwater. Units having coarse-grained sediments act as preferential flow pathways, and therefore can accelerate the transport of contaminants to reach human and ecological receptors. At legacy waste sites, detailed knowledge of subsurface stratigraphy can be used for effective monitoring and remediation planning to help minimize risk to human health and the environment. Airborne electromagnetic (AEM) methods can non-invasively provide information on kilometer-scale or larger subsurface stratigraphic features and fill informational gaps in directly sampled data from sparsely located boreholes. In this paper, we present inversion results of a 412 line-km frequency-domain AEM survey to delineate subsurface stratigraphic features at the Hanford Site, located in southeastern Washington State. The inversion was performed using a massively parallel 3D electromagnetic modeling and inversion code, where the modeling is based on solving frequency-domain Maxwell’s equations using an unstructured-mesh finite-element method and the inversion employs a Gauss-Newton optimization scheme. The results are compared to an underlying geologic framework model (GFM), built by interpolating contact depths of stratigraphic units interpreted from site borehole datasets. In areas with good borehole coverage, the inversion results show a good match with the GFM to a depth of about 60 m. Outside of these areas, the inversion results exhibit inconsistencies from the assumptions made to create the GFM, demonstrating that the AEM survey results can be used to improve the understanding of the geological conceptual model.

47 OTHER INSTRUMENTATION↗

HyKKT: a hybrid direct-iterative method for solving KKT linear systems

Here, we propose a solution strategy for the large indefinite linear systems arising in interior methods for nonlinear optimization. The method is suitable for implementation on hardware accelerators such as graphical processing units (GPUs). The current gold standard for sparse indefinite systems is the LBLT factorization where L is a lower triangular matrix and B is 1×1 or 2×2 block diagonal. However, this requires pivoting, which substantially increases communication cost and degrades performance on GPUs. Our approach solves a large indefinite system by solving multiple smaller positive definite systems, using an iterative solver on the Schur complement and an inner direct solve (via Cholesky factorization) within each iteration. Cholesky is stable without pivoting, thereby reducing communication and allowing reuse of the symbolic factorization. We demonstrate the practicality of our approach on large optimal power flow problems and show that it can efficiently utilize GPUs and outperform LBL T factorization of the full system.

97 MATHEMATICS AND COMPUTING↗

A non-adapted sparse approximation of PDEs with stochastic inputs

We propose a method for the approximation of solutions of PDEs with stochastic coefficients based on the direct, i.e., non-adapted, sampling of solutions. This sampling can be done by using any legacy code for the deterministic problem as a black box. The method converges in probability (with probabilistic error bounds) as a consequence of sparsity and a concentration of measure phenomenon on the empirical correlation between samples. We show that the method is well suited for truly high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗

Measurement of charge state distributions using a scintillation screen

Absolute cross sections measured using electromagnetic devices to separate and detect heavy recoiling ions need to be corrected for charge state fractions. Accurate prediction of charge state distributions using theoretical models is not always a possibility, especially in energy and mass regions where data is sparse. As such, it is often necessary to measure charge state fractions directly. In this paper we present a novel method of using a scintillation screen along with a CMOS camera to image the charge dispersed beam after a set of magnetic dipoles. A measurement of the charge state distribution for 88 Sr passing through a natural carbon foil is performed. Using a Bayesian model to extract statistically meaningful uncertainties from these images, we find agreement between the new method and a more traditional method using Faraday cups. Additional future work is need to better understand systematic uncertainties. Our technique offers a viable method to measure charge state distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TWO EFFICIENT, NEW TECHNIQUES FOR DETECTING DISPERSED RADIO PULSES WITH INTERFEROMETERS: THE CHIRPOLATOR AND THE CHIMAGEATOR

Searching for dispersed radio pulses in interferometric data is of great scientific interest, but poses a formidable computational burden. Here, we present two efficient, new antenna-coherent solutions: The Chirpolator and The Chimageator. We describe the equations governing both techniques and propose a number of novel optimizations. We compare the implementation costs of our techniques with classical methods using three criteria: the operation rates (1) before and (2) after the integrate-and-dump stage, and (3) the data rate directly after the integrate-and-dump stage. When compared with classical methods, our techniques excel in the regime of sparse arrays, where they both require substantially lower data rates, and The Chirpolator requires a much lower post-integrator operation rate. In general, our techniques require more pre-integrator operations than the classical ones. We argue that the data and operation rates required by our techniques are better matched to future supercomputer architectures, where the arithmetic capability is outstripping the bandwidth capability. Our techniques are, therefore, viable candidates for deploying on future interferometers such as the Square Kilometer Array.

79 ASTRONOMY AND ASTROPHYSICS↗

An incremental strategy for calculating consistent discrete CFD sensitivity derivatives

In this preliminary study involving advanced computational fluid dynamic (CFD) codes, an incremental formulation, also known as the 'delta' or 'correction' form, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods appear to be needed for future 3D applications; however, because direct solver methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form result in certain difficulties, such as ill-conditioning of the coefficient matrix, which can be overcome when these equations are cast in the incremental form; these and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two laminar sample problems: (1) transonic flow through a double-throat nozzle; and (2) flow over an isolated airfoil.

Korivi, Vamshi Mohan↗

A dictionary learning algorithm for compression and reconstruction of streaming data in preset order

There has been an emerging interest in developing and applying dictionary learning (DL) to process massive datasets in the last decade. Many of these efforts, however, focus on employing DL to compress and extract a set of important features from data, while considering restoring the original data from this set a secondary goal. On the other hand, although several methods are able to process streaming data by updating the dictionary incrementally as new snapshots pass by, most of those algorithms are designed for the setting where the snapshots are randomly drawn from a probability distribution. In this paper, we present a new DL approach to compress and denoise massive dataset in real time, in which the data are streamed through in a preset order (instances are videos and temporal experimental data), so at any time, we can only observe a biased sample set of the whole data. Here, our approach incrementally builds up the dictionary in a relatively simple manner: if the new snapshot is adequately explained by the current dictionary, we perform a sparse coding to find its sparse representation; otherwise, we add the new snapshot to the dictionary, with a Gram-Schmidt process to maintain the orthogonality. To compress and denoise noisy datasets, we apply the denoising to the snapshot directly before sparse coding, which deviates from traditional dictionary learning approach that achieves denoising via sparse coding. Compared to full-batch matrix decomposition methods, where the whole data is kept in memory, and other mini-batch approaches, where unbiased sampling is often assumed, our approach has minimal requirement in data sampling and storage: i) each snapshot is only seen once then discarded, and ii) the snapshots are drawn in a preset order, so can be highly biased. Through experiments on climate simulations and scanning transmission electron microscopy (STEM) data, we demonstrate that the proposed approach performs competitively to those methods in data reconstruction and denoising.

97 MATHEMATICS AND COMPUTING↗

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗

Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations

In this work, we present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the butterfly algorithm and its hierarchical matrix extension for compressing and factorizing large frontal matrices via graph-distance guided entry evaluation or randomized matrix-vector multiplication-based schemes. Complexity analysis and numerical experiments demonstrate $\mathcal{O}(N\log^2 N)$ computation and $\mathcal{O}(N)$ memory complexity when applied to an $N\times N$ sparse system arising from 3D high-frequency Helmholtz and Maxwell problems.

97 MATHEMATICS AND COMPUTING↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

Biochemical Process Modeling and Simulation (BPMS)

The Biochemical Process Modeling and Simulation project aims to reduce the cost and time of research by applying theory, modeling, and simulation to the most relevant bottlenecks in the biochemical process. We use molecular modeling, quantum mechanics, metabolic modeling, fluid dynamics, and reaction-diffusion methods in close collaboration with pretreatment, hydrolysis, upgrading, and TEA. The project's outcomes are increased yields and efficiency of the biochemical process, added value to products, and reduced price of fuels by specifically targeting catalytic efficiency, reactor design, enzyme efficiency, and microbial design. We work closely with experimental projects to identify problems and iterate with experiments to find and refine solutions. By working with experimentalists, we decide on problems that can be solved with simulation that could otherwise not be solved or would take too long with experiment alone to reach BETO's targets. Over the years, we have produced solutions that have resulted in determining the most likely fatty-acid derivative for passive transport out of bacteria that upgrade biomass, and we have also designed enzyme mutations for enhanced lignin upgrading. Metabolic models have been developed to tune the activity of 2,3 butanediol production for the 2030 target. A computational method to deliver understanding of how complex omics data can be interpreted in the metabolic pathways of organisms used in the Agile Biofoundry. We have found methods to overcome specific barriers and continue to develop those methods. Our reactor studies have guided the design of both the microbes and reactors for aerobic and micro-aerobic production at all scales and have been instrumental in improving the accuracy of techno-economic analysis models. This project is essential in the process of selecting the final processes for 2030 SAF production targets. More specifically, recently, we have: 1) Predicted the strength of the basic structural interactions in commodity plastics to provide guidance for plastics upcycling strategies. 2) Developed computational tool to improve the characterization of lignin-derived compounds 3) Developed new methodologies to enable Machine Learning-based Directed Evolution for protein engineering. 4) Developed Machine Learning methods to predict protein promiscuity and mutations to further improve microbial and enzymatic driven processes and demonstrated the utility of ML approaches to engineering proteins from sparse experimental datasets. 5) Developed new methods to enable high-fidelity simulation of aerobic fermentation at industrial scale and resolving mismatch of time scales through subcycling/operator splitting 7) Identified the difficulty in preventing local high-oxygen conditions in industrial bubble columns, which leads to less-desirable acetoin production, suggesting future research directions in alternative reactor configurations (e.g loop reactors, shallow-channel reactors).

BIOMASS FUELS↗

Detector alignment for X-ray crystallography using Millepede-II

I describe a method for accurately refining the geometrical parameters of segmented X-ray area detectors on the basis of serial crystallography data, using 'Millepede' – an algorithm created for a very similar problem in high-energy physics. The Millepede method for serial crystallography builds on the approach of Brewster et al. [Acta Cryst. (2018), D74, 877–894], in which the detector parameters are refined simultaneously with the parameters for each individual crystal. This accounts for the mutual dependency between the parameters and thereby avoids the bias and slow convergence problems that have afflicted older approaches in which the deviations between observed and calculated Bragg peak positions were taken directly as the updates for the detector panel positions. The Millepede method uses the special structure of the least-squares normal equations to reduce them to a much smaller form that can be solved very quickly, even compared with the sparse matrix methods used previously. This makes it practical to refine the detector geometry frequently and thereby maintain accurate calibration without specialized alignment campaigns. Tilts of detector panels out of the plane can be reliably refined, as can the overall distance of the detector in the beam direction. With a simulated test case, the new method produced panel shifts within 7% of the correct values with only one iteration, and produced almost exactly correct shifts after a second iteration. A simulated out-of-plane panel rotation was correctly determined to within 0.001°. Applied to experimental data from an X-ray free-electron laser, the method increased the indexable fraction of frames from 30% to 91% in a single iteration, and to 96% after two further iterations. Computing the geometry updates on the basis of 2060 crystals took only 0.819 s on desktop computing hardware, including the time taken to read the required data from disk. The scaling was found to be very close to linear for up to 100 980 sets of crystal parameters, which took only 78.2 s to process under the same conditions. The method has been applied as part of a real-time feedback system at a synchrotron radiation beamline, in which an out-of-plane detector tilt of 0.04° was detected and corrected. Possible further applications are also described here.

Millepede-II↗

On signals faint and sparse: The ACICA algorithm for blind de-trending of exoplanetary transits with low signal-to-noise

Independent component analysis (ICA) has recently been shown to be a promising new path in data analysis and de-trending of exoplanetary time series signals. Such approaches do not require or assume any prior or auxiliary knowledge about the data or instrument in order to de-convolve the astrophysical light curve signal from instrument or stellar systematic noise. These methods are often known as 'blind-source separation' (BSS) algorithms. Unfortunately, all BSS methods suffer from an amplitude and sign ambiguity of their de-convolved components, which severely limits these methods in low signal-to-noise (S/N) observations where their scalings cannot be determined otherwise. Here we present a novel approach to calibrate ICA using sparse wavelet calibrators. The Amplitude Calibrated Independent Component Analysis (ACICA) allows for the direct retrieval of the independent components' scalings and the robust de-trending of low S/N data. Such an approach gives us an unique and unprecedented insight in the underlying morphology of a data set, which makes this method a powerful tool for exoplanetary data de-trending and signal diagnostics.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational Bayesian Framework for Quantification and Reduction of Predictive Uncertainty in Subsurface Environmental Modeling

Subsurface environmental systems are open and complex, in which intricate hydrologic, microbiologic, and geochemical processes occur and interact at multiple scales. Understanding and predicting system responses to natural forces (e.g., climate changes) and human activities (e.g., contaminant remediation and CO 2 sequestration) is indispensable for managing water resources, cleaning subsurface contamination at many sites of the Department of Energy (DOE), and providing expert analysis to inform policy-making on long-term stewardship of nuclear waste disposal and CO 2 storage sites. Groundwater reactive transport modeling is necessary for understanding and predicting the complex subsurface environmental system. However, as complex systems are never completely predictable, model predictions of the subsurface system are inherently uncertain, and uncertainty is one of the greatest obstacles in simulating the subsurface environment. Quantifying predictive uncertainty of the complex system is critical to test model predictive power, support decision-making, and guide experimental design and data collection for uncertainty reduction. This project tackled two major obstacles to efficient and effective quantification and reduction of predictive uncertainty in simulating the complex subsurface environment. One obstacle is that existing methods of uncertainty quantification are too fragmented and incomplete for understanding and predicting the complex subsurface environment as a whole. The other obstacle is that existing methods of uncertainty quantification are computationally demanding and may not be applicable to groundwater reactive transport modeling that is always computationally expensive. The above two obstacles to uncertainty quantification directly affect the design of data collection schemes for uncertainty reduction. In this project, we developed a comprehensive Bayesian framework to remove the first obstacle. The second obstacle was tackled by using the sparse grid methods, which were originally developed and analyzed for numerical integration in the field of applied mathematics. We integrated the sparse grid methods into the Bayesian framework seamlessly, which led to a sparse-grid-based method of Bayesian uncertainty analysis. The developed computational Bayesian framework has been applied to a number of subsurface environmental problems through collaborating with scientists at the Pacific Northwest National Laboratory and Oak Ridge National Laboratory. The applications demonstrated that the computational Bayesian framework is general and compatible with any models and numerical codes of subsurface modeling. It is thus can be applied to gain insights for subsurface environmental modeling. This project helped the PI achieve his career goal to advance the state-of-the-art computational methods in uncertainty quantification for subsurface environmental modeling. This project supported two doctoral students, two master students, and one post-doc. The two doctoral students, after their graduation, worked as post-docs at the Pacific Northwest National Laboratory and the Oak Ridge National Laboratory. The project produced a total of 29 journal articles (four under review), one book chapter, and a number of conference proceedings and abstracts.

54 ENVIRONMENTAL SCIENCES↗

Relaxation schemes for spectral multigrid methods

The effectiveness of relaxation schemes for solving the systems of algebraic equations which arise from spectral discretizations of elliptic equations is examined. Iterative methods are an attractive alternative to direct methods because Fourier transform techniques enable the discrete matrix-vector products to be computed almost as efficiently as for corresponding but sparse finite difference discretizations. Preconditioning is found to be essential for acceptable rates of convergence. Preconditioners based on second-order finite difference methods are used. A comparison is made of the performance of different relaxation methods on model problems with a variety of conditions specified around the boundary. The investigations show that iterations based on incomplete LU decompositions provide the most efficient methods for solving these algebraic systems.

Phillips, Timothy N.↗

Iterative solution techniques in boundary element analysis

Iterative techniques for the solution of the algebraic equations associated with the direct boundary element analysis (BEA) method are discussed. Continuum structural response analysis problems are considered, employing single- and multizone boundary element models with and without zone condensation. The impact on convergence rate and computer resource requirements associated with the sparse and blocked matrices, resulting in multizone BEA, is studied. Both conjugate gradient and generalized minimum residual preconditioned iterative solvers are applied for these problems and the performance of these algorithms is reported. Included is a quantification of the impact of the preconditioning utilized to render the boundary element matrices solvable by the respective iterative methods in a time competitive with direct methods.

Kane, J. H.↗