negative eigenvalues
Recently Published Documents


TOTAL DOCUMENTS

111
(FIVE YEARS 19)

H-INDEX

10
(FIVE YEARS 1)

Author(s):  
Karl Svozil

The Householder transformation, allowing a rewrite of probabilities into expectations of dichotomic observables, is generalized in terms of its spectral decomposition. Dichotomy is modulated by allowing more than one negative eigenvalues, or by abandoning it altogether, yielding generalized operator valued arguments for contextuality. We also discuss a form of state-dependent contextuality by variation of the functional relations of the operators; in particular, by additivity.


Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1650
Author(s):  
Francesco Silvio Gentile ◽  
Rosita Diana ◽  
Barbara Panunzi ◽  
Ugo Caruso ◽  
Alexander Platonenko ◽  
...  

The phase transitions between paraelectric (PE) and ferroelectric (FE) isomorph phases of LiNbO3 have been investigated quantum mechanically by using a Gaussian-type basis set, the B3LYP hybrid functional and the CRYSTAL17 code. The structural, electronic and vibrational properties of the two phases are analyzed. The vibrational frequencies evaluated at the Γ point indicate that the paraelectric phase is unstable, with a complex saddle point with four negative eigenvalues. The energy scan of the A2u mode at −215 cm−1 (i215) shows a dumbbell potential with two symmetric minima. The isotopic substitution, performed on the Li and Nb atoms, allows interpretation of the nontrivial mechanism of the phase transition. The ferroelectric phase is more stable than the paraelectric one by 0.32 eV.


2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Hugh Osborn ◽  
Andreas Stergiou

Abstract The tensorial equations for non trivial fully interacting fixed points at lowest order in the ε expansion in 4 − ε and 3 − ε dimensions are analysed for N-component fields and corresponding multi-index couplings λ which are symmetric tensors with four or six indices. Both analytic and numerical methods are used. For N = 5, 6, 7 in the four-index case large numbers of irrational fixed points are found numerically where ‖λ‖2 is close to the bound found by Rychkov and Stergiou [1]. No solutions, other than those already known, are found which saturate the bound. These examples in general do not have unique quadratic invariants in the fields. For N ⩾ 6 the stability matrix in the full space of couplings always has negative eigenvalues. In the six index case the numerical search generates a very large number of solutions for N = 5.


2021 ◽  
Vol 13 (1) ◽  
pp. 22-38
Author(s):  
Yu.D. Golovaty

The threshold behaviour of negative eigenvalues for Schr\"{o}dinger operators of the type \[ H_\lambda=-\frac{d^2}{dx^2}+U+ \lambda\alpha_\lambda V(\alpha_\lambda \cdot) \] is considered. The potentials $U$ and $V$ are real-valued bounded functions of compact support, $\lambda$ is a positive parameter, and positive sequence $\alpha_\lambda$ has a finite or infinite limit as $\lambda\to 0$. Under certain conditions on the potentials there exists a bound state of $H_\lambda$ which is absorbed at the bottom of the continuous spectrum. For several cases of the limiting behaviour of sequence $\alpha_\lambda$, asymptotic formulas for the bound states are proved and the first order terms are computed explicitly.


Author(s):  
Xiaoli Cen ◽  
Yong Xia

We consider the classical convex constrained nonconvex quadratic programming problem where the Hessian matrix of the objective to be minimized has r negative eigenvalues, denoted by (QPr). Based on a biconvex programming reformulation in a slightly higher dimension, we propose a novel branch-and-bound algorithm to solve (QP1) and show that it returns an [Formula: see text]-approximate solution of (QP1) in at most [Formula: see text] iterations. We further extend the new algorithm to solve the general (QPr) with r > 1. Computational comparison shows the efficiency of our proposed global optimization method for small r. Finally, we extend the explicit relaxation approach for (QP1) to (QPr) with r > 1. Summary of Contribution: Nonconvex quadratic program (QP) is a classical optimization problem in operations research. This paper aims at globally solving the QP where the Hessian matrix of the objective to be minimized has r negative eigenvalues. It is known to be nondeterministic polynomial-time hard even when r = 1. This paper presents a novel algorithm to globally solve the QP for r = 1 and then extends to general r. Numerical results demonstrate the superiority of the proposed algorithm in comparison with state-of-the-art algorithms/software for small r.


2021 ◽  
Vol 19 (1) ◽  
pp. 541-547
Author(s):  
Zaheer Ahmad ◽  
Zeeshan Saleem Mufti ◽  
Muhammad Faisal Nadeem ◽  
Hani Shaker ◽  
Hafiz Muhammad Afzal Siddiqui

Abstract Energy of a molecule plays an important role in physics, chemistry and biology. In mathematics, the concept of energy is used in graph theory to help other subjects such as chemistry and physics. In graph theory, nullity is the number of zeros extracted from the characteristic polynomials obtained from the adjacency matrix, and inertia represents the positive and negative eigenvalues of the adjacency matrix. Energy is the sum of the absolute eigenvalues of its adjacency matrix. In this study, the inertia, nullity and signature of the aforementioned structures have been discussed.


Sign in / Sign up

Export Citation Format

Share Document