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 109 records · Page 6

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗

Adaptive Bayesian Inference for Prediction

Performing rigorous predictive simulation necessitates that all available data be incorporated into the modeling process in order to accurately quantify uncertainties in predictions of the model. Statistical Bayesian inference is the most commonly used approach for incorporating data into uncertainty estimates. Statistical Bayesian inference uses data and an assumed error model to inform posterior distributions of model input variables and model discrepancies. An explicit characterization of the posterior distribution is not formed, but rather methods such as Markov chain Monte-Carlo (MCMC) are used to draw samples from the posterior. These samples are then used to evaluate statistics, such as integrals, of predicted quantities of interest (QoI). Recently the authors have developed an alternative reformulation of Bayesian inference based upon a measure-theoretic inversion technique. Unlike traditional statistical Bayesian inference, this reformulation allows us to directly interrogate the posterior distribution and, consequently, to generate samples from the posterior without MCMC. In this work we use forward propagation uncertainty quantification techniques to reduce the cost of approximating the posterior distribution. Specifically we investigate goal-oriented adaptive sparse grid approximation methods. These adaptive methods concentrate high-fidelity model evaluations in regions of the parameter space that both significantly contribute to the uncertainty in specified QoI and are informed by the available data. Numerical results are presented to compare our approach with the standard statistical Bayesian approach and to demonstrate the effectiveness of the goal-oriented adaptivity.

97 MATHEMATICS AND COMPUTING↗

Improved Oxygen-Beam Texturing of Glucose-Monitoring Optics

An improved method has been devised for using directed, hyperthermal beams of oxygen atoms and ions to impart desired textures to the tips of polymethylmethacrylate [PMMA] optical fibers to be used in monitoring the glucose content of blood. The improved method incorporates, but goes beyond, the method described in Texturing Blood-Glucose- Monitoring Optics Using Oxygen Beams (LEW-17642-1), NASA Tech Briefs, Vol. 29, No. 4 (April 2005), page 11a. The basic principle of operation of such a glucose-monitoring sensor is as follows: The textured surface of the optical fiber is coated with chemicals that interact with glucose in such a manner as to change the reflectance of the surface. Light is sent down the optical fiber and is reflected from, the textured surface. The resulting change in reflectance of the light is measured as an indication of the concentration of glucose. The required texture on the ends of the optical fibers is a landscape of microscopic cones or pillars having high aspect ratios (microscopic structures being taller than they are wide). The average distance between hills must be no more than about 5 mso that blood cells (which are wider) cannot enter the valleys between the hills, where they would interfere with optical sensing of glucose in the blood plasma. On the other hand, the plasma is required to enter the valleys, and high aspect ratio structures are needed to maximize the surface area in contact with the plasma, thereby making it possible to obtain a given level of optical glucose-measurement sensitivity with a relatively small volume of blood. There is an additional requirement that the hills be wide enough that a sufficient amount of light can propagate into them and, after reflection, can propagate out of them. The method described in the cited prior article produces a texture comprising cones and pillars that conform to the average-distance and aspect-ratio requirements. However, a significant fraction of the cones and pillars are so narrow that not enough light can propagate along them. The improved method makes it possible to form wider cones and pillars while still satisfying the average-distance and aspect-ratio requirements. In the improved method, as in the previously reported method, multiple optical fibers are first bundled together for simultaneous texturing of their distal tips. However, prior to texturing by exposure to an oxygen beam, the tips are first coated by vapor deposition of a thin, sparse layer of aluminum: The exposure to the aluminum vapor must be short enough (typically of the order of seconds) so that the aluminum nucleates into islands separated by uncoated areas. The coated tips are textured by exposure to a directed beam of hyperthermal (kinetic energy >1 eV) oxygen atoms and/or ions in a vacuum chamber, as in the previously reported method. The aluminum islands partially shield the underlying PMMA from oxidation and erosion by the beam, so that the cones or pillars remaining after texturing are wider than they would otherwise be. To some extent, the dimensions of the hills and the distances between them can be tailored through choice of the thickness of the aluminum coat and/or the oxygen-beam fluence. The figure illustrates an example of texturing of the tip of a PMMA optical fiber without and with prior aluminum coating.

