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 703 records · Page 39

High-performance strategies for the recent MRSF-TDDFT in GAMESS

Multiple ERI (Electron Repulsion Integral) tensor contractions (METC) with several matrices are ubiquitous in quantum chemistry. In response theories, the contraction operation, rather than ERI computations, can be the major bottleneck, as its computational demands are proportional to the multiplicatively combined contributions of the number of excited states and the kernel pre-factors. Here, this paper presents several high-performance strategies for METC. Optimal approaches involve either the data layout reformations of interim density and Fock matrices, the introduction of intermediate ERI quartet buffer, and loop-reordering optimization for a higher cache hit rate. The combined strategies remarkably improve the performance of the MRSF (mixed reference spin flip)-TDDFT (time-dependent density functional theory) by nearly 300%. The results of this study are not limited to the MRSF-TDDFT method and can be applied to other METC scenarios.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Matrix-formation dynamics dictate methyl nitrite conformer abundance

Methyl nitrite has two stable conformational isomers resulting from rotation about the primary C–O–N–O dihedral angle: cis-CH 3 ONO and trans-CH 3 ONO, with cis being more stable by ∼5 kJ/mol. Here, the barrier to rotational interconversion (∼45 kJ/mol) is too large for isomerization to occur under ambient conditions. This paper presents evidence of a change in conformer abundance when dilute CH 3 ONO is deposited onto a cold substrate; the relative population of the freshly deposited cis conformer is seen to increase compared to its gas-phase abundance, measured by in situ infrared spectroscopy. We observe abundance changes depending on the identity of the bath gas (N 2 , Ar, and Xe) and deposition angle. The observations indicate that the surface properties of the growing matrix influence conformer abundance—contrary to the widely held assumption that conformer abundance in matrices reflects gas-phase abundance. We posit that differences in the angle-dependent host-gas deposition dynamics affect the growing surfaces, causing changes in conformer abundances. Quantum chemistry calculations of the binding energies between CH 3 ONO and a single bath-gas component reveal that significant energetic stabilization is not observed in 1:1 complexes of N 2 :CH 3 ONO, Ar:CH 3 ONO, or Xe:CH 3 ONO. From our results, we conclude that the growing surface plays a significant role in trapping cis-CH 3 ONO more effectively than trans-CH 3 ONO, likely because cis-CH 3 ONO is more compact. Taken together, the observations highlight the necessity for careful characterization of conformers in matrix-isolated systems, emphasizing a need for further study into the deposition dynamics and surface structure of chemically inert matrices.

Hockey, Emily K.↗

Performance of an atomic mean-field spin–orbit approach within exact two-component theory for perturbative treatment of spin–orbit coupling

The paper reports development of an atomic mean-field (AMF) spin–orbit approach within the spin-free exact two-component theory in its one-electron variant (SFX2C-1e), a new relativistic quantum-chemical method for treating spin-orbit coupling in molecules. The effective one-electron spin–orbit integral matrix in the four-component representation is assembled as a direct sum of one-centre spin–orbit integral matrices with the mean-field two-electron contributions evaluated using atomic SFX2C-1e Hartree–Fock density matrices. It is then transformed into two-component representation using analytic SFX2C-1e energy derivative formulation. The resulting two-component spin–orbit integral matrix is by design suitable for use in perturbative calculations of spin–orbit coupling, treating SFX2C-1e wavefunctions as unperturbed states. The accuracy of the present AMF approach has been demonstrated using benchmark calculations of spin–orbit splittings for representative diatomic radicals at the equation-of-motion coupled-cluster singles and doubles level. In conclusion, to demonstrate the applicability and accuracy of the present perturbative spin–orbit scheme in calculations of challenging heavy-element containing systems, a thorough computational investigation of six low-lying electronic states of ThO+ is reported.

74 ATOMIC AND MOLECULAR PHYSICS↗

Particle hit clustering and identification using point set transformers in liquid argon time projection chambers

Liquid argon time projection chambers are often used in neutrino physics and dark-matter searches because of their high spatial resolution. The images generated by these detectors are extremely sparse, as the energy values detected by most of the detector are equal to 0, meaning that despite their high resolution, most of the detector is unused in a particular interaction. Instead of representing all of the empty detections, the interaction is usually stored as a sparse matrix, a list of detection locations paired with their energy values. Traditional machine learning methods that have been applied to particle reconstruction such as convolutional neural networks (CNNs), however, cannot operate over data stored in this way and therefore must have the matrix fully instantiated as a dense matrix. Operating on dense matrices requires a lot of memory and computation time, in contrast to directly operating on the sparse matrix. We propose a machine learning model using a point set neural network that operates over a sparse matrix, greatly improving both processing speed and accuracy over methods that instantiate the dense matrix, as well as over other methods that operate over sparse matrices. Compared to competing state-of-the-art methods, our method improves classification performance by 14%, segmentation performance by more than 22%, while taking 80% less time and using 66% less memory. Compared to state-of-the-art CNN methods, our method improves classification performance by more than 86%, segmentation performance by more than 71%, while reducing runtime by 91% and reducing memory usage by 61%.

