Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix inequality”

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.

30 records · Page 2

Multivariate Curve Resolution (MCR) using Principal Components Inputs and Rigorous Equality and Inequality Constraints

This MATLAB pseudocode perform multivariate curve resolution (MCR) using PCA scores & loadings of data as inputs. It employs rigorous least squares equality and inequality constraints for all elements in the solution factor matrices. It also can be used to perform nonnegative matrix factorization. SAND2020-12650 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Van Benthem, Mark↗

Quantum field theory and the Bieberbach conjecture

An intriguing correspondence between ingredients in geometric function theory related to the famous Bieberbach conjecture (de Branges' theorem) and the non-perturbative crossing symmetric representation of 2-2 scattering amplitudes of identical scalars is pointed out. Using the dispersion relation and unitarity, we are able to derive several inequalities, analogous to those which arise in the discussions of the Bieberbach conjecture. We derive new and strong bounds on the ratio of certain Wilson coefficients and demonstrate that these are obeyed in one-loop Φ 4 theory, tree level string theory as well as in the S-matrix bootstrap. Further, we find two sided bounds on the magnitude of the scattering amplitude, which are shown to be respected in all the contexts mentioned above. Translated to the usual Mandelstam variables, for large |s|, fixed t, the upper bound reads |M(s,t)| ≲ |s 2 |. We discuss how Szegö's theorem corresponds to a check of univalence in an EFT expansion, while how the Grunsky inequalities translate into nontrivial, nonlinear inequalities on the Wilson coefficients.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entanglement and Bell inequalities with boosted t t ¯

The Large Hadron Collider provides a unique opportunity to study quantum entanglement and violation of Bell inequalities at the highest energy available today. In this paper, we will investigate these quantum correlations with top quark pair production, which represents a system of two-qubits. The semileptonic top pair channel has a factor of 6 increase in statistics and easier reconstruction with respect to the dileptonic channel. Although measuring the spin polarization of the hadronic top quark is known to be challenging, our study indicates that it is feasible to reconstruct the spin density matrix of the two-qubit system using an optimal hadronic polarimeter. This is achieved with the aid of jet substructure techniques and NN-inspired reconstruction methods, which improve the mapping between subjets and quarks. We find that entanglement can already be observed at more than the 5 σ level with existing data, and violation of Bell inequalities may be probed above the 4 σ level at the HL-LHC with 3 ab − 1 of data. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

A multi-physics constitutive model to predict hydrolytic aging in quasi-static behaviour of thin cross-linked polymers

The effect of hydrolytic aging on mechanical quasi-static responses of rubber-like materials, in particular, the idealized Mullins effect and permanent set have been modeled. The effect of hydrolytic damage on the mechanical integrity of the polymer matrix is modeled as the direct competition of two micro-structural phenomena (i) chain scission and (ii) reduction of cross-links. Both phenomena and their correlation were modeled and thus, the strain energy of the polymer matrix is written with respect to three independent mechanisms; i) the shrinking original matrix that has not been attacked by water, ii) conversion of the first network to a new network due to the reduction of the cross-links, and iii) energy loss from network degradation due to water attacks to polymer active agents. The proposed model satisfies the Clausius-Duhem inequality and is thus physically feasible. The model is validated with respect to sets of our experimental data and other sets available in the literature. The proposed model is based on the assumption of homogeneous diffusion and mainly relevant for thin samples. In view of its accuracy, interpret-ability, and deep insight it provides into the nature of damage accumulation, the model is a good choice for further implementation in FE applications.

42 ENGINEERING↗

Spin-spin entanglement in diffractive heavy-quark production

We calculate the spin density matrix of a heavy-quark-antiquark pair ($b\bar{⁢b}$, $c\bar{⁢c}$ or $s\bar{⁢s}$) diffractively produced in deep inelastic scattering and ultraperipheral collisions. We show that the Pomeron exchange leaves characteristic imprints on the entanglement pattern between the quark and the antiquark. For the longitudinally polarized virtual photon, the pair always exhibits maximal entanglement and maximal violation of the Bell-Clauser-Horne-Shimony-Holt inequality. For the transversely polarized photon, the pair is always entangled and Bell violating, reaching maximal entanglement and maximal violation simultaneously when the transverse momentum approximately equals the quark mass.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗

The 𝑚=2 amplituhedron and the hypersimplex: Signs, clusters, tilings, Eulerian numbers

