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 131 for “"MATRIX METHODS"”.
-
Matrix methods for econometric research
… The first part is a selfcontained survey of matrix methods relevant for econometric research. It consists of four chapters, the most important of which is the fourth. The other chapters are introductory and to a large extent standard. (There are perhaps two non-standard elements: the …
-
On matrix methods in ring theory
A method for representing rings as matrix rings is used to investigate the structures of several well-known classes of rings. The general method is developed in Chapter 1. In Chapter 2 nonsingular rings with essential socles are characterized by embeddings into products of full matrix rings over …
-
Matrix methods in queueing and dynamic programming
We investigate some modern matrix methods for the solution of finite state stochastic models with an infinite time horizon. Markov and semi-Markov decision processes and finite queues in tandem with exponential service times are considered. The methods are based on the Drazin generalized inverse …
-
Random matrix methods in complex systems analysis
… the system’s behaviour. In these regards, Random Matrix Theory is the leitmotif of the whole thesis as it provides powerful and versatile techniques for such studies and it connects the investigated topics. The first chapter of this thesis contains the relevant analytical results from Random Matrix …
-
Direct sparse matrix methods for interior point algorithms.
… point algorithms. These are powerful new methods, achieving significant reductions in computer time for large LPs and solving problems significantly larger than previously possible. This dissertation describes the implementation of interior point algorithms. It focuses on applications of …
-
Structured matrix methods for computations on Bernstein basis polynomials
This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it is shown that structure preserving matrix …
-
On Multigrid and H-Matrix Methods for Partial Integro-Differential Equations
… is the development of multigrid and hierarchical matrix solution procedures with almost linear computational complexity for classes of partial integro-differential problems. An elliptic partial integro-differential equation, a convection-diffusion partial integro-differential equation and a …
-
Computational method for solving the kinematics of mechanisms using matrix methods
<p>This thesis deals with the computational methods for kinematics of mechanisms using matrix methods. The method is particularly suited to the complex mechanism problems for which hand calculations are difficult. The thesis first reviews the matrix methods on which the program IMP is based. A …
-
Structure-Preserving Matrix Methods for Computations on Univariate and Bivariate Bernstein Polynomials
… problem motivates the undertaken study into methods for computing the square-free factorisation of univariate and bivariate polynomials in Bernstein form. It will be shown how these two problems are intrinsically linked and how finding univariate polynomial roots and bivariate polynomial …
-
Recurrent Neural Networks and Matrix Methods for Cognitive Radio Spectrum Prediction and Security
… including recurrent neural networks (RNNs), matrix completion, and non-negative matrix factorization (NMF), are used for cognitive radio problems. Specifically addressed are a missing data problem and a blind signal separation problem. A specialized RNN called Cellular Simultaneous Recurrent …
-
The computation of multiple roots of a polynomial using structure preserving matrix methods.
… root solver involves the use of structured matrix methods, optimising parameters using linear programming, and solving least squares equality and nonlinear least squares problems. The developed root solver differs from the classical methods, because it first computes the multiplicities of …
-
Structured matrix methods for a polynomial root solver using approximate greatest common divisor computations and approximate polynomial factorisations.
… thesis discusses the use of structure preserving matrix methods for the numerical approximation of all the zeros of a univariate polynomial in the presence of noise. In particular, a robust polynomial root solver is developed for the calculation of the multiple roots and their multiplicities, such …
-
Analysis of Unstable-Resonator and Optical-Train Laser Alignment Systems by the Use of Matrix Methods of Gaussian Optics
… its optical elements are represented in the ABCD-matrix formalism of Gaussian optics. Propagation of Gaussian beams, image formation, focusing, and steering by transverse refractive-index gradients are modeled with the ABCD matrix technique. The effects of small translations and rotations of …
-
Deriving Filter Matrix Methods for Lattice Boltzmann Simulations. Efficient Simulations of the Convection Diffusion Equation and Navier Stokes Equations
… of flow types that can be simulated. The Filter Matrix method, originally proposed by Somers in 1993 and extended by Zhuo et al. in 2012, is a non-linear collisional operator which removes the need tune relaxation times. However, its derivation and assumptions are not well documented. In this …
-
The Integral Closure of Cubic Extensions
<p> This thesis demonstrates the effectiveness of matrix methods in algebraic number fields, the integral closure of pure cubic fields and the use of the Hessian and discriminant to determine integral closure. </p>
Page 1 of 7