scholarly journals Non-Unit Bidiagonal Matrices for Factorization of Vandermonde Matrices

2015 ◽  
Vol 12 ◽  
pp. 1-13
Author(s):  
R. Purushothaman Nair
Keyword(s):  
Vandermonde Matrix ◽  
Inverse Matrix ◽  
Identity Matrix ◽  
Vandermonde Matrices ◽  
The Matrix ◽  
Matrix Transforms ◽  
The Given ◽  
Zero Vector

A non-unit bidiagonal matrix and its inverse with simple structures are introduced. These matrices can be constructed easily using the entries of a given non-zero vector without any computations among the entries. The matrix transforms the given vector to a column of the identity matrix. The given vector can be computed back without any round off error using the inverse matrix. Since a Vandermonde matrix can also be constructed using given n quantities, it is established in this paper that Vandermonde matrices can be factorized in a simple way by applying these bidiagonal matrices. Also it is demonstrated that factors of Vandermonde and inverse Vandermonde matrices can be conveniently presented using the matrices introduced here.

The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials

2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’Aini Aris ◽  
Azlina Jumadi
Keyword(s):  
Convex Polytopes ◽  
Polynomial Systems ◽  
Matrix Formulation ◽  
Bivariate Polynomials ◽  
Homogeneous Coordinates ◽  
The Matrix ◽  
Projective Vector ◽  
Coordinate Rings ◽  
Resultant Matrix ◽  
The Given

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.

A general inverse matrix series relation and associated polynomials – II

2021 ◽  
Vol 71 (2) ◽  
pp. 301-316
Author(s):  
Reshma Sanjhira
Keyword(s):  
Matrix Polynomial ◽  
Combinatorial Identities ◽  
Inverse Matrix ◽  
Matrix Polynomials ◽  
Special Cases ◽  
Series Representations ◽  
The Matrix ◽  
Associated Polynomials ◽  
Matrix Pair ◽  
Matrix Series

Abstract We propose a matrix analogue of a general inverse series relation with an objective to introduce the generalized Humbert matrix polynomial, Wilson matrix polynomial, and the Rach matrix polynomial together with their inverse series representations. The matrix polynomials of Kiney, Pincherle, Gegenbauer, Hahn, Meixner-Pollaczek etc. occur as the special cases. It is also shown that the general inverse matrix pair provides the extension to several inverse pairs due to John Riordan [An Introduction to Combinatorial Identities, Wiley, 1968].

scholarly journals Integrated Recycling Process of Matrices of Organic Moulding Sands

2013 ◽  
Vol 58 (3) ◽  
pp. 809-812 ◽  
Author(s):  
R. Dańko
Keyword(s):  
Recycling Process ◽  
Conceptual Approach ◽  
Assessment Index ◽  
Experimental Stand ◽  
Synthetic Resins ◽  
The Matrix ◽  
Ignition Loss ◽  
On Line ◽  
The Given ◽  
Reclamation Process

Abstract The idea and experimental verification of assumptions of the integrated recycling process of matrices of uniform self-hardening moulding sands with synthetic resins, leading to obtaining moulding sands matrix of expected quality - is presented in the hereby paper. The basis of the presented process constitutes a combination of the method of forecasting averaged ignition losses of moulding sands after casting and defining the range of necessary matrix reclamation treatments in order to obtain its full recycling. Simultaneously, the empirically determined dependence of dusts amounts emitted during the reclamation process of the matrix from the given spent sand on the ignition loss values (which is the most proper assessment index of the obtained reclaimed material quality) was taken into account. The special experimental stand for investigations of the matrix recycling process was one of the elements of the conceptual approach and verification of its assumptions. The stand was equipped with the system of current on-line control of the purification degree of matrix grains from organic binder remains. The results of own investigations, allowing to combine ignition loss values of spent moulding sands after casting knocking out with amounts of dusts generated during the mechanical reclamation treatment of such sands, were utilized in the system.