calibration and fitting methods↗

A neural network for determination of latent dimensionality in Nonnegative Matrix Factorization

Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy datasets with applications in data mining, text recognition, dimension reduction, face recognition, anomaly detection, blind source separation, and many other fields. An important input for NMF is the latent dimensionality of the data, that is, the number of hidden features, K, present in the explored dataset. Unfortunately, and this quantity is rarely known a priori. The existing methods for determining latent dimensionality, such as Automatic Relevance Determination (ARD), are mostly heuristic and utilize different characteristics to estimate the number of hidden features. However, all of them require human presence to make a final determination of K. Here we utilize a supervised machine learning approach in combination with a recent method for model determination, called NMFk, to determine the number of hidden features automatically. NMFk performs a set of NMF simulations on an ensemble of matrices, obtained by bootstrapping the initial dataset, and estimates which K produces stable groups of latent features that reconstruct the initial dataset well. We then train a Multi-Layter Perceptron (MLP) classifier network to determine the correct number of latent features utilizing the statistics and characteristics of the NMF solution, obtained from NMFk. In order to train the MLP classifier, a training set of 58,660 matrices with predetermined latent features were factorized with NMFk. The MLP classifier in conjunction with NMFk maintains a greater than 95% success rate when applied to a held out test set. Additionally, when applied to two well-known benchmark datasets, the swimmer and MIT face data, NMFk/MLP correctly recovers the established number of hidden features. Finally, we compare the accuracy of our method to the ARD, AIC and Stability-based methods.

97 MATHEMATICS AND COMPUTING↗

Towards real-time monitoring: data assimilated time-lapse full waveform inversion for seismic velocity and uncertainty estimation

SUMMARY Rapid development of time-lapse seismic monitoring instrumentations has made it possible to collect dense time-lapse data for tomographically retrieving time-lapse (even continuous) images of subsurface changes. While traditional time-lapse full waveform inversion (TLFWI) algorithms are designed for sparse time-lapse surveys, they lack of effective temporal constraint on time-lapse data, and, more importantly, lack of the uncertainty estimation of the TLFWI results that is critical for further interpretation. Here, we propose a new data assimilation TLFWI method, using hierarchical matrix powered extended Kalman filter (HiEKF) to quantify the image uncertainty. Compared to existing Kalman filter algorithms, HiEKF allows to store and update a data-sparse representation of the cross-covariance matrices and propagate model errors without expensive operations involving covariance matrices. Hence, HiEKF is computationally efficient and applicable to 3-D TLFWI problems. Then, we reformulate TLFWI in the framework of HiEKF (termed hereafter as TLFWI-HiEKF) to predict time-lapse images of subsurface spatiotemporal velocity changes and simultaneously quantify the uncertainty of the inverted velocity changes over time. We demonstrate the validity and applicability of TLFWI–HiEKF with two realistic CO2 monitoring models derived from Frio-II and Cranfield CO2 injection sites, respectively. In both 2-D and 3-D examples, the inverted high-resolution time-lapse velocity results clearly reveal a continuous velocity reduction due to the injection of CO2. Moreover, the accuracy of the model is increasing over time by assimilating more time-lapse data while the standard deviation is decreasing over lapsed time. We expect TLFWI-HiEKF to be equipped with real-time seismic monitoring systems for continuously imaging the distribution of subsurface gas and fluids in the future large-scale CO2 sequestration experiments and reservoir management.

58 GEOSCIENCES↗

Linear complexity

We present factorization and solution phases for a new linear complexity direct solver designed for concurrent batch operations on fine-grained parallel architectures, for matrices amenable to hierarchical representation. We focus on the strong-admissibility-based $\mathscr{H}^{2}$ format, where strong recursive skeletonization factorization compresses remote interactions. We build upon previous implementations of $\mathscr{H}^{2}$ matrix construction for efficient factorization and solution algorithm design, which are illustrated graphically in stepwise detail. The algorithms are ‘blackbox’ in the sense that the only inputs are the matrix and right-hand side, without analytical or geometrical information about the origin of the system. We demonstrate linear complexity scaling in both time and memory on four representative families of dense matrices up to one million in size. Parallel scaling up to 16 threads is enabled by a multi-level matrix graph coloring and avoidance of dynamic memory allocations thanks to prefix-sum memory management. An experimental backward error analysis is included. We break down the timings of different phases, identify phases that are memory-bandwidth limited, and discuss alternatives for phases that may be sensitive to the trend to employ lower precisions for performance.

