Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRICES”

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 181 records · Page 10

DESI mock challenge: constructing DESI galaxy catalogues based on FastPM simulations

Together with larger spectroscopic surveys such as the Dark Energy Spectroscopic Instrument (DESI), the precision of large-scale structure studies and thus the constraints on the cosmological parameters are rapidly improving. Therefore, one must build realistic simulations and robust covariance matrices. We build galaxy catalogues by applying a halo occupation distribution (HOD) model upon the FastPM simulations, such that the resulting galaxy clustering reproduces high-resolution N-body simulations. While the resolution and halo finder are different from the reference simulations, we reproduce the reference galaxy two-point clustering measurements – monopole and quadrupole – to a precision required by the DESI Year 1 emission line galaxy sample down to non-linear scales, i.e. $k\lt 0.5\, h\, \mathrm{Mpc}^{-1}$ or $s\gt 10\, \mathrm{Mpc}\, h^{-1}$. Furthermore, we compute covariance matrices based on the resulting FastPM galaxy clustering – monopole and quadrupole. We study for the first time the effect of fitting on Fourier conjugate (e.g. power spectrum) on the covariance matrix of the Fourier counterpart (e.g. correlation function). We estimate the uncertainties of the two parameters of a simple clustering model and observe a maximum variation of 20 per cent for the different covariance matrices. Nevertheless, for most studied scales the scatter is between 2 and 10 per cent. Consequently, using the current pipeline we can precisely reproduce the clustering of N-body simulations and the resulting covariance matrices provide robust uncertainty estimations against HOD fitting scenarios. We expect our methodology will be useful for the coming DESI data analyses and their extension for other studies.

79 ASTRONOMY AND ASTROPHYSICS↗

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗

Microporous structure in silicone polymers with polylactic acid and polyethylene glycol microspheres: Synthesis and characterization

Porosity in polymer parts could improve mechanical properties while reducing weight and density. Individual pores must be small enough that bulk mechanical properties are retained but significant enough to reduce the density of the material. Filler materials can be incorporated into polymer matrices and removed to create voids. Here, this paper focuses on creating spherical pores in silicone matrices by inserting and removing core materials or fillers during post-cure. A method was developed to incorporate pore formers into an uncured polymer resin and remove the pore former materials from the matrix. Polyethylene glycol (PEG) and polylactic acid (PLA) microspheres were created and incorporated into silicone matrices as pore formers. Microspheres with controllable size distributions were formed via an emulsion formation. Microspheres are removed from the matrix by solvent extraction and calcination. Thermogravimetric Analysis (TGA), Dynamic Mechanical Analysis (DMA), and optical imaging characterize and determine the successful creation of micropores in the polymer matrices.

36 MATERIALS SCIENCE↗

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nanocomposite Ionogel Electrolytes for Solid‐State Rechargeable Batteries

Abstract Ionogels composed of ionic liquids and gelling solid matrices offer several advantages as solid‐state electrolytes for rechargeable batteries, including safety under diverse operating conditions, favorable electrochemical and thermal properties, and wide processing compatibility. Among gelling solid matrices, nanoscale materials have shown particular promise due to their ability to concurrently enhance ionogel mechanical properties, thermal stability, ionic conductivity, and electrochemical stability. These beneficial attributes suggest that ionogel electrolytes are not only of interest for incumbent lithium‐ion batteries but also for next‐generation rechargeable battery technologies. Herein, recent advances in nanocomposite ionogel electrolytes are discussed to highlight their advantages as solid‐state electrolytes for rechargeable batteries. By exploring a range of different nanoscale gelling solid matrices, relationships between nanoscale material structure and ionogel properties are developed. Furthermore, key research challenges are delineated to help guide and accelerate the incorporation of nanocomposite ionogel electrolytes in high‐performance solid‐state rechargeable batteries.

Hyun, Woo Jin↗

Flavor in SU(5)$SU(5)$ Finite Grand Unified Models

