Search NASA⌕ Search

SEARCH · Search NASA

Results for “HERMITIAN MATRIX”

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 145 records · Page 8

Complex matrix model duality

The same complex matrix model calculates both tachyon scattering for the c=1 noncritical string at the self-dual radius and certain correlation functions of operators which preserve half the supersymmetry in N=4 super-Yang-Mills theory. It is dual to another complex matrix model where the couplings of the first model are encoded in the Kontsevich-like variables of the second. The duality between the theories is mirrored by the duality of their Feynman diagrams. Analogously to the Hermitian Kontsevich-Penner model, the correlation functions of the second model can be written as sums over discrete points in subspaces of the moduli space of punctured Riemann surfaces.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Survey of methods for calculating sensitivity of general eigenproblems

A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.

Murthy, Durbha V.↗

Generalized Bose–Hubbard Hamiltonians exhibiting a complete non-Hermitian degeneracy

Highlights: • Hot topic: physics with non-Hermitian Hamiltonians. • Computer algebra used to construct new, next-to-BH models. • Degeneracy verification via variable-precision arithmetics. • Unfolding patterns at N>5 (recent problem solved). - Abstract: The method of construction of the tridiagonal and symmetric complex-matrix Hamiltonians H{sup (N)}(z) exhibiting an exceptional-point (EP) degeneracy of the Nth (i.e., maximal) order at a preselected parameter z=z{sup (EPN)}=1 is proposed and tested. In general, the implementation of the method requires the use of computer-assisted symbolic manipulations, especially at the larger matrix dimensions N. The well known PT−symmetric N-by-N-matrix Bose–Hubbard Hamiltonians as well as their recent N≤5 non-Bose–Hubbard alternatives are obtained as special solutions. Several other N≥6 non-Bose–Hubbard models H{sup (N)}(z) exhibiting the maximal EPN degeneracy are also constructed and analyzed in detail. In particular, their z−dependent, real or complex spectra of energies are displayed and discussed near as well as far from z{sup (EPN)}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fermion masses and mixings in a {mu}-{tau} symmetric SO(10)

The {mu}-{tau} symmetry imposed on the neutrino mass matrix in the flavor basis is known to be quite predictive. We integrate this very specific neutrino symmetry into a more general framework based on the supersymmetric SO(10) grand unified theory. As in several other models, the fermion mass spectrum is determined by Hermitian mass matrices resulting from the renormalizable Yukawa couplings of the 16-plet of fermions with the Higgs fields transforming as 10, 126, and 120 representations of the SO(10) group. The {mu}-{tau} symmetry is spontaneously broken through the 120-plet. Consequences of this scheme are considered for fermion masses using both a type-I and a type-II seesaw mechanism. This scenario is shown to lead to a generalized CP invariance of the mass matrices and vanishing CP violating phases if the Yukawa couplings are invariant under the {mu}-{tau} symmetry. Small explicit breaking of the {mu}-{tau} symmetry is then shown to provide a very good understanding of all of the fermion masses and mixing. Detailed fits to the fermion spectrum are presented in several scenarios. One obtains a very good fit to all observables in the context of the type-I seesaw mechanism, but the type-II seesaw model also provides a good description except for the overall scale of the neutrino masses. Three major predictions on the leptonic mixing parameters in the type-I seesaw case are (i) the atmospheric mixing angle {theta}{sub 23}{sup l} close to maximal, (ii) {theta}{sub 13}{sup l} close to the present upper bound, and (iii) a negative but very small Dirac CP violating phase in the neutrino oscillations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗

Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT

We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires half of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exploiting a Shortcoming of Coupled-Cluster Theory: The Extent of Non-Hermiticity as a Diagnostic Indicator of Computational Accuracy

The fundamental non-Hermitian nature of the forms of the coupled-cluster (CC) theory widely used in quantum chemistry has usually been viewed as a negative, but the present paper shows how this can be used to an advantage. Specifically, the non-symmetric nature of the reduced one-particle density matrix (in the molecular orbital basis) is advocated as a diagnostic indicator of computational quality. In the limit of the full coupled-cluster theory [which is equivalent to full configuration interaction (FCI)], the electronic wave function and correlation energy are exact within a given one-particle basis set, and the symmetric character of the exact density matrix is recovered. The extent of the density matrix asymmetry is shown to provide a measure of “how difficult the problem is” (like the well-known T 1 diagnostic), but its variation with the level of theory also gives information about “how well this particular method works”, irrespective of the difficulty of the problem at hand. The proposed diagnostic is described and applied to a select group of small molecules, and an example of its overall utility for the practicing quantum chemist is illustrated through its application to the beryllium dimer (Be 2 ). Future application of this idea to excited states, open-shell systems, and symmetry-breaking problems and an extension of the method to the two-particle density are then proposed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Least-squares solutions of generalized inverse eigenvalue problem over Hermitian–Hamiltonian matrices with a submatrix constraint

In this paper, a gradient-based iterative algorithm is proposed for finding the least-squares solutions of the following constrained generalized inverse eigenvalue problem: given X∈C{sup n×m}, Λ=diag(λ{sub 1},λ{sub 2},…,λ{sub m})∈C{sup m×m}, find A{sup ∗},B{sup ∗}∈C{sup n×n}, such that ∥AX−BXΛ∥ is minimized, where A{sup ∗},B{sup ∗} are Hermitian–Hamiltonian except for a special submatrix. For any initial constrained matrices, a solution pair (A{sup ∗},B{sup ∗}) can be obtained in finite iteration steps by this iterative algorithm in the absence of roundoff errors. The least-norm solution can be obtained by choosing a special kind of initial matrix pencil. In addition, the unique optimal approximation solution to a given matrix pencil in the solution set of the above problem can also be obtained. A numerical example is given to show the efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