scholarly journals Toeplitz Operators with Lagrangian Invariant Symbols Acting on the Poly-Fock Space of ℂ n

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jorge Luis Arroyo Neri ◽  
Armando Sánchez-Nungaray ◽  
Mauricio Hernández Marroquin ◽  
Raquiel R. López-Martínez
Keyword(s):  
Toeplitz Operators ◽  
Complex Space ◽  
Fock Space ◽  
Identity Matrix ◽  
The Matrix

We introduce the so-called extended Lagrangian symbols, and we prove that the C ∗ -algebra generated by Toeplitz operators with these kind of symbols acting on the homogeneously poly-Fock space of the complex space ℂ n is isomorphic and isometric to the C ∗ -algebra of matrix-valued functions on a certain compactification of ℝ n obtained by adding a sphere at the infinity; moreover, the matrix values at the infinity points are equal to some scalar multiples of the identity matrix.

scholarly journals State estimation for bilinear impulsive control systems under uncertainties

2018 ◽  
pp. 35-41 ◽  
Author(s):  
Oxana G. Matviychuk
Keyword(s):  
Differential Equations ◽  
State Estimation ◽  
Control Systems ◽  
Uncertain Systems ◽  
Impulsive Control ◽  
Compact Set ◽  
The Matrix ◽  
Initial States ◽  
Impulsive Control Systems ◽  
The Given

The state estimation problem for uncertain impulsive control systems with a special structure is considered. The initial states are taken to be unknown but bounded with given bounds. We assume here that the coefficients of the matrix included in the differential equations are not exactly known, but belong to the given compact set in the corresponding space. We present here algorithms that allow to find the external ellipsoidal estimates of reachable sets for such bilinear impulsive uncertain systems.

scholarly journals Transformation of land use pattern in the East Borsod coal basin from the beginning of minig industry to the political changes

2016 ◽  
Vol 10 (3-4) ◽  
pp. 223-231
Author(s):  
László Sütő ◽  
Erika Homoki ◽  
Zoltán Dobány ◽  
Péter Rózsa
Keyword(s):  
Land Cover ◽  
Human Disturbance ◽  
The Political ◽  
Early 20Th Century ◽  
Late Period ◽  
Topographic Map ◽  
Coal Basin ◽  
Land Use Pattern ◽  
The Matrix ◽  
The Given

Historical geographic studies on land cover may support the understanding of the recent state. Focusing on coal mining, this process was followed and analyzed in the case of the East Borsod Coal Basin from the early 20th century to the political change. The contemporaneous maps and manuscripts concerning the mining were evaluated using geoinformatic techniques. Moreover, digitalized topographic map coming from the early and late period of mining (1924 and 1989, respectively) were analyzed. To determine the degree of human disturbance hemerobic relations and changes of the given land cover patches were quantified on the basis of the maps of the three military surveys, too. It can be stated that montanogenic subtype of an industrialagricultural landscape has been formed in the Bükkhát area. Beside the concentrated artificial surfaces, however, relative dominance of forest forming the matrix of the landscape remained.

scholarly journals ВДОСКОНАЛЕНА ПОЛІНОМІАЛЬНО-СКЛАДНА АТАКА ВІДНОВЛЕННЯ ВІДКРИТОГО ТЕКСТУ НА РАНЦЕВИЙ ШИФР НА ОСНОВІ МАТРИЦЬ

2020 ◽  
pp. 67-74
Author(s):  
Олексій Сергійович Вамболь
Keyword(s):  
Discrete Logarithm ◽  
Public Information ◽  
Galois Field ◽  
Secret Key ◽  
The Matrix ◽  
Encryption Schemes ◽  
Shared Secret ◽  
Symmetric Key ◽  
Asymmetric Encryption ◽  
The Given