Abstract Four supersymmetric models which exhibit and/or symmetries are studied, that are finite to two or all loops, and their corresponding mass matrices. The first is an all‐loop finite model based on an flavor symmetry, which leads to phenomenologically nonviable mass matrices. The remaining models, based on cyclic symmetries, show various mass textures, some of which are phenomenologically promising. For the two‐loop finite models, the parametric solutions to the finiteness conditions determine completely some of the Yukawa couplings, and lead to a restricted range of values for other ones at the GUT scale, with a considerable reduction in the number of free parameters. One particular solution of the two‐loop models shows an enhanced symmetry, leading to an all‐loop finite model, which has a significant parameter reduction and could in principle reproduce the observed quark masses and mixing pattern. In this case the finiteness conditions determine the absolute value of all the Yukawa couplings at the unification scale. Finally, the minimum number of phases in the mass matrices and their position are determined, a task not previously done in Finite Unified Theories, which contributes towards the reduction of parameters and a better understanding of the Yukawa couplings.

Estrada Ramos, Luis Odín↗

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗

The O(N) S-matrix monolith

We consider the scattering matrices of massive quantum field theories with no bound states and a global O(N) symmetry in two spacetime dimensions. In particular we explore the space of two-to-two S-matrices of particles of mass m transforming in the vector representation as restricted by the general conditions of unitarity, crossing, analyticity and O(N) symmetry. We found a rich structure in that space by using convex maximization and in particular its convex dual minimization problem. At the boundary of the allowed space special geometric points such as vertices were found to correspond to integrable models. The dual convex minimization problem provides a novel and useful approach to the problem allowing, for example, to prove that generically the S-matrices so obtained saturate unitarity and, insome cases, that they are at vertices of the allowed space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dirac traces and the Tutte polynomial

Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the consequence of replacing 4-dimensional Dirac matrices with d-dimensional counterparts for arbitrary complex values of d. In this work, a connection between traces of d-dimensional Dirac matrices and computations of the Tutte polynomial of associated graphs is proven. The time complexity of computing Dirac traces is analysed by this connection, and improvements to algorithms for computing Dirac traces are proposed.

Renormalization and Regularization↗

Separation of gold from irradiated actinide material utilizing a 2- thenoyltrifluoroacetone extraction resin

Post-detonation nuclear forensics capabilities depend on the ability to rapidly isolate radionuclides to improve measurement quality. In this work an extraction chromatography resin was developed utilizing the extractants thenoyltrifluoroacetone and 1-octanol supported on Eichrom prefilter resin. Here the resin was tested in nitric and hydrochloric acid matrices. In nitric acid matrices the resin is able to extract zirconium, while in hydrochloric acid matrices it is possible to extract iron and gallium. In all acid conditions tested gold is retained but can be removed from the column with a 10% thiourea rinse.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

Towards the scale-up production of cellulose nanocomposites using melt processing: A critical review on structure-processing-property relationships

Cellulose nanomaterials (CNMs) naturally exist in plant biomass. The success of extraction of CNMs opened up a new era of using plant biomass for innovative industrial applications. Because CNMs are abundant, renewable, biodegradable, transparent, light weight and low in cost, they are ideal materials for large volume applications such as packaging, automotive, building and infrastructure. In many potential application areas, CNM-enable products appear in a composite form, mostly polymer composites. Additionally, the industrial-scale manufacturing of CNM/thermoplastic composites remains as a set of unsolved problems for academia and industry. A prime challenge in applications is the nanoscale dispersion of CNMs in thermoplastic matrices during melt processing. Both bench-scale and pilot-scale studies have been conducted to solve the dispersion issue of CNMs. In this article, research related to the dispersion of CNMs in thermoplastic matrices during melt processing were critically reviewed. All research papers were classified into three groups: chemically-aided dispersion, physically-aided dispersion and mechanically-aided dispersion. Numerous factors affect the CNM dispersion and the mechanical performance of its nanocomposites. There are material-related factors, including CNM types and forms, polymer matrices, surface modification, coupling agents, etc. Furthermore, extrusion processing parameters also play a significant role, covering screw rotation speed, extrusion barrel temperature settings and screw design. In addition, the material-related factors interact with the processing-related factors. Understanding all factors and their interactions are important for moving CNM nanocomposites research a step further towards industrial-relevant production, which is the final ambitious goal of this manuscript.

