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 127 records · Page 7

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A universal variational quantum eigensolver for non-Hermitian systems

Abstract Many quantum algorithms are developed to evaluate eigenvalues for Hermitian matrices. However, few practical approach exists for the eigenanalysis of non-Hermintian ones, such as arising from modern power systems. The main difficulty lies in the fact that, as the eigenvector matrix of a general matrix can be non-unitary, solving a general eigenvalue problem is inherently incompatible with existing unitary-gate-based quantum methods. To fill this gap, this paper introduces a Variational Quantum Universal Eigensolver (VQUE), which is deployable on noisy intermediate scale quantum computers. Our new contributions include: (1) The first universal variational quantum algorithm capable of evaluating the eigenvalues of non-Hermitian matrices—Inspired by Schur’s triangularization theory, VQUE unitarizes the eigenvalue problem to a procedure of searching unitary transformation matrices via quantum devices; (2) A Quantum Process Snapshot technique is devised to make VQUE maintain the potential quantum advantage inherited from the original variational quantum eigensolver—With additional $$O(log_{2}{N})$$ O ( l o g 2 N ) quantum gates, this method efficiently identifies whether a unitary operator is triangular with respect to a given basis; (3) Successful deployment and validation of VQUE on a real noisy quantum computer, which demonstrates the algorithm’s feasibility. We also undertake a comprehensive parametric study to validate VQUE’s scalability, generality, and performance in realistic applications.

97 MATHEMATICS AND COMPUTING↗

PCG method with Strang’s circulant preconditioner for Hermitian positive definite linear system in Riesz space fractional advection–dispersion equations

In this paper, preconditioned conjugate gradient (PCG) method with Strang’s circulant preconditioner is investigated to solve the Hermitian positive definite linear systems, which is result from the Crank–Nicolson (C-N) finite difference scheme with the weighted and shifted Grünwald difference (WSGD) operators to discretize the Riesz space fractional advection–dispersion equation (RSFADE). We show that the spectrum of the preconditioned matrix is clustered around 1, and the singular values of the preconditioned matrix are uniformly bounded away from zero under a certain condition, respectively; hence the PCG method, when applied to solving the preconditioned system, converges superlinearly. Moreover, the complexity in each iteration of the PCG method is O(Nlog N) via using the fast Fourier transforms, where N is the matrix size. Numerical experiments are included to demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Universality for 1d Random Band Matrices: Sigma-Model Approximation

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233–1260, 2016; Commun Math Phys 351:1009–1044, 2017). We consider random Hermitian block band matrices consisting of W×W random Gaussian blocks (parametrized by j,k∈Λ=[1,n]{sup d}∩ℤ{sup d}) with a fixed entry’s variance J{sub jk}=δ{sub j,k}W{sup −1}+βΔ{sub j,k}W{sup −2}, β>0 in each block. Taking the limit W→∞ with fixed n and β, we derive the sigma-model approximation of the second correlation function similar to Efetov’s one. Then, considering the limit β,n→∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β≫n, is determined by the classical Wigner–Dyson statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quasibound states in two- and three-dimensional open quantum systems

We derive expressions for the scattering matrix and the Wigner-Smith delay time, applicable to open systems in two and three spatial dimensions, in terms of a non-Hermitian effective Hamiltonian whose complex eigenvalues give the quasibound state energies of the system. These results are illustrated on an exactly solvable two-dimensional scattering problem and are found to be in excellent agreement with the exact solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

R-matrix approach with proper boundary conditions for dissipative and nondissipative collision processes

We develop an R-matrix approach to treating collision processes which explicitly takes into account, by means of a simple energy-dependent analytic function, the out-of-phase oscillations of the incident and scattered standing waves in the interior region. Thereby we avoid the use of the Bloch operator. In place of the Bloch operator the incident wave provides the source term in an inhomogeneous equation for the scattered wave. We take those subchannels not treated exactly into account via the optical potential, which is generally non-Hermitian due to dissipation at the boundary. The optical potential is constructed on a real analytic basis using a resolvent that satisfies outgoing-wave boundary conditions. The use of an analytic basis together with the direct determination of the K matrix, rather than the R matrix, at the boundary (this is done by matching the interior wave function to the nearly exact analytic solution beyond the boundary) makes the method particularly well suited to the treatment of ultracold collisions. We have tested our method by applying it to one-photon single-ionization of (He1s{sup 2}) accompanied by excitation to He{sup +}(2s) or He{sup +}(2p) for photon energies above the complete breakup threshold, where the optical potential is non-Hermitian. Excellent agreement with experiment is obtained for the cross sections for photoionization to both He{sup +} (n=1) and to He{sup +} (n=2). The 2s-to-2p branching ratio is strongly influenced by both the optical potential and, at photon energies less than a few tens of eV above the breakup threshold, the nonadiabatic dipole mixing of the 2s and 2p states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Smallest matrix black hole model in the classical limit

We study the smallest non-trivial matrix model that can be considered to be a (toy) model of a black hole. The model consists of a pair of 2×2 traceless hermitian matrices with a commutator squared potential and an SU(2) gauge symmetry, plus an SO(2) rotation symmetry. We show that using the symmetries of the system, all but two of the variables can be separated. The two variables that remain display chaos and a transition from chaos to integrability when a parameter related to an SO(2) angular momentum is tuned to a critical value. Finally, we compute the Lyapunov exponents near this transition and study the critical exponent of the Lyapunov exponents near the critical point. We compare this transition to extremal rotating black holes.

79 ASTRONOMY AND ASTROPHYSICS↗

Factorization Of Positive Definite, Banded Hermitian Matrices

