Row equivalence, equivalence, and similarity of matrices are studied; some problems concerning an extension of these relations to infinite matrices are discussed.
As indicated by the title, this thesis generalizes the Main Inertia
Theorem of Ostrowski and Schneider [8]. The first three results
concern the formation of a polynomial function f(A, A*, H) so that
the existence of an hermitian H for which f(A, A*, H) is positive
definite is a necessary...
The author studies the class of rectangular arrangements in
terms of two binary relations on the objects of the arrangement.
He shows how a univalent matrix determines a unique rectangular
arrangement, and how each rectangular arrangement is associated
with one, two, or four distinct matrices, according to the number
of...
In this paper we investigate the Lyapunov mapping
P --> AP + PA *
where A is a positive stable matrix and P is a hermitian
matrix. In particular, for special positive stable A we
characterize the image of the cone of positive definite matrices
under this mapping. In Section...
This paper studies necessary and sufficient conditions for
a matrix to be conjunctive with its adjoint. The problem is solved
completely in the usual complex case, in which it is shown that a
matrix is conjunctive to its adjoint iff it is conjunctive to a real
matrix. The problem is...
In this thesis we define two nxn matrices T and S to be isoconjunctive if there exists an nxn nonsingular hermitian matrix H such that T = HSH. We then proceed to establish necessary and sufficient conditions that two nxn matrices T and S be isoconjunctive in the case where...
This thesis has four main results. First we find a reduction form
for symmetric matrices over fields of characteristic two. This result
parallels the diagonalization theorem for symmetric matrices over
fields of characteristic not two.
Secondly we reduce our reduction form to a canonical form in
perfect fields of characteristic...
A method for the synthesis of bilateral networks is
presented. A new algorithm for the realization of basic
cut-set matrices is developed. This is done by the
following procedure:
1) We form submatrices, M[subscript j] (i), j= 1,2,..., of the
given cut-set matrix, such that M[subscript j](i) satisfies
the properties...
Neutron flux and gamma-ray dose have been measured in the
experimental facilities of the Oregon State TRIGA reactor.
Thermal neutron flux measurements utilized foil activation
techniques.
The gamma-ray dose was measured with a thermoluminescent
dosimetry system. The thermoluminescent material used was LiF.
Fast neutron spectrum measurements were performed. The
fast...
Let A be an n x n real, symmetric matrix with distinct characteristic values λ₁, λ₂,...,λɴ. Then there exists an orthogonal matrix P such that PAPᵀ = Λ = (λi). Given a small symmetric change, ∆A, in the matrix A, we can calculate the resulting changes, ∆P, and ∆Λ, in...
Computing eigenpairs of a matrix corresponding to a specific geometry in the complex plane is an important topic in real time signal processing, pattern recognition, spectral analysis, systems theory, radar, sonar, and geophysics. We have studied the matrix sign and matrix sector function iterations to extract the eigenpairs belonging to...
Nonnegative matrices have a myriad of applications in the biological, social, and physical genres. Of particular importance are the primitive matrices. A nonnegative matrix, M, is primitive exactly when there is a positive integer, k, such that M[superscript k] has only positive entries; that is, all the entries in M[superscript...
This paper is a continuation of William Zell's thesis, A Model of Non-Euclidean Geometry in Three Dimensions. The purpose of that thesis was to show that the axioms of non-Euclidèan geometry are consistent if Euclidean geometry an& hence arithrnetic is consistent. Mr. Zell. discussed the axioms of connection and order...
In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
In this thesis we consider computer techniques for inverting
n X n matrices and linear Fredholm integral operators of the
second kind. We develop techniques which allow us to prove the
existence of and find approximations to inverses for the above
types of operators. In addition, we are able to...
Advances in VLSI array processing have led to many new
parallel structures for real-time Digital Signal Processing (DSP)
applications. Among all the architectures, systolic arrays have played
an important role because systolic arrays have regular, local
interconnections with modular structure. In ordinary systolic arrays,
however, all processing operations and data...
Fully efficient systolic arrays for the solution of Toeplitz
matrices using Schur algorithm [1] have been obtained. By applying
clustering mapping method [2], the complexity of the algorithm is
0(n) and it requires n/2 processing elements as opposed to n
processing elements developed elsewhere [1].
The motivation of this thesis...