Banks, Bruce A.↗

Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale

This paper describes MADHAT (Multidimensional Anomaly Detection fusing HPC, Analytics, and Tensors), an integrated workflow that demonstrates the applicability of HPC resources to the problem of maintaining cyber situational awareness. MADHAT combines two high-performance packages: ENSIGN for large-scale sparse tensor decompositions and HAGGLE for graph analytics. Tensor decompositions isolate coherent patterns of network behavior in ways that common clustering methods based on distance metrics cannot. Parallelized graph analysis then uses directed queries on a representation that combines the elements of identified patterns with other available information (such as additional log fields, domain knowledge, network topology, whitelists and blacklists, prior feedback, and published alerts) to confirm or reject a threat hypothesis, collect context, and raise alerts. MADHAT was developed using the collaborative HPC Architecture for Cyber Situational Awareness (HACSAW) research environment and evaluated on structured network sensor logs collected from Defense Research and Engineering Network (DREN) sites using HPC resources at the U.S. Army Engineer Research and Development Center DoD Supercomputing Resource Center (ERDC DSRC). To date, MADHAT has analyzed logs with over 650 million entries.

Cyber security, Tensor decomposition, graph analyt↗

Indigo: A Domain-Specific Language for Fast, Portable Image Reconstruction

© 2018 IEEE. Linear operators used in iterative methods like conjugate gradient have typically been implemented either as ''matrix-driven'' subroutines backed by explicit sparse or dense matrices, or as ''matrix-free'' subroutines that implement specific linear operations directly (e.g. FFTs). The matrix-driven approach is generally more portable because it can target widely-Available BLAS libraries, but it can be inefficient in terms of time and space complexity. In contrast, the matrix-free approach is more performant because it leverages structure in operations, but it requires each operator be re-implemented on each new platform. To increase performance and portability, we propose a hybrid approach that represents linear operators as expression trees. Leaf nodes in the tree are either matrix-free or matrix-driven operators, and interior nodes represent mathematical compositions (sums, products, transposes) or structural compositions (stacks, block diagonals, etc.) of the leaf operators. This representation enables expert-guided reordering and fusion transformations that can improve performance or reduce memory pressure. We implement our approach in a domain-specific language called Indigo. We assess Indigo on image reconstruction problems arising in four application areas: magnetic resonance imaging, ptychography, magnetic particle imaging, and fluorescent microscopy. We give performance results from vendor BLAS libraries, and we introduce specializations to Sparse BLAS routines that achieve near-Roofline performance on multi-core, many-core, and GPU systems.

Driscoll, Michael↗

Discrete range clustering using Monte Carlo methods

For automatic obstacle avoidance guidance during rotorcraft low altitude flight, a reliable model of the nearby environment is needed. Such a model may be constructed by applying surface fitting techniques to the dense range map obtained by active sensing using radars. However, for covertness, passive sensing techniques using electro-optic sensors are desirable. As opposed to the dense range map obtained via active sensing, passive sensing algorithms produce reliable range at sparse locations, and therefore, surface fitting techniques to fill the gaps in the range measurement are not directly applicable. Both for automatic guidance and as a display for aiding the pilot, these discrete ranges need to be grouped into sets which correspond to objects in the nearby environment. The focus of this paper is on using Monte Carlo methods for clustering range points into meaningful groups. One of the aims of the paper is to explore whether simulated annealing methods offer significant advantage over the basic Monte Carlo method for this class of problems. We compare three different approaches and present application results of these algorithms to a laboratory image sequence and a helicopter flight sequence.

Chatterji, G. B.↗

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A discrete sensitivity analysis algorithm had previously been developed and applied to two-dimensional aerodynamic optimization problems, where the computational domains were discretized by using single grids. The sparse, unsymmetric systems of linear equations resulting from this algorithm were solved by a direct matrix inversion matrix. However, for large two-dimensional problems and, practically, all three-dimensional problems, direct inversion methods become inapplicable, primarily due to the prohibitive computer storage needed. In an attempt to alleviate such hindrances, the sensitivity analysis with domain decomposition (SADD) scheme was developed. This scheme divides the computational domain into smaller and nonoverlapping subdomains (multiblock grids) that are solved separately. Then, the final solution is constructed from the subdomain solutions. As the number of grid points in the interface boundaries of the subdomains becomes large, the computer memory required to store the effective coefficient matrix of these interface points starts to increase. Presented in this Technical Note is a preconditioned iterative procedure to overcome this particular problem.

