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 20 of 41 for “"Algebras, linear"”.
-
Mappings on triangular algebras
In this dissertation, we study certain types of linear mappings on triangular algebras. Triangular algebras are algebras whose elements can be written in the form of 2 x 2 matrices [special characters omitted]where a ∈ A, b ∈ B, m ∈ M and where A, B are algebras and M is a bimodule. Many widely …
-
Algorithms for solving overdetermined systems of linear equations in the l[p-subsript] sense
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1975
-
On the Wedderburn Principle Theorem for commutative power-associative algebras
Thesis (Ph. D.)--Michigan State University of Agriculture and Applied Science. Department of Mathematics, 1963
-
Topics in sparse approximation
… a good approximation of an input signal as a linear combination of elementary signals, yet they stipulate that the approximation may involve only a few of the elementary signals. This class of problems arises throughout applied mathematics, statistics, and electrical engineering, but small …
-
Representations of quivers over finite fields
The main purpose of this thesis is to obtain surprising identities by counting the representations of quivers over finite fields. A classical result states that the dimension vectors of the absolutely indecomposable representations of a quiver Γ are in one-to-one correspondence with the positive …
-
Mechanical derivation and systematic analysis of correct linear algebra algorithms
… the problem of developing formally correct dense linear algebra libraries. The problem would be solved convincingly if, starting from the mathematical specification of a target operation, it were possible to generate, implement and analyze a family of correct algorithms that compute the operation. …
-
Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems
… problems require the solution of a system of linear equations Ax = b in which A is large, highly sparse, nonsymmetric, and unstructured. Several iterative methods which are applicable to nonsymmetric and indefinite problems are applied to a suite of test problems derived from simulations of …
-
Comparison and oscillation theorems for linear self-adjoint vector-matrix differential equations
Electronic Thesis or Dissertation
-
Graph geometry from effective resistances
<p>The main subject of this thesis is the effective resistance — a measure of distance between the nodes of a graph which reflects how close or well- connected two nodes are, taking into account all paths between them and their interconnections.</p> <p>The effective resistance has many other …
-
Stability and perturbation analysis of non-negative super-resolution
<p>The convolution of a discrete measure, x = P<em><sup>k</sup></em><sub><em>i</em>=<em>1</em></sub> a<em><sub>i</sub></em>δ<sub><em>ti</em></sub> , with a local window function, <em>φ</em>(<em>s</em> − <em>t</em>), is a common model for a measurement device whose resolution is substantially lower …
-
The generic failure of lower-semicontinuity for the linear distortion functional : a thesis presented in partial fulfilment of the requirments for the degree of Doctor of Philosophy (PhD) in Mathematics, Institute of Advance Studies (NZIAS) Massey University of Auckland, New Zealand
… of distortion functionals (particularly the linear distortion) defined for quasiconformal homeomorphisms of domains in Euclidean n-spaces, though we will mainly stick to three-dimensions. The principal application is in studying the lower semi-continuity of distortion on uniformly convergent …
-
Convexity and linear distortion : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Mathematics, Institute of Natural and Mathematical Science, Massey University of Albany, New Zealand
… of distortion functionals (particularly the linear distortion) defined on quasiconformal homeomorphisms of domains in Euclidean n-spaces, though we will mainly stick to three-dimensions. The principal applica-tion is in identifying the lower semi-continuity of distortion on uniformly …
-
On the δ-conjecture for graphs with minimum degree |G| – 4
For a graph G of order n, the minimum rank of G is defined to be the minimum rank among all n × n symmetric matrices whose ij-entry is nonzero precisely when {i, j} is an edge of G. The delta conjecture proposes a relationship between the minimum rank and the minimum degree of a given graph. We …
-
Quotient posets and the characteristic polynomial
"In this dissertation we consider the generating function for the M öbius function of finite partially ordered sets. This generating function is called the characteristic polynomial of the partially ordered set. We are primarily interested in explaining why certain families of partially ordered …
-
On the computational role of the simple cells in early vision / by Tim R. Pattison.
This thesis reviews models of the simple cell receptive field profile (RFP) and its variation over the simple cell population, and uses artifical neural networks to investigate the multi-dimensional signal processing role of the RFP in the formation of a cortical representation of the visual image.
Page 1 of 3