Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Parameterization of Direct and Doorway Processes in R-Matrix Formalism

R-matrix formalism is extended beyond compound nuclear (CN) resonant reactions to include parameterization of direct as well as doorway processes. Direct processes in the R-matrix exterior are parameterized by a unitary matrix that introduces mixing among wave function coefficients of the incoming and outgoing wave function components at the R-matrix channel surface. Doorway processes are parameterized by separating the Hilbert space of the interior R-matrix region into its doorway and CN subspaces, from which doorway state eigenenergies, reduced width amplitudes, and the strengths of their coupling to CN levels appear as new R-matrix parameters. Parameterization of generalized as well as the conventional Reich–Moore approximation for eliminated capture channels in the presence of direct, doorway, and CN processes is presented along with a complex-valued scattering length with contributions from direct, doorway, and CN capture processes. Derivation of Brune’s alternative R-matrix parameters is extended to include doorway states. This work suggests how R-matrix formalism could be extended further by adopting the concepts from related reaction formalisms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Scattering matrix pole expansions for complex wave numbers in R -matrix theory

In this followup article to Ducru et al., we establish new results on scattering matrix pole expansions for complex wave numbers in R-matrix theory. In the past, two branches of theoretical formalisms emerged to describe the scattering matrix in nuclear physics: R-matrix theory and pole expansions. The two have been quite isolated from one another. Recently, our study of Brune's alternative parametrization of R-matrix theory has shown the need to extend the scattering matrix (and the underlying R-matrix operators) to complex wave numbers. Two competing ways of doing so have emerged from a historical ambiguity in the definitions of the shift S and penetration P functions: the legacy Lane and Thomas's “force closure” approach versus analytic continuation (which is the standard in mathematical physics). The R-matrix community has not yet come to a consensus as to which to adopt for evaluations in standard nuclear data libraries, such as ENDF. Here, in this article, we argue in favor of analytic continuation of R-matrix operators. We bridge R-matrix theory with the Humblet-Rosenfeld pole expansions, and discover new properties of the Siegert-Humblet radioactive poles and widths, including their invariance properties to changes in channel radii a c . We then show that analytic continuation of R-matrix operators preserves important physical and mathematical properties of the scattering matrix—canceling spurious poles and guaranteeing generalized unitarity—while still being able to close channels below thresholds.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Residual stresses in Cu matrix composite surface deposits after laser melt injection

Abstract Tungsten carbide particles reinforced metal matrix composite (MMC) coatings can significantly improve surface wear resistance owing to their increased surface hardness. However, the presence of macro‐ and micro‐residual stresses in MMC coatings can have detrimental effects, such as reducing service life. In this study, neutron diffraction was used to determine the residual stresses in spherical fused tungsten carbide (sFTC) reinforced Cu matrix composite surface deposits after laser melt injection. We also developed a thermo‐mechanical coupled finite element model to predict residual stresses. Our findings reveal that sFTC/Cu composite deposits produced with a preheating temperature of 400°C have low residual stresses, with a maximum tensile residual stress of 98 MPa in the Cu matrix on the top surface. In contrast, the sFTC/bronze (CuAl10Ni5Fe4) composite deposit exhibits very high residual stresses, with a maximum tensile residual stress in the Cu matrix on the top surface reaching 651 MPa. These results provide a better understanding of the magnitudes and distributions of residual stresses in sFTC‐reinforced Cu matrix composite surface deposits manufactured via laser melt injection.

Zhang, Xingxing↗
DOE OSTI2024

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Integrin nanoclusters can bridge thin matrix fibres to form cell–matrix adhesions