CP violation in hierarchical Yukawa models

Because 4-dimensional CP is a good symmetry of many higher-dimensional theories, this suggests the possible existence of an universal CP-violating phase originating from the process of compactification. Such a phase, if it existed, would not be easy to uncover since the phases in Yukawa matrices are not simply related to the observed Cabibbo-Kobayashi-Maskawa phase {delta}. Hierarchical Yukawa models, of the type arising in F-theory GUT models provide an interesting exception. Recently, Heckman and Vafa studied a particular F-theory GUT model with hierarchical Yukawa matrices with complex phases of O(1) and showed, by examining the Jarlskog invariant, that this model leads to sin{delta}{approx}O(1). A more detailed examination of the model, although confirming their results, is seen to be also compatible with having a phase {delta}{sub o}={pi}/3 imprinted on the Hermitian Yukawa matrices, leading to sin{delta}{approx_equal}sin{delta}{sub o}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Deflation as a method of variance reduction for estimating the trace of a matrix inverse

Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 150 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Furthermore, using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.

97 MATHEMATICS AND COMPUTING↗

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

42 ENGINEERING↗

Entanglement spectrum and symmetries in non-Hermitian fermionic non-interacting models

We study the properties of the entanglement spectrum in gapped non-interacting non-Hermitian systems, and its relation to the topological properties of the system Hamiltonian. Two different families of entanglement Hamiltonians can be defined in non-Hermitian systems, depending on whether we consider only right (or equivalently only left) eigenstates or a combination of both left and right eigenstates. We show that their entanglement spectra can still be computed efficiently, as in the Hermitian limit. We discuss how symmetries of the Hamiltonian map into symmetries of the entanglement spectrum depending on the choice of the many-body state. Through several examples in one and two dimensions, we show that the biorthogonal entanglement Hamiltonian directly inherits the topological properties of the Hamiltonian for line gapped phases, with characteristic singular and energy zero modes. The right (left) density matrix carries distinct information on the topological properties of the many-body right (left) eigenstates themselves. In purely point gapped phases, when the energy bands are not separable, the relation between the entanglement Hamiltonian and the system Hamiltonian breaks down.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-Hermitian wave packet approximation for coupled two-level systems in weak and intense fields

We introduce a non-Hermitian Schrödinger-type approximation of optical Bloch equations for two-level systems. This approximation provides a complete and accurate description of the coherence and decoherence dynamics in both weak and strong laser fields at the cost of losing accuracy in the description of populations. In this approach, it is sufficient to propagate the wave function of the quantum system instead of the density matrix, providing that relaxation and dephasing are taken into account via automatically adjusted time-dependent gain and decay rates. The developed formalism is applied to the problem of scattering and absorption of electromagnetic radiation by a thin layer comprised of interacting two-level emitters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Studies in Quantum Field Theory and Astroparticle Physics

OVERVIEW OF THE RESEARCH PLAN: Task 1: Theoretical Research in High Energy Physics Prof. Alford investigated the phases and properties of matter at the highest densities achieved in nature. His main focus was on quark matter and its manifestations and signatures in neutron stars. His work is directly relevant to both the Cosmic and the Energy Frontiers. Prof. Bender developed PT-symmetric quantum theory, which is a complex generalization of conventional Hermitian quantum theory. During the grant period, he constructed and analyzed new PT-symmetric field theoretic models that exhibit symmetry breaking. He also worked on other fundamental problems in theoretical physics. His work falls under the Intensity Frontier classification. Prof. Bernard continued to work on lattice gauge theory and associated issues in chiral perturbation theory. His research focused primarily on the calculation of weak matrix elements relevant to tests of the standard model and the search for new physics at the Intensity Frontier. This work included both direct numerical simulations in QCD and the development of theoretical tools to analyze the simulations and facilitate the comparison with Intensity-Frontier experiments. Prof. Ferrer continued working on dark matter and other topics in theoretical particle cosmology. His research focused on weakly interacting massive particles relevant to both the Cosmic and the Energy Frontiers, and on dark photons relevant to the Intensity Frontier. Prof. Ogilvie continued his work on lattice gauge theory and the phase structure of gauge theories. His research on the properties of confined, conformal and Higgs phases is relevant to the Energy Frontier, as well as addressing fundamental issues of broad theoretical interest. Task 2: Experimental Research at the Cosmic Frontier in High Energy Physics. Over the three year grant period, Profs. Buckley and Krawczynski continued research under the Cosmic Frontier. Prof. Buckley's group worked on two Cosmic Frontier projects (VERITAS and LZ), and conducted research in dark matter science and other areas of particle astrophysics. Buckley’s group worked on the conceptual design of the next generation ground-based gamma-ray experiment (CTA) and on the development of camera electronics for a 2-mirror SCT prototype telescope. Buckley's group also continued work on GaN photodetector detector development as part of the Instrumentation Frontier (Detector R&D) including work with the LAPPD group on the development robust amorphous photocathodes for very large area MCP-based photodetectors and ongoing development of deep UV photosensors for liquid Ar and Xenon Direct Dark matter detection. Prof. Krawczynski's group worked on two Cosmic Frontier topics: astrophysical tests of Lorentz Invariance and CPT symmetries at the Planck energy scale with the VERITAS gamma-ray experiment, and the search for dark matter particles with indirect detection experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