Asymmetric ciphers are widely used to ensure the confidentiality of data transmission via insecure channels. These cryptosystems allow the interacting parties to create a shared secret key for a symmetric cipher in such a way that an eavesdropper gets no information useful for cryptanalysis. Network security protocols that use asymmetric ciphers include TLS, S/MIME, OpenPGP, Tor, and many others. Some of the asymmetric encryption schemes are homomorphic, that is, that they allow calculations on encrypted data to be performed without preliminary decryption. The aforesaid property makes possible using these cryptosystems not only for symmetric key establishment but also in several areas of application, in particular in secret voting protocols and cloud computing. The matrix-based knapsack cipher is a new additively homomorphic asymmetric encryption scheme, which is based on the properties of isomorphic transformations of the inner direct product of diagonal subgroups of a general linear group over a Galois field. Unlike classic knapsack encryption schemes, the cryptographic strength of this cipher depends on the computational complexity of the multidimensional discrete logarithm problem. Despite some useful properties, further research into the cryptographic strength of the matrix-based knapsack cipher has found serious drawbacks inherent in this cryptographic scheme. In the given paper an improved polynomial-time plaintext-recovery attack on the matrix-based knapsack cipher is proposed. Applying this cryptanalytic method requires only public information and has time complexity O(t1.34), where t denotes the decryption time of the attacked cryptosystem. The aforementioned attack is more productive and easier to implement in software in comparison with the original one. The advantages of the proposed method are due to using in its algorithm the simple and relatively fast matrix trace operation instead of more complex and slower transformations.

8. Matrices and groups

2015 ◽  
pp. 101-110
Author(s):  
Peter M. Higgins
Keyword(s):  
Dihedral Group ◽  
Inverse Matrix ◽  
Identity Matrix ◽  
Matrix Products ◽  
Square Matrix

‘Matrices and groups’ continues with the example of geometric matrix products to see what happens when we compose the mappings involved. It explains several features, including the identity matrix, the inverse matrix, the square matrix, and the concept of isomorphism. If a collection of matrices represent the elements of a group, such as the eight matrices that represent the dihedral group D, then each of these matrices A will have an inverse, A −1, such that AA-1 = A-1A =I, the identity matrix. This prompts the twin questions of when the inverse of a square matrix A exists and, if it does, how to find it.

scholarly journals The law of the iterated logarithm on subsequences-characterizations

1990 ◽  
Vol 118 ◽  
pp. 65-97 ◽  
Author(s):  
Michel Weber
Keyword(s):  
Unit Ball ◽  
Covariance Matrix ◽  
Identity Matrix ◽  
Random Vectors ◽  
Unbounded Function ◽  
Iterated Logarithm ◽  
Cluster Set ◽  
Euclidian Space ◽  
Zero Vector ◽  
Increasing Sequences

Let be any increasing sequence of integers and M> 1; we connect to them in a very simply way, an increasing unbounded function φ: → R+. Let also X1, X2, · · · be a sequence of i.i.d. random vectors with value in euclidian space Rm. We prove that the cluster set of the sequence almost surely coincides with the unit ball of Rm, if, and only if, the covariance matrix of X1 is the identity matrix of Rm and EX1 is the zero vector of Rm. We define a functional A on the set of increasing sequences of integers as follows:.

scholarly journals On the Dual Relationship Between Markov Chains of GI/M/1 and M/G/1 Type

2010 ◽  
Vol 42 (1) ◽  
pp. 210-225 ◽  
Author(s):  
P. G. Taylor ◽  
B. Van Houdt
Keyword(s):  
Markov Chains ◽  
Renewal Process ◽  
Markov Renewal Process ◽  
Dual Processes ◽  
Design Of Algorithms ◽  
Type Process ◽  
The Matrix ◽  
Positive Recurrent ◽  
Matrix Transforms ◽  
Phd Thesis

In 1990, Ramaswami proved that, given a Markov renewal process of M/G/1 type, it is possible to construct a Markov renewal process of GI/M/1 type such that the matrix transforms G(z, s) for the M/G/1-type process and R(z, s) for the GI/M/1-type process satisfy a duality relationship. In his 1996 PhD thesis, Bright used time reversal arguments to show that it is possible to define a different dual for positive-recurrent and transient processes of M/G/1 type and GI/M/1 type. Here we compare the properties of the Ramaswami and Bright dual processes and show that the Bright dual has desirable properties that can be exploited in the design of algorithms for the analysis of Markov chains of GI/M/1 type and M/G/1 type.

Sign in / Sign up

Export Citation Format

Share Document