Boukaram, Wajih↗

Climate history modulates stress responses of common soil bacteria under experimental drought

Soil drying challenges microbial viability and survival, with bacteria employing various mechanisms to respond to shifts in osmolarity, including dormancy or metabolic upregulation of osmoprotectants. However, the extent to which these responses are shaped by an organism's phylogeny, or the climate history of a given environment is poorly understood. This study examines the responses of phylogenetically similar bacteria from semi-arid and humid tropical forest soils to osmotic and matric stress using synchrotron radiation-based Fourier Transform Infrared spectromicroscopy. This non-destructive approach depicts the biochemical phenotype for whole cells under control and stress conditions. We observed that, under osmotic stress, bacteria upregulated cell-signaling pathways, rapidly turned over lipid-storage compounds, and increased osmolyte production. In contrast, matric stress induced a more muted response, typically elevating the production of carbohydrate stress compounds, such as glycine betaine and trehalose. Whereas phylogenetically similar bacteria showed comparable biochemistry under control conditions, climate history played an important role in regulating responses to stress, whereby a stronger metabolic response was observed from semi-arid relative to tropical forest isolates. We conclude that bacterial stress response to drought can be more diverse than previously observed and regulated by both phylogeny and climate history.

54 ENVIRONMENTAL SCIENCES↗

Using angular two-point correlations to self-calibrate the photometric redshift distributions of DECaLS DR9

Calibrating the redshift distributions of photometric galaxy samples is essential in weak lensing studies. The self-calibration method combines angular auto- and cross-correlations between galaxies in multiple photometric redshift (photo-z) bins to reconstruct the scattering rates matrix between redshift bins. In this paper, we test a recently proposed self-calibration algorithm using the DECaLS Data Release 9 and investigate to what extent the scattering rates are determined. We first mitigate the spurious angular correlations due to imaging systematics by a machine learning based method. We then improve the algorithm for χ 2 minimization and error estimation. Finally, we solve for the scattering matrices, carry out a series of consistency tests, and find reasonable agreements: (1) finer photo-z bins return a high-resolution scattering matrix, and it is broadly consistent with the low-resolution matrix from wider bins; (2) the scattering matrix from the Northern Galactic Cap is almost identical to that from Southern Galactic Cap; (3) the scattering matrices are in reasonable agreement with those constructed from the power spectrum and the weighted spectroscopic subsample. We also evaluate the impact of cosmic magnification. Although it changes little the diagonal elements of the scattering matrix, it affects the off-diagonals significantly. The scattering matrix also shows some dependence on scale cut of input correlations, which may be related to a known numerical degeneracy between certain scattering pairs. In conclusion, this work demonstrates the feasibility of the self-calibration method in real data and provides a practical alternative to calibrate the redshift distributions of photometric samples.

79 ASTRONOMY AND ASTROPHYSICS↗

Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks

Here we propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.

97 MATHEMATICS AND COMPUTING↗

Quarkonium Spectroscopy in the Quark-Gluon Plasma

The properties of bound states are fundamental to hadronic spectroscopy and play a central role in the transition from hadronic matter to a quark-gluon plasma (QGP). In a strongly coupled QGP (sQGP), the interplay of temperature, binding energy, and large collisional widths of the partons poses formidable challenges in evaluating the in-medium properties of hadronic states and their eventual melting. In particular, the existence of heavy quarkonia in the QGP is a long-standing problem that is hard to solve by considering their spectral properties on the real-energy axis. Here, we address this problem by analyzing in-medium thermodynamic quarkonium 𝑇 matrices in the complex energy plane. We first validate this method in vacuum, where the 𝑇-matrix poles of observed states are readily identified. When deploying this approach to recent self-consistently calculated 𝑇 matrices in the QGP, we find that poles in the complex energy plane can persist to surprisingly large temperatures, depending on the strength of the in-medium interactions. While the masses and widths of the pole positions are precisely defined, the notion of a binding energy is not due to the absence of thresholds caused by the (large) widths of the underlying quark or anti-quark spectral functions. Our method thus provides a new and definitive quantum-mechanical criterion to determine the melting temperature of hadronic states in the sQGP while increasing the accuracy in the theoretical determination of transport parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Block Mott insulating state induced by next-nearest-neighbor hopping in the S = 3 2 zigzag chain BaCoTe 2 O 7

