Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Sparse matrix”

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 649 records · Page 36

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Thermally reversible gels in electrophoresis. I - Matrix characterization

Two series of thermally reversible hydrogen-bonded gels have been characterized: (5 pct) PVA-(4 pct) PEG and (5 pct) PVA-(0.04 pct) borate gels. They both have extremely low melting points (16-17 C) and could be of potential interest for recovery of proteins after preparative electrophoresis. The PVA-borate gels can be exploited in the pH range 7-11 by progressively increasing the borate content in the pH interval 8 to 7 and concomitantly decreasing the borate levels in the pH zone 8 to 11. It is hypothesized that the low melting point of these gels is due to the fact that they are sparingly and sparsely hydrogen bonded along the PVA chain: on the average, 1 OH group out of 3 or 4 OH groups in the PVA polymer should be engaged in H-bond formation.

Righetti, Pier Giorgio↗

Excited-State Dynamics of a CsPbBr 3 Nanocrystal Terminated with Binary Ligands: Sparse Density of States with Giant Spin–Orbit Coupling Suppresses Carrier Cooling

Fully inorganic lead halide perovskite nanocrystals (NCs) are of interest for photovoltaic and light-emitting devices due to optoelectronic properties that can be tuned/optimized via halide composition, surface passivation, doping, and confinement. Compared to bulk materials, certain excited-state properties in NCs can be adjusted by electronic confinement effects such as suppressed hot carrier cooling and enhanced radiative recombination. In this paper, we use spinor Kohn–Sham orbitals (SKSOs) with spin–orbit coupling (SOC) interaction as a basis to compute excited-state dissipative dynamics simulations on a fully passivated CsPbBr 3 NC atomistic model. Redfield theory in the density matrix formalism is used to describe electron–phonon interactions which drive hot carrier cooling and nonradiative recombination ( k nonrad ). Radiative recombination ( k rad ) is calculated through oscillator strengths using SKSO basis. From k rad and k rad + k nonrad , we compute a theoretical photoluminescence quantum yield (PLQY) of 53%. Computed rates of hot carrier cooling ( k cooling ≈ 10 –1 1/ps) compare favorably with what has been reported in the literature. Interestingly, we observe that hot electron cooling slows down near the band edge, which we attribute to large SOC in the conduction band combined with strong confinement, which creates subgaps above the band edge. This slow carrier cooling could potentially impact hot carrier extraction before complete thermalization in photovoltaics (PVs). Implications of this work suggest that strong/intermediate confined APbX 3 NCs are better suited to applications in PVs due to slower carrier cooling near the conduction band edge, while intermediate/weak confined NCs are more appropriate for light-emitting applications, such as LEDs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tensor-GMRES method for large sparse systems of nonlinear equations

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Feng, Dan↗

Understanding Olivine and Pyroxene in Chondritic IDPs

There is a widespread depletion of Cr from the FeO-rich olivine in Wild-2, relative to type IIA chondrules(Frank et al., 2014)-the degree of this depletion is akin to that in unequilibrated chondrites such as Krymka (LL3.2) or Rainbow (CO3.2).Since Cr is highly mobile under even mild thermal metamorphism(as low as 200ºC), it is a sensitive indicator of such an event, showing greater depletion in smaller grains (i.e., matrix vs. chondrules) (Grossman and Brearley, 2005). Grossman and Brearley (2005) found that the distribution of Cr in FeO-rich olivine systematically changes as metamorphism increases between type 3.0 and type 3.2. Thus, Wild-2 olivine appears to carry evidence of mild thermal metamorphism. It is critical to determine whether there is any evidence for this from samples of other comets. For this we can examine an hydrous chondritic IDPs. Unfortunately, the data for olivine and pyroxene in IDPs is sparse, mainly decades old and lacks useful information on minor elements. We have begun to collect new compositional data for olivine and pyroxene in chondritic interplanetary dust particles (filling a major gap in our knowledge, as approximately half of these grains derive from comets), to determine whether the results obtained for Wild-2 are typical for comets in general, or whether Wild-2 (or its accretion components) has experienced an atypical geological history. A determination that a comet, or its accretion components, had experienced significant thermal metamorphism would greatly alter models of early solar system history.