The hypersimplex Δ <#comment/> k + 1 , n \Delta _{k+1,n} is the image of the positive Grassmannian G r k + 1 , n ≥ <#comment/> 0 Gr^{\geq 0}_{k+1,n} under the moment map. It is a polytope of dimension n − <#comment/> 1 n-1 in R n \mathbb {R}^n . Meanwhile, the amplituhedron A n , k , 2 ( Z ) \mathcal {A}_{n,k,2}(Z) is the projection of the positive Grassmannian G r k , n ≥ <#comment/> 0 Gr^{\geq 0}_{k,n} into the Grassmannian G r k , k + 2 Gr_{k,k+2} under a map Z ~ <#comment/> \tilde {Z} induced by a positive matrix Z ∈ <#comment/> M a t n , k + 2 > 0 Z\in Mat_{n,k+2}^{>0} . Introduced in the context of scattering amplitudes , it is not a polytope, and has full dimension 2 k 2k inside G r k , k + 2 Gr_{k,k+2} . Nevertheless, there seem to be remarkable connections between these two objects via T-duality , as conjectured by Łukowski, Parisi, and Williams [Int. Math. Res. Not. (2023)]. In this paper we use ideas from oriented matroid theory, total positivity, and the geometry of the hypersimplex and positroid polytopes to obtain a deeper understanding of the amplituhedron. We show that the inequalities cutting out positroid polytopes —images of positroid cells of G r k + 1 , n ≥ <#comment/> 0 Gr^{\geq 0}_{k+1,n} under the moment map—translate into sign conditions characterizing the T-dual Grasstopes —images of positroid cells of G r k , n ≥ <#comment/> 0 Gr^{\geq 0}_{k,n} under Z ~ <#comment/> \tilde {Z} . Moreover, we subdivide the amplituhedron into chambers , just as the hypersimplex can be subdivided into simplices, with both chambers and simplices enumerated by the Eulerian numbers. We use these properties to prove the main conjecture of Łukowski, Parisi, and Williams [Int. Math. Res. Not. (2023)]: a collection of positroid polytopes is a tiling of the hypersimplex if and only if the collection of T-dual Grasstopes is a tiling of the amplituhedron A n , k , 2 ( Z ) \mathcal {A}_{n,k,2}(Z) for all Z Z . Moreover, we prove Arkani-Hamed–Thomas–Trnka’s conjectural sign-flip characterization of A n , k , 2 \mathcal {A}_{n,k,2} , and Łukowski–Parisi–Spradlin–Volovich’s conjectures on m = 2 m=2 cluster adjacency and on positroid tiles for A n , k , 2 \mathcal {A}_{n,k,2} (images of 2 k 2k -dimensional positroid cells which map injectively into A n , k , 2 \mathcal {A}_{n,k,2} ). Finally, we introduce new cluster structures in the amplituhedron.

Parisi, Matteo↗

Analysis of a new multispecies tumor growth model coupling 3D phase-fields with a 1D vascular network

In this study, we present and analyze a mathematical model for tumor growth incorporating ECM erosion, interstitial flow, and the effect of vascular flow and nutrient transport. The model is of phase-field or diffused-interface type in which multiple phases of cell species and other constituents are separated by smooth evolving interfaces. The model involves a mesoscale version of Darcy’s law to capture the flow mechanism in the tissue matrix. Modeling flow and transport processes in the vasculature supplying the healthy and cancerous tissue, one-dimensional (1D) equations are considered. Since the models governing the transport and flow processes are defined together with cell species models on a three-dimensional (3D) domain, we obtain a 3D–1D coupled model.

3D–1D coupled blood flow models↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

Bell inequalities in 2-2 scattering

We consider Bell inequalities in 2-2 scattering of photons, gravitons, fermions, and pions. We choose measurement settings that give maximum Bell violation for maximally entangled states and calculate the relevant Bell inequalities for these processes. For photon scattering at low energies, quantum electrodynamics exhibits Bell violation for all scattering angles except for a small transverse region. This leads to a fine-tuning problem. Incorporating a light axion/axionlike particle removes the fine-tuning problem and constrains the axion-coupling–axion-mass parameters. Allowing for graviton exchange and demanding Bell violation in photon scattering, we find that the weak-gravity conjecture is satisfied. Quantum gravity effects on axion coupling is discussed. For 2-2 graviton scattering, we find that CEMZ bounds allow for, at most, small Bell violations. Restriction on the Weinberg angle is found by demanding Bell violation in Bhabha scattering. We use recent $S$-matrix bootstrap data for pions and photons to study the Bell parameter in the space of allowed $S$-matrices. In the photon case, we study the Bell parameters as a function of energy and find support for the effective field theory observations. We discuss Bell parameter for pion $S$-matrices, which are qutrits. For pions, we find that there is a minimization of a suitable Bell parameter for $S$-matrices which exhibit Regge behavior.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Globally optimal interferometry with lossy twin Fock probes

Parity or quadratic spin (e.g., J z 2 ) readouts of a Mach–Zehnder (MZ) interferometer probed with a twin Fock (TF) input state allow saturating the optimal sensitivity attainable among all mode-separable states with a fixed total number of particles but only when the interferometer phase θ is near zero. When more general Dicke state probes are used, the parity readout saturates the quantum Fisher information (QFI) at θ = 0, whereas better-than-standard quantum limit performance of the J z 2 readout is restricted to an o ( N ) occupation imbalance. We show that a method of moments readout of two quadratic spin observables J z 2 and J + 2 + J − 2 is globally optimal for Dicke state probes; i.e., the error saturates the QFI for all θ . In the lossy setting, we derive the time-inhomogeneous Markov process describing the effect of particle loss on TF states, showing that the method of moments readout of four at-most-quadratic spin observables is sufficient for globally optimal estimation of θ when two or more particles are lost. The analysis culminates in a numerical calculation of the QFI matrix for distributed MZ interferometry on the four-mode state | N 4 , N 4 , N 4 , N 4 〉 and its lossy counterparts, showing that an advantage for the estimation of any linear function of the local MZ phases θ 1 and θ 2 (compared to independent probing of the MZ phases by two copies of | N 4 , N 4 〉 ) appears when more than one particle is lost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