Eleshaky, Mohamed E.↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Gamma-Ray Point-Source Localization and Sparse Image Reconstruction using Poisson Likelihood

Gamma-ray imaging trys to reconstruct the spatial and intensity distribution of gamma-emitting radionuclides from a set of measurements. Wholly, this problem is solved by discretizing the spatial dimensions and employing the maximum likelihood expectation maximization (ML-EM) algorithm, with or without some form of regularization. While the generality of this formulation enables use in a wide variety of scenarios, it is susceptible to overfitting, limited by the discretization of spatial coordinates, and can be computationally expensive. We present a novel approach to 3D gamma-ray image reconstruction for scenarios where sparsity may be assumed, for example radiological source search. In this work we first formulate a point-source localization (PSL) approach as an optimization problem where both position and source intensity are continuous variables. We then extend and generalize this formulation to an iterative algorithm called additive point-source localization (APSL) for sparse parametric image reconstruction. A set of simulated source search scenarios using a single non-directional detector are considered, finding improved image accuracy and computational efficiency with APSL over traditional grid-based methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Control of multi-agent systems: Results, open problems, and applications

The purpose of this review article is to present some recent results on the modeling and control of large systems of agents. We focus on particular applications where the agents are capable of independent actions instead of simply reacting to external forces. In the literature, such agents were referred to as autonomous, intelligent, self-propelled, greedy, and others. The main applications we have in mind are social systems (as opinion dynamics), pedestrians’ movements (also called crowd dynamics), animal groups, and vehicular traffic. We note that the last three examples include physical constraints; however, the agents are able to inject energy into the system, thus preventing the typical conservation of momentum and energy. In addition, the control problems posed by such systems are new and require innovative methods. We illustrate some ideas developed recently, including the use of sparse controls, limiting the total variation of controls, and defining new control problems for measures. After reviewing various approaches, we discuss some future research directions of potential interest. The latter encompasses both new types of equations and new types of limiting procedures to connect several scales at which a system can be represented. We conclude by illustrating a recent real-life experiment using autonomous vehicles on an open highway to smooth traffic waves. This opens the door to a new era of interventions to control real-time multi-agent systems and to increase the societal impact of such interventions guided by control research.

97 MATHEMATICS AND COMPUTING↗

Source scaling comparison and validation in Central Italy: data intensive direct S waves versus the sparse data coda envelope methodology