Michael Zolensky↗

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.

97 MATHEMATICS AND COMPUTING↗

MueMat Multicrid Toolbox

MueMat is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software can generate example linear systems and provides short programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueMat currently includes two types of algebraic multigrid methods and many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueMat also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. MueMat has been designed for use within the programming environment of the Mathworks program MATLAB®. All algorithms and methods in MueMat have been or will be published in the open scientific literature.

Boman, ErikG.↗

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

In this study involving advanced fluid flow codes, an incremental iterative formulation (also known as the delta or correction form) together with the well-known spatially-split approximate factorization algorithm, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For smaller 2D 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. Iterative methods are needed for larger 2D and future 3D applications, however, because direct methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioning of the coefficient matrix; this problem 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 sample airfoil problems: (1) subsonic low Reynolds number laminar flow; and (2) transonic high Reynolds number turbulent flow.

Taylor, Arthur C., III↗

MueLu Multigrid Preconditioning Package

MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.

Tuminaro, Raymond↗

MueLu Multigrid Preconditioning Package

MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.

Source record↗

High pressure effects on EBC systems in high temperature environments

Environmental barrier coatings (EBCs) are designed to protect SiCfiber/SiCmatrix ceramic matrix composites (CMCs) in turbine engines by mitigating wear in high-temperature water vapor environments. The failure of EBCs is frequently attributed to the accelerated oxidation of the silicon bond coating layer when exposed to high-temperature steam, leading to the formation of a thickened thermally grown oxide (TGO). TGO growth increases interfacial stress, weakens adhesion, and results in coating spallation. Understanding the impact of high-temperature oxidation of EBC systems is essential for developing accurate lifespan models for turbine components, although pressurized oxidation testing is extremely sparse in the open literature. In this work, oxidation tests were performed on rare earth silicate EBCs coated onto SiC substrates under increased pressure conditions. The coated specimens were tested at 1100°C, 1200°C, and 1300°C at both 1 atm and 10 atm total pressure in steam environments. Subsequent characterization focused on the microstructural evolution of the EBC/Si/SiC system. The experimental findings indicated that TGO behavior is dependent on high-pressure conditions, with elevated pressure leading to an increase in oxide scale thickness and modifications in its morphology.

Ardrey, Kristyn [ORNL] (ORCID:0000000184407796)↗

Higher Order, Hybrid BEM/FEM Methods Applied to Antenna Modeling

In this presentation, the authors address topics relevant to higher order modeling using hybrid BEM/FEM formulations. The first of these is the limitation on convergence rates imposed by geometric modeling errors in the analysis of scattering by a dielectric sphere. The second topic is the application of an Incomplete LU Threshold (ILUT) preconditioner to solve the linear system resulting from the BEM/FEM formulation. The final tOpic is the application of the higher order BEM/FEM formulation to antenna modeling problems. The authors have previously presented work on the benefits of higher order modeling. To achieve these benefits, special attention is required in the integration of singular and near-singular terms arising in the surface integral equation. Several methods for handling these terms have been presented. It is also well known that achieving ~he high rates of convergence afforded by higher order bases may als'o require the employment of higher order geometry models. A number of publications have described the use of quadratic elements to model curved surfaces. The authors have shown in an EFIE formulation, applied to scattering by a PEC .sphere, that quadratic order elements may be insufficient to prevent the domination of modeling errors. In fact, on a PEC sphere with radius r = 0.58 Lambda(sub 0), a quartic order geometry representation was required to obtain a convergence benefi.t from quadratic bases when compared to the convergence rate achieved with linear bases. Initial trials indicate that, for a dielectric sphere of the same radius, - requirements on the geometry model are not as severe as for the PEC sphere. The authors will present convergence results for higher order bases as a function of the geometry model order in the hybrid BEM/FEM formulation applied to dielectric spheres. It is well known that the system matrix resulting from the hybrid BEM/FEM formulation is ill -conditioned. For many real applications, a good preconditioner is required to obtain usable convergence from an iterative solver. The authors have examined the use of an Incomplete LU Threshold (ILUT) preconditioner . to solver linear systems stemming from higher order BEM/FEM formulations in 2D scattering problems. Although the resulting preconditioner provided aD excellent approximation to the system inverse, its size in terms of non-zero entries represented only a modest improvement when compared with the fill-in associated with a sparse direct solver. Furthermore, the fill-in of the preconditioner could not be substantially reduced without the occurrence of instabilities. In addition to the results for these 2D problems, the authors will present iterative solution data from the application of the ILUT preconditioner to 3D problems.

