Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix multiplication”

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 235 records · Page 13

The effect of multiple compliant layers at the fiber-matrix interface on residual thermal stresses in metal matrix composites

The large mismatch in thermoelastic properties of the fiber and matrix phases in advanced metal matrix composites, coupled with high consolidation temperatures, produces severe residual stresses that can be large enough to initiate microcracks in the matrix phase adjacent to the fiber/matrix interface. Previous investigations have demonstrated that the use of a compliant interfacial layer between fiber and matrix phases has the potential for reducing these residual stresses. In this paper, the influence of multiple compliant layers in reducing residual thermal stresses is investigated.

Pindera, Marek-Jerzy↗

Multiple Scattering Effects of Trees on L-band Microwave Using a Hybrid Method

The multiple scattering of electromagnetic waves in forests is studied using a two-step hybrid method. First, the T-matrix of a single tree is calculated based on its far-field computed with the full-wave simulations of the FEKO software. The T-matrix captures the multiple scattering caused by the tree structure. Second, the the interactions among different trees are considered using the T-matrices of the individual trees and the Foldy-Lax equations. The result of the two-step hybrid method is validated with FEKO by solving scattering from two trees directly. The multiple scattering effects are illustrated by the field solutions.

Yueh, Simon↗

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Memristive linear algebra

The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. In particular, we demonstrate that the electrical properties of memristive crossbars uniquely suit them for the evolution of a family of matrix exponentials, which can be exploited for the efficient computation of matrix inverses and online solutions for linear problems. Our results demonstrate that memristive arrays can reduce computational complexity. We also study power consumption and show a tradeoff between precision and energy. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Woven ceramic matrix composite surrogate model based on physics-informed recurrent neural network

A recurrent neural network (RNN) based surrogate model is developed to emulate the nonlinear constitutive behavior of woven ceramic matrix composites (CMCs) driven by matrix damage at multiple length scales. Physics-informed constraints are introduced into the surrogate model through regularization to ground the prediction in physics and improve its predictive capabilities. Training data is generated using the multiscale generalized method of cells (MSGMC) approach coupled with a matrix damage model. This coupling permits simulating the nonlinear behavior of woven CMCs based on constituent response at the micro-, meso-, and macroscales. The multiscale repeating unit cell is loaded under non-monotonic conditions including multiple load / unload cycles and tension / compression. The fiber volume fraction as well as the intra- and intertow void volume fractions are also varied in the generation of training data. Therefore, the RNN-based surrogate model is tasked with predicting, as a function of variable input strain sequence and fiber and void volume fractions, the resulting stress versus strain response while satisfying physical constraints such as positive semi-definiteness of the tangent stiffness matrix and linear elastic unloading. Further, the trained surrogate model effectively matches the stress versus strain response and successfully predicts the tangent modulus throughout the loading regime. Neural network based surrogate models can offer efficient alternatives to running computationally intensive multiscale material models to simulate the nonlinear response of large structural models. Therefore the presented work provides evidence towards the feasibility of developing, training, and running such models for CMCs with complex architectures, nonlinear multiaxial material response, and under non-monotonic loading conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications

Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.

complex networks↗

Evaluation of fluxon synapse device based on superconducting loops for energy efficient neuromorphic computing

With Moore’s law nearing its end due to the physical scaling limitations of CMOS technology, alternative computing approaches have gained considerable attention as ways to improve computing performance. Here, we evaluate performance prospects of a new approach based on disordered superconducting loops with Josephson-junctions for energy efficient neuromorphic computing. Synaptic weights can be stored as internal trapped fluxon states of three superconducting loops connected with multiple Josephson-junctions (JJ) and modulated by input signals applied in the form of discrete fluxons (quantized flux) in a controlled manner. The stable trapped fluxon state directs the incoming flux through different pathways with the flow statistics representing different synaptic weights. We explore implementation of matrix–vector-multiplication (MVM) operations using arrays of these fluxon synapse devices. We investigate the energy efficiency of online-learning of MNIST dataset. Our results suggest that the fluxon synapse array can provide ~100× reduction in energy consumption compared to other state-of-the-art synaptic devices. This work presents a proof-of-concept that will pave the way for development of high-speed and highly energy efficient neuromorphic computing systems based on superconducting materials.

42 ENGINEERING↗

Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. Furthermore, this is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this article, we present a performance study of an enlarged Krylov method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.

97 MATHEMATICS AND COMPUTING↗

Loop equation and exact soft anomalous dimension in $ \mathcal{N} $ = 4 super Yang-Mills

BPS Wilson loops in supersymmetric gauge theories have been the subjects of active research since they are often amenable to exact computation. So far most of the studies have focused on loops that do not intersect. In this paper, we derive exact results for intersecting 1/8 BPS Wilson loops in $ \mathcal{N} $ = 4 supersymmetric Yang-Mills theory, using a combination of supersymmetric localization and the loop equation in 2d gauge theory. The result is given by a novel matrix-model-like representation which couples multiple contour integrals and a Gaussian matrix model. We evaluate the integral at large N, and make contact with the string worldsheet description at strong coupling. As an application of our results, we compute exactly a small-angle limit (and more generally near-BPS limits) of the cross anomalous dimension which governs the UV divergence of intersecting Wilson lines. The same quantity describes the soft anomalous dimension of scattering amplitudes of W-bosons in the Coulomb branch.

't Hooftand Polyakov loops↗

Structural and Dynamical Roles of Bound Polymer Chains in Rubber Reinforcement

