Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"matrix polynomial"”.
-
Matrix Polynomials and their Lower Rank Approximations
… on computing a “lower-rank” approximation of a matrix polynomial using second-order non-linear optimization techniques. Two notions of rank are investigated. The first is the rank as the number of linearly independent rows or columns, which is the classical definition. The other notion …
-
Um estudo sobre polinômios matriciais
… aims to make a study of the algebraic theory of matrix monic polynomials, as well as the definitions, concepts and properties with respect to block eigenvalues, block eigenvectors and solvents of P(X). We investigte the main relations between the matrix polynomial and the Companion and …
-
On matrix generalization of Hurwitz polynomials
This thesis focuses on matrix generalizations of Hurwitz polynomials. A real polynomial with all its roots in the open left half plane of the complex plane is called a Hurwitz polynomial. The study of these Hurwitz polynomials has a long and abundant history, which is associated with the names of …
-
Linear Operators Strongly Preserving Polynomial Equations Over Antinegative Semirings
… linear operators that strongly preserve the matrix polynomial equation p(X) = X. where p(X) = Xr1 + Xr2 + ... + Xrt and r1>r2>...>rt≥2. In addition, we characterized the group of linear operators that strongly preserve r-cyclic matrices over the same semirings. We also extended these results …
-
Integrated System Identification and Adaptive State Estimation for Control of Flexible Space Structures
… of the system and noises, are used to identify a matrix polynomial model of the system, then a state space model and the corresponding optimal steady state Kalman filter gain are calculated from the coefficients of the identified matrix polynomial model. The derived methods are suitable for …
-
ΑΡΙΘΜΗΤΙΚΑ ΠΕΔΙΑ ΠΟΛΥΩΝΥΜΙΚΩΝ ΠΙΝΑΚΩΝ ΚΑΙ ΕΦΑΡΜΟΓΕΣ
FOR THE MATRIX POLYNOMIAL P(Λ)=AMΛ^M+...+A1Λ+A0, WHERE Λ BELONGS TO R AND THE COEFFICIENTS AJ (J=0, 1,..., M) ARE NXN MATRICES, THE SET NR[P(Λ)]={Λ BELONGS TO C: X*P(Λ)X=0, X BELONGS TO C^N\{O}} IS KNOWN AS NUMERICAL RANGE OF P(Λ). IT IS PROVED THAT NR[P(Λ)]U{0} IS (ABSTRACT TRUNCATED)
-
Tensor rank decompositions via the pseudo-moment method
… of pseudo-moments" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those …
-
Crouzeix's Conjecture and the GMRES Algorithm
… GMRES iterations. Other sets associated with a matrix that can also help predict convergence are the pseudospectrum and the numerical range. This work focuses on convergence bounds obtained by considering the latter. In particular, it focuses on the application of Crouzeix's conjecture, which …
-
Interpolation by rational matrix functions with minimal McMillan degree
Interpolation conditions on rational matrix functions expressed in terms of residues are studied. As a compact way of expressing tangential interpolation conditions of arbitrarily high multiplicity possibly from both sides simultaneously, interpolation conditions are represented in terms of …
-
Eigenanalysis solution for quasi birth and death process
… Formal solution to such models based on Neuts's matrix geometric approach have appeared frequently in the literature. A major problem in using the matrix geometric approach is the computation of the rate matrix, which requires the solution of a matrix polynomial. In particular, computational …
-
The Distance to Uncontrollability via Linear Matrix Inequalities
… in two variables. In 2000 Gu proposed the first polynomial time algorithm to compute this distance. This algorithm relies heavily on efficient eigenvalue solvers. In this work we examine two alternative algorithms that result in linear matrix inequalities. For the first algorithm, proposed by …
-
Theory and Methodology of Integrated Ladder Filter Design
… established in terms of a family of symmetric matrix polynomial systems (SMPS's). It is shown that SMPS's are a natural mathematical abstraction of ladder circuits. The properties of stability, canonical (or minimal) realisation, low-sensitivity and low-noise, are proved for SMPS's under …
-
Computational approximation theory on higher-genus domains
… the real axis that arise naturally in orthogonal polynomial theory, iterative numerical linear algebra, and the study of integrable nonlinear wave equations. In each case, exploiting this underlying structure to choose appropriate basis functions (orthogonal polynomials) is essential to obtain a …
-
Physical layer security in massive MIMO systems
… data and AN precoding strategy based on a matrix polynomial expansion. Finally, we consider a more realistic system model by taking into account non-ideal hardware components. Based on a general hardware impairment model, we derive a lower bound for the ergodic secrecy rate achieved by each …
-
Stability and Spectral Properties in the Max Algebra with Applications in Ranking Schemes
… of the spectral properties of mat- rix polynomials. We analyse their relation to multi-step difference equations. We show how results for matrix polynomials in the conventional algebra carry over naturally to the max-algebraic setting. We also consider an extension of the so-called …
-
The Truncated Matricial Stieltjes Moment Problem and Corresponding Matrix Balls
… in eindeutiger Weise mit gewissen holomorphen Matrixfunktionen, ihren sogenannten Stieltjes-Transformierten, identifizieren. Das Ziel der Betrachtungen dieser Arbeit ist, die Menge aller Werte zu charakterisieren, welche diese Stieltjes-Transformierten bei Auswertung in einem fixierten Punkt …
-
Σύνολα Birkhoff-James ε-ορθογωνιότητας και αριθμητικά πεδία
… the notion of the numerical range of a square matrix in the case of rectangular matrices. In the sequel we make a connection between the new definition and the notion of the Birkhoff-James ε-orthogonality and we define the Birkhoff-James ε-orthogonality sets for rectangular matrices and we …
-
Εφαρμογή των αλγοριθμικών διαδικασιών στην εφαρμοσμένη θεωρία μητρών
In this thesis the ring of the matrix functions is being established and studied. Besides the theoretical study and research of the subject, special algorithms are being developed for the calculation of quantities that have to do with the matrix functions. It is obvious that the study and research …
-
Pseudo-Companion Matrices for Polynomial Systems
Roots of a scalar polynomial in one variable are frequently found by computing the eigenvalues of the standard companion matrix. In this exploratory work, we introduce the pseudo-companion matrix for finding roots of multivariable polynomial systems. In some cases, a perturbation of the polynomial …