SUMMARY Robustness of source parameter estimates is a fundamental issue in understanding the relationships between small and large events; however, it is difficult to assess how much of the variability of the source parameters can be attributed to the physical source characteristics or to the uncertainties of the methods and data used to estimate the values. In this study, we apply the coda method by Mayeda et al. using the coda calibration tool (CCT), a freely available Java-based code (https://github.com/LLNL/coda-calibration-tool) to obtain a regional calibration for Central Italy for estimating stable source parameters. We demonstrate the power of the coda technique in this region and show that it provides the same robustness in source parameter estimation as a data-driven methodology [generalized inversion technique (GIT)], but with much fewer calibration events and stations. The Central Italy region is ideal for both GIT and coda approaches as it is characterized by high-quality data, including recent well-recorded seismic sequences such as L'Aquila (2009) and Amatrice–Norcia–Visso (2016–2017). This allows us to apply data-driven methods such as GIT and coda-based methods that require few, but high-quality data. The data set for GIT analysis includes ∼5000 earthquakes and more than 600 stations, while for coda analysis we used a small subset of 39 events spanning 3.5 < Mw < 6.33 and 14 well-distributed broad-band stations. For the common calibration events, as well as an additional 247 events (∼1.7 < Mw < ∼5.0) not used in either calibration, we find excellent agreement between GIT-derived and CCT-derived source spectra. This confirms the ability of the coda approach to obtain stable source parameters even with few calibration events and stations. Even reducing the coda calibration data set by 75 per cent, we found no appreciable degradation in performance. This validation of the coda calibration approach over a broad range of event size demonstrates that this procedure, once extended to other regions, represents a powerful tool for future routine applications to homogeneously evaluate robust source parameters on a national scale. Furthermore, the coda calibration procedure can homogenize the Mw estimates for small and large events without the necessity of introducing any conversion scale between narrow-band measures such as local magnitude (ML) and Mw, which has been shown to introduce significant bias.

Morasca, Paola (ORCID:0000000265254867)↗

COHERENT BACKSCATTERING VERIFIED NUMERICALLY FOR A FINITE VOLUME OF SPHERICAL PARTICLES

We consider electromagnetic scattering by a spherical volume sparsely and randomly populated by spherical particles of equal size and optical properties. The far-field scattering matrix of the entire volume is computed using an exact method and an approximate method. The former is a direct computer solver of the Maxwell equations called the superposition T-matrix method (STMM). The latter is a solver based on numerical Monte Carlo integration of the ladder and cyclical diagrams appearing in the microphysical theory of radiative transfer and coherent backscattering (RT-CB). The quantitative agreement between the STMM and RT-CB computations provides verification of the RT-CB theory. Prominent backscattering features exhibited by the STMM data cannot be reproduced by keeping only the ladder diagrams of RT. Our results strongly support the CB explanation of opposition brightness and polarization phenomena observed for a class of atmosphereless solar-system objects. Further research is necessary to determine the range of quantitative applicability of the RT-CB theory to densely packed particulate media.

79 ASTRONOMY AND ASTROPHYSICS↗

WE-G-BRF-04: Robust Real-Time Volumetric Imaging Based On One Single Projection

Purpose: Real-time volumetric imaging is highly desirable to provide instantaneous image guidance for lung radiation therapy. This study proposes a scheme to achieve this goal using one single projection by utilizing sparse learning and a principal component analysis (PCA) based lung motion model. Methods: A patient-specific PCA-based lung motion model is first constructed by analyzing deformable vector fields (DVFs) between a reference image and 4DCT images at each phase. At the training stage, we “learn” the relationship between the DVFs and the projection using sparse learning. Specifically, we first partition the projections into patches, and then apply sparse learning to automatically identify patches that best correlate with the principal components of the DVFs. Once the relationship is established, at the application stage, we first employ a patchbased intensity correction method to overcome the problem of different intensity scale between the calculated projection in the training stage and the measured projection in the application stage. The corrected projection image is then fed to the trained model to derive a DVF, which is applied to the reference image, yielding a volumetric image corresponding to the projection. We have validated our method through a NCAT phantom simulation case and one experiment case. Results: Sparse learning can automatically select those patches containing motion information, such as those around diaphragm. For the simulation case, over 98% of the lung region pass the generalized gamma test (10HU/1mm), indicating combined accuracy in both intensity and spatial domain. For the experimental case, the average tumor localization errors projected to the imager are 0.68 mm and 0.4 mm on the axial and tangential direction, respectively. Conclusion: The proposed method is capable of accurately generating a volumetric image using one single projection. It will potentially offer real-time volumetric image guidance to facilitate lung radiotherapy. This study is supported in part by NIH (1R01CA154747-01), The Core Technology Research in Strategic Emerging Industry, Guangdong, China(2011A081402003)

60 APPLIED LIFE SCIENCES↗

Acoustic- and elastic-waveform inversion with total generalized p-variation regularization

Geophysical models usually contain both sharp interfaces and smooth variations, and it is difficult to accurately account for both of these two types of medium parameter variations using conventional full-waveform inversion methods. We develop a novel full-waveform inversion method for acoustic and elastic waves using a total generalized p-variation regularization scheme to address these challenging problems. We decompose the full-waveform inversion into two subproblems and solve these two minimization subproblems using an alternating-direction minimization strategy. One significant advantage of the total generalized p-variation regularization scheme is that it can simultaneously reconstruct sharp interfaces and smooth background variations of geophysical parameters. Such capability can also effectively suppress the noises in source-encoded inversion and sparse-data inversion, or inversion of noisy data. We demonstrate the advantages of our full-waveform inversion method using a checkerboard model, a modified elastic SEG/EAGE overthrust model, and a land field seismic data set. Our conclusions of synthetic and field seismic data demonstrate that our method reconstructs both smooth background variations and sharp interfaces of subsurface geophysical properties accurately, and provides a useful tool for accurate and reliable inversion of field seismic data.

58 GEOSCIENCES↗

Recursive Factorization of the Inverse Overlap Matrix in Linear Scaling Quantum Molecular Dynamics Simulations

We present a reduced complexity algorithm to compute the inverse overlap factors required to solve the generalized eigenvalue problem in a quantum-based molecular dynamics (MD) simulation. Our method is based on the recursive iterative re nement of an initial guess Z of the inverse overlap matrix S. The initial guess of Z is obtained beforehand either by using an approximate divide and conquer technique or dynamically, propagated within an extended Lagrangian dynamics from previous MD time steps. With this formulation, we achieve long-term stability and energy conservation even under incomplete approximate iterative re nement of Z. Linear scaling performance is obtained using numerically thresholded sparse matrix algebra based on the ELLPACK-R sparse matrix data format, which also enables e cient shared memory parallelization. As we show in this article using selfconsistent density functional based tight-binding MD, our approach is faster than conventional methods based on the direct diagonalization of the overlap matrix S for systems as small as a few hundred atoms, substantially accelerating quantum-based simulations even for molecular structures of intermediate size. For a 4,158 atom water-solvated polyalanine system we nd an average speedup factor of 122 for the computation of Z in each MD step.

36 MATERIALS SCIENCE↗

A pressure flux-split technique for computation of inlet flow behavior

A method for calculating the flow field in aircraft engine inlets is presented. The phenomena of inlet unstart and restart are investigated. Solutions of the reduced Navier-Stokes (RNS) equations are obtained with a time consistent direct sparse matrix solver that computes the transient flow field both internal and external to the inlet. Time varying shocks and time varying recirculation regions can be efficiently analyzed. The code is quite general and is suitable for the computation of flow for a wide variety of geometries and over a wide range of Mach and Reynolds numbers.

Pordal, H. S.↗

A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems, especially when the size of the training data is limited. To address these diculties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components of the random inputs and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measure and a sparsity enhancement rotation procedure. This sparsity-enhancing rotation method was initially proposed in our previous work [1] for Gaussian density distributions, which may not be feasible for non-Gaussian distributions due to the loss of orthogonality after the rotation. To remedy such diculties, we developed a new data-driven approach to construct orthonormal polynomials for polynomials for arbitrary mutually dependent (amdP) randomness, ensuring the constructed basis maintains the orthogonality/near-orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) [2] shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery, with only limited training data, of a sparse representation of the target functions. The eectiveness of our method is demonstrated in challenging problems such as PDEs and realistic molecular systems within high-dimensional conformational space (O(10)) where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures.

Lei, Huan↗

Combined Force-Frequency Sampling for Simulation of Systems Having Rugged Free Energy Landscapes.

An adaptive, machine learning-based sampling method is presented for simulation of systems having rugged, multidimensional free energy landscapes. The method's main strength resides in its ability to learn both from the frequency of visits to distinct states and the generalized force estimates that arise in a system as it evolves in phase space. This is accomplished by introducing a self-integrating artificial neural network, which generates an estimate of the free energy directly from its derivatives. The usefulness of the proposed combined approach is examined in the context of two concrete examples, namely, an alanine dipeptide molecule in water and a polymer diffusing through a narrow pore. This new method is found to be robust, faster, and more accurate than approaches that rely only on frequency-based or generalized force-based estimations. After combining the proposed approach with overfill protection and support for sparse data storage and training, the method is shown to be more effective than comparable, previously available techniques and capable of scaling efficiently to larger numbers of collective variables.

Sevgen, Emre↗