Integrin-mediated cell-matrix adhesions are key to sensing the geometry and rigidity of extracellular environments and influence vital cellular processes. In vivo, the extracellular matrix is composed of fibrous arrays. To understand the fibre geometries that are required for adhesion formation, we patterned nanolines of various line widths and arrangements in single, crossing or paired arrays with the integrin-binding peptide Arg-Gly-Asp. Single thin lines (width ≤ 30 nm) did not support cell spreading or formation of focal adhesions, despite the presence of a high density of Arg-Gly-Asp, but wide lines (>40 nm) did. Using super-resolution microscopy, we observed stable, dense integrin clusters formed on parallel (within 110 nm) or crossing thin lines (mimicking a matrix mesh) similar to those on continuous substrates. These dense clusters bridged the line pairs by recruiting activated but unliganded integrins, as verified by integrin mutants unable to bind ligands that coclustered with ligand-bound integrins when present in an active extended conformation. Furthermore, in a fibrous extracellular matrix mesh, stable integrin nano-clusters bridge between thin (≤ 30 nm) matrix fibres and bring about downstream consequences of cell motility and growth.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Performance optimization, modeling and analysis of sparse matrix-matrix products on multi-core and many-core processors

Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is widely used in areas ranging from traditional numerical applications to recent big data analysis and machine learning. Although many SpGEMM algorithms have been proposed, hardware specific optimizations for multi- and many-core processors are lacking and a detailed analysis of their performance under various use cases and matrices is not available. In this work, we firstly identify and mitigate multiple bottlenecks with memory management and thread scheduling on Intel Xeon Phi (Knights Landing or KNL). Specifically targeting many-core processors, we develop a hash-table-based algorithm and optimize a heap-based shared-memory SpGEMM algorithm. We examine their performance together with other publicly available codes. Different from the literature, our evaluation also includes use cases that are representative of real graph algorithms, such as multi-source breadth-first search or triangle counting. Our hash-table and heap-based algorithms are showing significant speedups from libraries in the majority of the cases while different algorithms dominate the other scenarios with different matrix size, sparsity, compression factor and operation type. We wrap up in-depth evaluation results and make a recipe to give the best SpGEMM algorithm for target scenario. We build the performance model for hash-table and heap-based algorithms, which supports the recipe. A critical finding is that hash-table-based SpGEMM gets a significant performance boost if the nonzeros are not required to be sorted within each row of the output matrix. Finally, we integrate our implementations into a large-scale protein clustering code named HipMCL, accelerating its SpGEMM kernel by up to 10X and achieving an overall performance boost for the whole HipMCL application by 2.6X.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Baryon number violation: from nuclear matrix elements to BSM physics

Processes that violate baryon number, most notably proton decay and $n\bar{n}$ transitions, are promising probes of physics beyond the Standard Model (BSM) needed to understand the lack of antimatter in the Universe. To interpret current and forthcoming experimental limits, theory input from nuclear matrix elements to UV complete models enters. Thus, an interplay of experiment, effective field theory, lattice QCD, and BSM model building is required to develop strategies to accurately extract information from current and future data and maximize the impact and sensitivity of next-generation experiments. Here, we briefly summarize the main results and discussions from the workshop ‘INT-25-91W: Baryon Number Violation: From Nuclear Matrix Elements to BSM Physics,’ held at the Institute for Nuclear Theory, University of Washington, Seattle, WA, 13–17 January 2025.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Texture analysis of AGR program matrix materials

We report the fuel form for high-temperature gas-cooled reactors consists of tristructural isotropic (TRISO) particles embedded in a matrix of graphite flake and carbonized resin. The process of overcoating particles prior to compacting yields a circumferential orientation of the graphite flake surrounding the TRISO particles, which is modified to varied extents when overcoated particles are pressed into the final fuel form. As graphite is highly anisotropic, the texture may impact the properties and performance of the fuel. Ellipsometry was used to measure the texture of the matrix for fueled compacts and unfueled “matrix-only” samples. Results indicated local texture related to the spherical particles in compacts associated with overcoating versus a more linear layered structure in “matrix-only” samples.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Workflow for High-throughput Screening of Enzyme Mutant Libraries Using Matrix-assisted Laser Desorption/Ionization Mass Spectrometry Analysis of Escherichia coli Colonies