Fink, P. W.↗

Factors impacting performance of multithreaded sparse triangular solve.

As computational science applications grow more parallel with multi-core supercomputers having hundreds of thousands of computational cores, it will become increasingly difficult for solvers to scale. Our approach is to use hybrid MPI/threaded numerical algorithms to solve these systems in order to reduce the number of MPI tasks and increase the parallel efficiency of the algorithm. However, we need efficient threaded numerical kernels to run on the multi-core nodes in order to achieve good parallel efficiency. In this paper, we focus on improving the performance of a multithreaded triangular solver, an important kernel for preconditioning. We analyze three factors that affect the parallel performance of this threaded kernel and obtain good scalability on the multi-core nodes for a range of matrix sizes.

99 GENERAL AND MISCELLANEOUS↗

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\WW$ and $\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\WW$ and $\HH$ within the alternating iterations.

Kannan, Ramakrishnan↗

Modulation of Akt vs Stat3 activity by the focal adhesion kinase in non-neoplastic mouse fibroblasts

Adhesion of cells to each other and to the extracellular matrix (ECM) are both required for cellular functions. Cell-to-cell adhesion is mediated by cadherins and their engagement triggers the activation of Stat3, which offers a potent survival signal. Adhesion to the ECM on the other hand, activates FAK which attracts and activates Src, as well as receptor tyrosine kinases (RTKs), the PI3k/Akt and Ras/Erk pathways. However, the effect of cell density upon FAK and Akt activity has not been examined. We now demonstrate that, interestingly, despite being potent Stat3 activators, Src and RTKs are unable to activate Stat3 in sparsely growing (i.e., without cadherin engagement), non-neoplastic cells attached to the ECM. In contrast, cell aggregation (i.e., cadherin engagement in the absence of adhesion to a solid substratum) was found to activate both Stat3 and Akt. Pharmacologic or genetic reduction of FAK activity abolished Akt activity at low densities, indicating that FAK is an important activator of Akt in this setting. Notably, FAK knockout increased cellular sensitivity to the Stat3 inhibitor CPA7, while FAK reintroduction restored resistance to this drug. These findings suggest a complementary role of integrin/FAK/Akt and cadherin/Stat3-mediated pro-survival pathways, which may be of significance during neoplastic transformation and metastasis.

60 APPLIED LIFE SCIENCES↗

Bayesian chain graph models to characterize microbe-environment dynamics

Microbiome data require statistical models that can simultaneously decode microbes' reaction to the environment and interactions among microbes. While a multiresponse linear regression model seems like a straight-forward solution, we argue that treating it as a graphical model is problematic given that the regression coefficient matrix does not encode the conditional dependence structure between response and predictor nodes. This observation is especially important in biological settings when we have prior knowledge on the edges from specific experimental interventions that can only be properly encoded under a conditional dependence model. Here, we propose a chain graph model with two sets of nodes (predictors and responses) whose solution yields a graph with edges that indeed represent conditional dependence, thus agreeing with the experimenter's intuition on the average behavior of nodes under treatment. The solution to our model is sparse via the Bayesian linear regression (LASSO). In addition, we propose an adaptive extension so that different shrinkages can be applied to different edges to incorporate edge-specific prior knowledge. Our model is computationally inexpensive through an efficient Gibbs sampling algorithm and can account for binary, counting, and compositional responses via an appropriate hierarchical structure. We test the performance of our model in a variety of simulated datasets, thereby showing superior performance to state-of-the-art approaches. We further apply our model to human gut and soil microbial compositional datasets, and we highlight that CG-LASSO can estimate biologically meaningful network structures in the data.

compositional data↗