42 ENGINEERING↗

A genome-scale phylogeny of the kingdom Fungi

Phylogenomic studies using genome-scale amounts of data have greatly improved understanding of the tree of life. Despite the diversity, ecological significance, and biomedical and industrial importance of fungi, evolutionary relationships among several major lineages remain poorly resolved, especially those near the base of the fungal phylogeny. To examine poorly resolved relationships and assess progress toward a genome-scale phylogeny of the fungal kingdom, we compiled a phylogenomic data matrix of 290 genes from the genomes of 1,644 species that includes representatives from most major fungal lineages. We also compiled 11 data matrices by subsampling genes or taxa from the full data matrix based on filtering criteria previously shown to improve phylogenomic inference. Analyses of these 12 data matrices using concatenation- and coalescent-based approaches yielded a robust phylogeny of the fungal kingdom, in which ~85% of internal branches were congruent across data matrices and approaches used. We found support for several historically poorly resolved relationships as well as evidence for polytomies likely stemming from episodes of ancient diversification. By examining the relative evolutionary divergence of taxonomic groups of equivalent rank, we found that fungal taxonomy is broadly aligned with both genome sequence divergence and divergence time but also identified lineages where current taxonomic circumscription does not reflect their levels of evolutionary divergence. Finally, our results provide a robust phylogenomic framework to explore the tempo and mode of fungal evolution and offer directions for future fungal phylogenetic and taxonomic studies.

59 BASIC BIOLOGICAL SCIENCES↗

Even spheres as joint spectra of matrix models

The Clifford spectrum is a form of joint spectrum for noncommuting matrices. This theory has been applied in photonics, condensed matter and string theory. In applications, the Clifford spectrum can be efficiently approximated using numerical methods, but this only is possible in low dimensional example. In this paper we examine the higher-dimensional spheres that can arise from theoretical examples. We also describe a constructive method to generate five real symmetric almost commuting matrices that have a K-theoretical obstruction to being close to commuting matrices. For this, we look to matrix models of topological electric circuits.

97 MATHEMATICS AND COMPUTING↗

A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo

For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. Here, in this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.

Luo, Ye [Argonne National Laboratory (ANL), Argonn↗

Nonlinear Architectures Can Alter the Dynamics of Polymer–Nanoparticle Composites

Polymer nanocomposites exhibit remarkable physical properties that are attractive for many applications. These systems have been so far investigated by using linear polymer chains; the role of polymer matrix architecture on local dynamics, bulk rheology and nanoparticle motion remains unexplored. Here, using quasielastic neutron scattering, bulk rheology and x-ray photon correlation spectroscopy, we investigated nanocomposites with spherical silica nanoparticles well dispersed in poly (ethylene oxide) matrices having different architectures (specifically linear, stars and hyperbranched). The results reveal that the mechanical reinforcement of the nanocomposites with the nonlinear polymers can be altered by orders of magnitude with respect to the conventional nanocomposite with the linear polymer. Additionally, the polymer compactness and inter-penetrability are found to play crucial roles in determining their bulk rheology. At microscopic level, average segmental dynamics is remarkably slowed down by the attractive NPs in the matrices of high degree of branching whereas no significant effect is observed in linear polymer matrix at the same NP loading. In addition, the nanoscale dynamics of particles in the compact nonlinear matrices exhibit strong decoupling from the bulk viscoelasticity, allowing their fast relaxation even at ≈ 30% by volume. These results provide an experimental evidence that macromolecular architecture is a powerful new tool for tuning the bulk rheological properties as well as the nanoscale dynamics of PNCs without the need for changing polymer molecular weight, nanoparticle size, shape, loading or dispersion state.

36 MATERIALS SCIENCE↗