Computation of the Inverse of Square Matrix [EM Programmer's Notebook]

2021 ◽  
Vol 63 (4) ◽  
pp. 128-130
Author(s):  
Feng Cheng Chang
Keyword(s):  
Square Matrix

Stochastic local operations and classical communication invariants via square matrix

Laser Physics ◽  
2019 ◽  
Vol 29 (2) ◽  
pp. 025203 ◽  
Author(s):  
Xinwei Zha ◽  
Irfan Ahmed ◽  
Da Zhang ◽  
Wen Feng ◽  
Yanpeng Zhang
Keyword(s):  
Classical Communication ◽  
Square Matrix

scholarly journals Algebraic conditions and the sparsity of spectrally arbitrary patterns

2021 ◽  
Vol 9 (1) ◽  
pp. 257-274
Author(s):  
Louis Deaett ◽  
Colin Garnett
Keyword(s):  
Major Goal ◽  
Algebraic Condition ◽  
Open Question ◽  
Algebraic Tool ◽  
General Method ◽  
Square Matrix ◽  
Spectrally Arbitrary

Abstract Given a square matrix A, replacing each of its nonzero entries with the symbol * gives its zero-nonzero pattern. Such a pattern is said to be spectrally arbitrary when it carries essentially no information about the eigenvalues of A. A longstanding open question concerns the smallest possible number of nonzero entries in an n × n spectrally arbitrary pattern. The Generalized 2n Conjecture states that, for a pattern that meets an appropriate irreducibility condition, this number is 2n. An example of Shitov shows that this irreducibility is essential; following his technique, we construct a smaller such example. We then develop an appropriate algebraic condition and apply it computationally to show that, for n ≤ 7, the conjecture does hold for ℝ, and that there are essentially only two possible counterexamples over ℂ. Examining these two patterns, we highlight the problem of determining whether or not either is in fact spectrally arbitrary over ℂ. A general method for making this determination for a pattern remains a major goal; we introduce an algebraic tool that may be helpful.

scholarly journals A Schur-Cohn theorem for matrix polynomials

1990 ◽  
Vol 33 (3) ◽  
pp. 337-366 ◽  
Author(s):  
Harry Dym ◽  
Nicholas Young
Keyword(s):  
Unit Circle ◽  
Matrix Polynomial ◽  
Hermitian Matrix ◽  
Krein Space ◽  
Gram Matrix ◽  
Natural Basis ◽  
Test Matrix ◽  
Matrix Polynomials ◽  
Rational Vector ◽  
Square Matrix

Let N(λ) be a square matrix polynomial, and suppose det N is a polynomial of degree d. Subject to a certain non-singularity condition we construct a d by d Hermitian matrix whose signature determines the numbers of zeros of N inside and outside the unit circle. The result generalises a well known theorem of Schur and Cohn for scalar polynomials. The Hermitian “test matrix” is obtained as the inverse of the Gram matrix of a natural basis in a certain Krein space of rational vector functions associated with N. More complete results in a somewhat different formulation have been obtained by Lerer and Tismenetsky by other methods.

A trace bound for a general square matrix product

2000 ◽  
Vol 45 (8) ◽  
pp. 1563-1569 ◽  
Author(s):  
Wei Xing ◽  
Qingling Zhang ◽  
Qiyi Wang
Keyword(s):  
Matrix Product ◽  
Square Matrix

scholarly journals On circulant codes with prescribed distances

1977 ◽  
Vol 16 (3) ◽  
pp. 361-369
Author(s):  
M. Deza ◽  
Peter Eades
Keyword(s):  
Sufficient Conditions ◽  
Difference Sets ◽  
Necessary And Sufficient Conditions ◽  
Necessary Condition ◽  
Weighing Matrices ◽  
Cyclic Difference Sets ◽  
The Matrix ◽  
Circulant Codes ◽  
Necessary And Sufficient ◽  
Square Matrix

Necessary and sufficient conditions are given for a square matrix to te the matrix of distances of a circulant code. These conditions are used to obtain some inequalities for cyclic difference sets, and a necessary condition for the existence of circulant weighing matrices.

Remark on algorithm 361 [G6]: permanent function of a square matrix I and II

1970 ◽  
Vol 13 (6) ◽  
pp. 376
Author(s):  
Bruce Shriver ◽  
P. J. Eberlein ◽  
R. D. Dixon
Keyword(s):  
Permanent Function ◽  
Square Matrix

scholarly journals Computation of Green’s Function of the Bounded Solutions Problem

2018 ◽  
Vol 18 (4) ◽  
pp. 673-685 ◽  
Author(s):  
Vitalii G. Kurbatov ◽  
Irina V. Kurbatova
Keyword(s):  
Green’S Function ◽  
Green's Function ◽  
Numerical Experiments ◽  
Imaginary Axis ◽  
Approximate Calculation ◽  
Special Function ◽  
Bounded Solution ◽  
Free Term ◽  
Bounded Solutions ◽  
Square Matrix

AbstractIt is well known that the equation {x^{\prime}(t)=Ax(t)+f(t)}, where A is a square matrix, has a unique bounded solution x for any bounded continuous free term f, provided the coefficient A has no eigenvalues on the imaginary axis. This solution can be represented in the formx(t)=\int_{-\infty}^{\infty}\mathcal{G}(t-s)f(s)\,ds.The kernel {\mathcal{G}} is called Green’s function. In this paper, for approximate calculation of {\mathcal{G}}, the Newton interpolating polynomial of a special function {g_{t}} is used. An estimate of the sensitivity of the problem is given. The results of numerical experiments are presented.

Sign in / Sign up

Export Citation Format

Share Document