Quasi-one-dimensional correlated electronic multiorbital systems with either ladder or chain geometries continue attracting considerable interest due to their complex electronic phases arising from the interplay of the hopping matrix, the crystal-field splitting, the electronic correlations (Hubbard repulsion U and Hund coupling J H ), and strong quantum fluctuations. Recently, the intriguing cobalt zigzag chain system BaCoTe 2 ⁢ O 7 , with electronic density n=7, was prepared experimentally. Here, we systematically study the electronic and magnetic properties of this quasi-one-dimensional compound from the theoretical perspective. Based on first-principles density functional theory calculations, strongly anisotropic one-dimensional electronic Co 3⁢d bands were found near the Fermi level. By evaluating the relevant hopping amplitudes, we provide the magnitude and origin of the nearest-neighbor (NN) and next-nearest-neighbor (NNN) hopping matrices in BaCoTe 2 ⁢ O 7 . With this information, we constructed a three-orbital electronic Hubbard model for this zigzag chain system, and studied two cases: with only a NN hopping matrix, and with NN plus NNN hopping matrices. Introducing the Hubbard and Hund couplings and studying the model via the density matrix renormalization group method, we constructed the ground-state phase diagram. A robust staggered ↑ - ↓ - ↑ - ↓ antiferromagnetic (AFM) region was found when only the NN hopping matrix in the chain direction was employed. However, for the realistic case where the NNN hopping matrix is also included, the dominant state becomes instead a block AFM ↑ - ↑ - ↓ - ↓ order, in agreement with experiments. The system displays Mott insulator characteristics with three half-filled orbitals, when the block AFM order is stable. In conclusion, our results for BaCoTe 2 ⁢O 7 provide guidance to experimentalists and theorists working on this zigzag one-dimensional chain and related materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Constraints on Λ CDM extensions from the SPT-3G 2018 $EE$ and $TE$ power spectra

Here, we present constraints on extensions to the Λ CDM cosmological model from measurements of the E-mode polarization autopower spectrum and the temperature-E-mode cross-power spectrum of the cosmic microwave background (CMB) made using 2018 SPT-3G data. The extensions considered vary the primordial helium abundance, the effective number of relativistic degrees of freedom, the sum of neutrino masses, the relativistic energy density and mass of a sterile neutrino, and the mean spatial curvature. We do not find clear evidence for any of these extensions, from either the SPT-3G 2018 dataset alone or in combination with baryon acoustic oscillation and Planck data. None of these model extensions significantly relax the tension between Hubble-constant, H 0 , constraints from the CMB and from distance-ladder measurements using Cepheids and supernovae. The addition of the SPT-3G 2018 data to Planck reduces the square-root of the determinants of the parameter covariance matrices by factors of 1.3–2.0 across these models, signaling a substantial reduction in the allowed parameter volume. We also explore CMB-based constraints on H 0 from combined SPT, Planck, and ACT DR4 datasets. While individual experiments see some indications of different H 0 values between the TT, TE, and EE spectra, the combined H 0 constraints are consistent between the three spectra. For the full combined datasets, we report H 0 = 67.49 ± 0.53 km s -1 Mpc -1 , which is the tightest constraint on H0 from CMB power spectra to date and in 4.1σ tension with the most precise distance-ladder-based measurement of H 0 . The SPT-3G survey is planned to continue through at least 2023, with existing maps of combined 2019 and 2020 data already having ~ 3.5 x lower noise than the maps used in this analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗

Two transitions in complex eigenvalue statistics: Hermiticity and integrability breaking

Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics, when chaotic, or two-dimensional (2d) Poisson statistics, when integrable. We investigate the spectral properties of a many-body quantum spin chain, i.e., the Hermitian Heisenberg model with imaginary disorder. Its rich complex eigenvalue statistics is found to separately break both Hermiticity and integrability at different scales of the disorder strength. With no disorder, the system is integrable and Hermitian, with spectral statistics corresponding to the 1d Poisson point process. At very small disorder, we find a transition from 1d Poisson statistics to an effective D -dimensional Poisson point process, showing Hermiticity breaking. At intermediate disorder, we find integrability breaking, as inferred from the statistics matching that of non-Hermitian complex symmetric random matrices in class AI † . For large disorder, as the spins align, we recover the expected integrability (now in the non-Hermitian setup), indicated by 2d Poisson statistics. These conclusions are based on fitting the spin-chain data of numerically generated nearest- and next-to-nearest-neighbor spacing distributions to an effective 2d Coulomb gas description at inverse temperature β . We confirm that such an effective description of random matrices also applies in classes AI † and AII † up to next-to-nearest-neighbor spacings. Published by the American Physical Society 2025

Akemann, Gernot (ORCID:0000000217104258)↗