The addition of nanofillers to rubber matrices is a powerful route to improve the mechanical properties. Here, we focus on a molecular understanding of basic mechanisms that are important for the reinforcement in rubbers. The key role in this process is ascribed to bound rubber (BR) that engages with the matrix as well as with adjacent nanofillers. To date, this understanding has been impeded by the lack of experimental tools to directly probe the BR chains buried in a polymer matrix composed of the same polymer. To tackle this challenge, we combine neutron scattering/spectroscopy techniques with isotope-labeling and molecular dynamics simulations. The system is a simplified carbon-black-filled polybutadiene. The combined experimental and computational results provide new insights into the local structural and dynamical heterogeneities of BR chains and their interactions with the matrix polymer, highlighting (i) the structural partition of the bound chains into three components (i.e., trains, loops, and tails) and their fractions; (ii) their dynamical hierarchies, i.e., the trains that remain immobile on the filler surface, the loops that are fairly large and hence allow the interdigitation of matrix chains, and the tails with their unique characteristics to reach far out into the matrix and entangle with matrix chains. These multiple roles of the constituent components of the BR chains promote the formation of a well-developed adhesive polymer–filler interface, enhancing the elastic property of a filled rubber. Finally, the comprehensive understanding derived and validated by the model rubber will be translatable to many other polymer nanocomposites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Skewness-dependent moments of the pion GPD from nonlocal quark-bilinear correlators

We present lattice QCD calculations of the odd Mellin moments of pion valence-quark generalized parton distribution up to fifth order ⟨𝑥 4 ⟩ and for the skewness range [−0.33, 0] using operator product expansion of bilocal quark-bilinear operators. The calculations are performed on an ensemble with lattice spacing 𝑎 = 0.04 fm and valence pion mass 300 MeV, employing boosted pion states with momenta up to 2.428 GeV and momentum transfers reaching 2.748 GeV 2 . We employ ratio-scheme renormalization and next-to-leading logarithmic resummed perturbative matching. At zero skewness, our results are consistent with previous lattice studies. By combining matrix elements at multiple values of skewness and momentum transfer, skewness-dependent moments are obtained through simultaneous polynomiality-constrained fits.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

3D Deep Learning Joint Inversion of Active Seismic Full Waveform and Passive Seismic Traveltime Data for Reservoir Imaging and Uncertainty Quantification

Here, we present deep learning (DL) networks for three-dimensional (3D) joint inversion of active seismic full waveform and passive seismic traveltime data to image reservoirs and their properties and quantify imaging uncertainties. Active seismic full-waveform data can provide high-resolution monitoring images but are collected only intermittently because of their high acquisition cost. In contrast, passive seismic data can be gathered at relatively low cost between regular active surveys, although their imaging quality can be compromised by factors such as low signal-to-noise ratios and limited ray coverage of the target. Although these datasets are routinely acquired together at CO 2 storage sites, their combined inversion within a 3D DL framework has not been previously demonstrated. To our knowledge, this is the first study to address this gap, combining the strength of both data types. For efficient data storage and DL training with large 3D seismic datasets, we use a 3D data matrix in which a random number of passive seismic traveltime data are stored as parabolic envelopes using one-hot encoding and a 3D full-waveform data matrix in which multiple shot gathers are summed. Two network architectures are evaluated: a single-encoder U-Net for single-data type inversion and a dual-encoder U-Net for joint inversion of active and passive seismic data. We also evaluate the single-encoder U-Net for joint inversion by concatenating full-waveform data and traveltime data. We propose a systematic approach for selecting an optimal dropout rate that balances regularization during training and Monte Carlo dropout-based uncertainty quantification during prediction by examining the correlation coefficient between standard deviation and prediction error, along with the training misfit, across a range of dropout rates. 3D DL inversion experiments include five different network configurations, with evaluations under ideal, noisy and dropout-enabled conditions. Both model and data uncertainties are assessed, as well as their combined effects. Across all conditions, the networks consistently predict accurate CO 2 saturation models with low prediction errors, such as a structural similarity index of 0.993 and CO 2 difference of 1.1%. Uncertainty estimates show strong spatial correlation with prediction errors, confirming the effectiveness of the proposed dropout selection approach. The results demonstrate that our DL approach, utilizing compact data representations and appropriate uncertainty quantification, yields accurate subsurface images under various inversion conditions and provides valuable insights into the reliability of predictions.

Um, Evan Schankee [Lawrence Berkeley National Labo↗

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↗

Data Report: High-Resolution Microscopy Images of Sediments from Green Canyon Block 955, Gulf of Mexico

We took Leica microscopy images of sediment samples acquired at Holes H002 (4 samples) and H005 (1 sample) during the UT-GOM2-1 Expedition in Green Canyon Block 955, in the northern Gulf of Mexico. A total of 37 images were acquired. The images document a prevalence of spherical conchoidal minerals, cleavage planes typical of feldspar or mica, and black fragmented minerals which stand out from the surrounding matrix. Drilling mud intrusion is thought to contribute to a grey metallic matrix observed across multiple samples.

03 NATURAL GAS↗

Modal testing with Asher's method using a Fourier analyzer and curve fitting

An unusual application of the method proposed by Asher (1958) for structural dynamic and modal testing is discussed. Asher's method has the capability, using the admittance matrix and multiple-shaker sinusoidal excitation, of separating structural modes having indefinitely close natural frequencies. The present application uses Asher's method in conjunction with a modern Fourier analyzer system but eliminates the necessity of exciting the test structure simultaneously with several shakers. Evaluation of this approach with numerically simulated data demonstrated its effectiveness; the parameters of two modes having almost identical natural frequencies were accurately identified. Laboratory evaluation of this approach was inconclusive because of poor experimental input data.

Gold, R. R.↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