Search results for " MATRIX"

Trace Identities on Diagonal Matrix Algebras

2020

Let Dn be the algebra of n × n diagonal matrices. On such an algebra it is possible to define very many trace functions. The purpose of this paper is to present several results concerning trace identities satisfied by this kind of algebras.

Eigenvalues of non-hermitian matrices: a dynamical and an iterative approach. Application to a truncated Swanson model

2020

We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix (Formula presented.). Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to physics and to pseudo-Hermitian quantum mechanics in particular. We first consider a dynamical approach, based on a pair of ordinary differential equations defined in terms of the matrix (Formula presented.) and of its adjoint (Formula presented.). Then, we consider an extension of the so-called power method, for which we prove a fixed point theorem for (Formula presented.) useful in the determination of the eigenvalues of (Formula presented…

On the representation of integers by indefinite binary Hermitian forms

2011

Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational integers with absolute value at most s by f, as s tends to infinity.

THE BISHOP-PHELPS-BOLLOBAS PROPERTY FOR HERMITIAN FORMS ON HILBERT SPACES

2013

Unicity of biproportion

1994

International audience; The biproportion of S on margins of M is called the intern composition law, K: (S,M) -> X = K(S,M) / X = A S B. A and B are diagonal matrices, algorithmically computed, providing the respect of margins of M. Biproportion is an empirical concept. In this paper, the author shows that any algorithm used to compute a biproportion leads to the me result. Then the concept is unique and no longer empirical. Some special properties are also indicated.

The M4 transitions of isomeric states

2015

Tässä pro gradu -tutkielmassa tutkitaan isomeeristen tilojen magneettisten M4-gammasiirtymien redusoituja matriisielementtejä. Tutkittavat siirtymät ovat venyneitä M4-siirtymiä kaksoisbeetahajoamisten massa-alueilla A=85-115 ja A=135-143. Tutkielman tarkoituksena on verrata kokeellisia ydinmatriisielementtejä kvasihiukkasmatriisielementteihin ja MQPM-teorian avulla laskettuihin matriisielementteihin. Kokeelliset matriisielementi lasketaan kokeellisesti määritettyjen arvojen avulla ja kvasihiukkas- sekä MQPM-matriisielementit määritetään tietokoneohjelmien avulla. Kokeellisten ja kvasihiukkasmatriisielementtien välinen suhde osoittautui olevan noin 0,29 ja kokeellisten ja MQPM-matriisielemen…

On the accurate determination of nonisolated solutions of nonlinear equations

1981

A simple but efficient method to obtain accurate solutions of a system of nonlinear equations with a singular Jacobian at the solution is presented. This is achieved by enlarging the system to a higher dimensional one whose solution in question is isolated. Thus it can be computed e. g. by Newton's method, which is locally at least quadratically convergent and selfcorrecting, so that high accuracy is attainable.

Optimizing auditory images and distance metrics for self‐organizing timbre maps*

1996

Abstract The effect of using different auditory images and distance metrics on the final configuration of a self‐organized timbre map is examined by comparing distance matrices, obtained from simulations, with a similarity rating matrix, obtained using the same set of stimuli as in the simulations. Gradient images, which are intended to represent idealizations of physiological gradient maps in the auditory pathway, are constructed. The optimal auditory image and distance metric, with respect to the similarity rating data, are searched using the gradient method.

The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems

2019

We present a compendium of numerical simulation techniques, based on tensor network methods, aiming to address problems of many-body quantum mechanics on a classical computer. The core setting of this anthology are lattice problems in low spatial dimension at finite size, a physical scenario where tensor network methods, both Density Matrix Renormalization Group and beyond, have long proven to be winning strategies. Here we explore in detail the numerical frameworks and methods employed to deal with low-dimension physical setups, from a computational physics perspective. We focus on symmetries and closed-system simulations in arbitrary boundary conditions, while discussing the numerical dat…

Reconstruction of Hamiltonians from given time evolutions

2010

In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state of the system. Our approach exploits the equivalence between an action of the group of evolution operators over the state space and an adjoint action of the unitary group over Hermitian matrices. The method is illustrated by two examples involving a pure and a mixed state.