High-throughput molecular screening of microbial colonies and DNA libraries are critical procedures that enable applications such as directed evolution, functional genomics, microbial identification, and creation of engineered microbial strains to produce high-value molecules. A promising chemical screening approach is the measurement of products directly from microbial colonies via optically guided matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS). Measuring the compounds from microbial colonies bypasses liquid culture with a screen that takes approximately 5 s per sample. We describe a protocol combining a dedicated informatics pipeline and sample preparation method that can prepare up to 3,000 colonies in under 3 h. The screening protocol starts from colonies grown on Petri dishes and then transferred onto MALDI plates via imprinting. The target plate with the colonies is imaged by a flatbed scanner and the colonies are located via custom software. The target plate is coated with MALDI matrix, MALDI-MS analyzes the colony locations, and data analysis enables the determination of colonies with the desired biochemical properties. This workflow screens thousands of colonies per day without requiring additional automation. The wide chemical coverage and the high sensitivity of MALDI-MS enable diverse screening projects such as modifying enzymes and functional genomics surveys of gene activation/inhibition libraries.

Choe, Kisurb↗
DOE OSTI2022

Conversion of Resonance Parameters Between Wigner-Eisenbud R-matrix and Transition Matrix Pole Representation

The goal of this research is to develop a numerical code for translation between the current standard, Wigner-Eisenbud R-matrix parameters and a novel pole-representation of cross sections. The method follows Ducru et al. and constructs the conversion between these parametric representations of the scattering and reaction data. This pole representation, which expresses cross sections as a sum of simple poles (and their attendant residues), is examined in the context of the advantages provided by this compact, computationally efficient representation. These advantages include the ability to doppler broaden cross sections on-the-fly as well as a lower memory footprint when generating cross sections, an attractive feature to those interested in parallel GPU based Monte Carlo. Some conversion methods between R-matrix parameters and S-matrix poles have relied on curve fitting techniques. It is unknown weather these numerical methods necessarily preserve certain underlying physics properties of the standard R-matrix cross section model (such as unitarity). The direct conversion studied here aim to preserve such properties. This knowledge is of interest for future work into the generation of resonance parameter sensitivities.

CLUTCH↗
DOE OSTI2021

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. Furthermore, we address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware threads) and can multiply sparse matrices of any size as long as inputs and a fraction of output fit in the aggregated memory. As we go from 16,384 cores to 262,144 cores on a Cray XC40 supercomputer, the new SpGEMM algorithm runs 10x faster when multiplying large-scale protein-similarity matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗
DOE OSTI2020

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

An ICME Modeling Framework for Metal Matrix Composites Focusing on Ultrahigh Temperature Matrix Material and Tungsten Carbide Reinforcement Particulate (Final CRADA Report)

Ultra High Temperature Metal Matrix Composites (UHT-MMCs) are of interest to the due to their potential defense and aerospace applications. These materials consist of a metal matrix reinforced with a stiff ceramic or cermet. Based on a preliminary literature survey, this project will focused on a pure titanium (Ti) matrix reinforced with tungsten carbide-cobalt (WC-Co). UHT-MMC technology is still at a nascent stage of development and requires extensive experimental work to optimize the structure and resulting material properties of a particular UHT-MMC material system. An accurate and complete high-performance computing (HPC) model of the Ti/WC-Co material system could greatly accelerate the development and deployment Ti/WC-Co materials by connecting processing parameters to material properties. This type of model could then be used in an integrated computational materials engineering approach to optimize the material structure to achieve a targeted level of performance.

36 MATERIALS SCIENCE↗
DOE OSTI2023

A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data

This article reports the study of algorithms for non-negative matrix factorization (NMF) in various applications involving smoothly varying data such as time or temperature series diffraction data on a dense grid of points. Utilizing the continual nature of the data, a fast two-stage algorithm is developed for highly efficient and accurate NMF. In the first stage, an alternating non-negative least-squares framework is used in combination with the active set method with a warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. Furthermore, the results demonstrate the advantage of the algorithm in finding high-precision solutions.

interior point method↗