Report discusses application of Cholesky factorization algorithm to positive definite, banded Hermitian matrices. Begins by extending Cholesky factorization algorithm to cover uniformly-partitioned, banded, positive definite matrices of rank n that is real symmetric or Hermitian. Then two stratagems given for use of algorithm in concurrent-processing system in which N less than it has to be to enable factorization of matrix in as few serial steps as possible and where uniformly high efficiency expected from all processing elements. One of major purposes of this and related studies to maximize speedup and efficiency in system of concurrent-data-processing elements.

Salama, Moktar A.↗

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗

Spectral Filtering Induced by Non-Hermitian Evolution with Balanced Gain and Loss: Enhancing Quantum Chaos

Here, the dynamical signatures of quantum chaos in an isolated system are captured by the spectral form factor, which exhibits as a function of time a dip, a ramp, and a plateau, with the ramp being governed by the correlations in the level spacing distribution. While decoherence generally suppresses these dynamical signatures, the nonlinear non-Hermitian evolution with balanced gain and loss (BGL) in an energy-dephasing scenario can enhance manifestations of quantum chaos. In the Sachdev-Ye-Kitaev model and random matrix Hamiltonians, BGL increases the span of the ramp, lowering the dip as well as the value of the plateau, providing an experimentally realizable physical mechanism for spectral filtering. The chaos enhancement due to BGL is optimal over a family of filter functions that can be engineered with fluctuating Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solvable model of quantum phase transitions and the symbolic-manipulation-based study of its multiply degenerate exceptional points and of their unfolding

It is known that the practical use of non-Hermitian (i.e., typically, PT-symmetric) phenomenological quantum Hamiltonians H≠H{sup †} requires an efficient reconstruction of an ad hoc Hilbert-space metric Θ=Θ(H) which would render the time-evolution unitary. Once one considers just the N-dimensional matrix toy models H=H{sup (N)}, the matrix elements of Θ(H) may be defined via a coupled set of N{sup 2} polynomial equations. Their solution is a typical task for computer-assisted symbolic manipulations. The feasibility of such a model-completion construction is illustrated here via a discrete square well model H=p{sup 2}+V endowed with a k-parametric close-to-the-boundary interaction V. The model is shown to possess (possibly, multiply degenerate) exceptional points marking the phase transitions which are attributable, due to the exact solvability of the model at any N<∞, to the loss of the regularity of the metric. In the parameter-dependence of the energy spectrum near these singularities one encounters a broad variety of alternative, topologically non-equivalent scenarios. -- Highlights: •New elementary non-Hermitian quantum Hamiltonians with real spectra proposed. •Exceptional points found and studied. •Non-equivalent stability-loss patterns of phase transition identified. •Hermitization matrices of metrics Θ constructed via symbolic manipulations and extrapolations at all N and k.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Skew-Symmetric adjacency matrices for clustering directed graphs

Graph clustering methods often critically rely on the symmetry of graph matrices. Developing analogous methods for digraphs often proves more challenging, because digraph matrices are typically asymmetric and not orthogonally diagonalizable. However, researchers have recently proposed several complex-valued Hermitian digraph matrices. In particular, one such representation has been utilized as an input to an algorithm for finding imbalanced cuts. In this work, we establish an algebraic relationship between this matrix and an associated real-valued matrix. We show using this real-valued matrix for imbalanced cut-finding algorithms is not only sufficient but advantageous. Our algorithm uses less memory and asymptotically less computation while provably preserving solution quality. We also show our method can be easily implemented using standing computational building blocks, possesses better numerical properties, and loans itself to a natural interpretation via an objective function relaxation argument. We empirically demonstrate these advantages on real world data sets and show how our algorithm can uncover meaningful cluster structure.

Hayashi, Koby↗

On polynomial preconditioning for indefinite Hermitian matrices

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Freund, Roland W.↗

Quasi-degenerate perturbation theory using matrix product states

In this work, we generalize the recently proposed matrix product state perturbation theory (MPSPT) for calculating energies of excited states using quasi-degenerate (QD) perturbation theory. Our formulation uses the Kirtman-Certain-Hirschfelder canonical Van Vleck perturbation theory, which gives Hermitian effective Hamiltonians at each order, and also allows one to make use of Wigner’s 2n + 1 rule. Further, our formulation satisfies Granovsky’s requirement of model space invariance which is important for obtaining smooth potential energy curves. Thus, when we use MPSPT with the Dyall Hamiltonian, we obtain a model space invariant version of quasi-degenerate n-electron valence state perturbation theory (NEVPT), a property that the usual formulation of QD-NEVPT2 based on a multipartitioning technique lacked. We use our method on the benchmark problems of bond breaking of LiF which shows ionic to covalent curve crossing and the twist around the double bond of ethylene where significant valence-Rydberg mixing occurs in the excited states. In accordance with our previous work, we find that multi-reference linearized coupled cluster theory is more accurate than other multi-reference theories of similar cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Lattice QCD study of π Σ − K ¯ N scattering and the Λ ( 1405 ) resonance

A lattice QCD computation of the coupled channel π Σ – K ¯ N scattering amplitudes in the Λ ( 1405 ) region is detailed. Results are obtained using a single ensemble of gauge field configurations with N f = 2 + 1 dynamical quark flavors and m π ≈ 200 MeV and m K ≈ 487 MeV . Hermitian correlation matrices using both single baryon and meson-baryon interpolating operators for a variety of different total momenta and irreducible representations are used. Several parametrizations of the two-channel scattering K -matrix are utilized to obtain the scattering amplitudes from the finite-volume spectrum. The amplitudes, continued to the complex energy plane, exhibit a virtual bound state below the π Σ threshold and a resonance pole just below the K ¯ N threshold. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