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.

83 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Optimization of rotor performance in hover and axial flight using a free wake analysis

Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this effort was to demonstrate that a numerical performance optimization algorithm could be coupled to an existing free wake hover code. This code, dubbed EHPIC (Evaluation of Hover Performacne using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and by deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality constraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis. A variety of sample problems were undertaken to demonstrate the success of this approach in reducing the power required at a specified thrust for several representative rotor configurations in hover and axial flight.

Quackenbush, T. R.↗
DOE OSTI2026

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↗
NASA NTRS1991

Time-domain finite elements in optimal control with application to launch-vehicle guidance

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Bless, Robert R.↗
DOE OSTI2024

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↗
DOE OSTI2023

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↗
DOE OSTI2021

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↗
DOE OSTI2020

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↗
DOE OSTI2023

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↗
DOE OSTI2024

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↗
DOE OSTI2025

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↗
NASA NTRS2014

Elastic Model Transitions: A Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes a hybrid approach for determining physical displacements by augmenting the original quadratically constrained least squares (LSQI) algorithm with Direct Shape Mapping (DSM) and modifying the energy constraints. The approach presented is applicable to simulation of the elastic behavior of launch vehicles and other structures that utilize discrete LTI finite element model (FEM) derived mode sets (eigenvalues and eigenvectors) that are propagated throughout time. The time invariant nature of the elastic data presents a problem of how to properly transition elastic states from the prior to the new model while preserving motion across the transition and ensuring there is no truncation or excitation of the system. A previous approach utilizes a LSQI algorithm with an energy constraint to effect smooth transitions between eigenvector sets with no requirement that the models be of similar dimension or have any correlation. This approach assumes energy is conserved across the transition, which results in significant non-physical transients due to changing quasi-steady state energy between mode sets, a phenomenon seen when utilizing a truncated mode set. The computational burden of simulating a full mode set is significant so a subset of modes is often selected to reduce run time. As a result of this truncation, energy between mode sets may not be constant and solutions across transitions could produce non-physical transients. In an effort to abate these transients an improved methodology was developed based on the aforementioned approach, but this new approach can handle significant changes in energy across mode set transitions. It is proposed that physical velocities due to elastic behavior be solved for using the LSQI algorithm, but solve for displacements using a two-step process that independently addresses the quasi-steady-state and non-steady-state contributions to the elastic displacement. For structures subject to large external forces, such as thrust or atmospheric drag, it is imperative to capture these forces when solving for elastic displacement. To simplify the mathematical formulation, assumptions are made regarding mass matrix normalization, constant external forcing, and constant viscous damping. These simplifications allow for direct solutions to the quasi-steady-state displacements through a process titled Direct Shape Mapping. DSM solves for the displacements using the eigenvalues of the elastic modes and the external forcing and returns a set of elastic displacements dictated by the eigenvectors of the post-transition mode set. For the non-steady-state contributions to displacement we formulate a LSQI problem that is constrained by energy of the non-steady state terms. The contributions from the quasi-steady-state and non-steady state solutions are then combined to obtain the physical displacements associated with the new set of eigenvectors. Results for the LSQI-DSM approach show significant reduction/complete removal of transients across mode set transitions while maintaining elastic motion from the prior state. For time propagation applications employing discrete elastic models that need to be transitioned in time and where running with full a full mode set is not feasible, the method developed offers a practical solution to simulating vehicle elasticity.

Hannan, Mike R.↗