Modelling of induction motors for system faults and transient stability studies

The research carried out in this thesis was mainly concerned with the effects of large induction motors and their transient performance in power systems. Computer packages using the three phase co-ordinate frame of reference were developed to simulate the induction motor transient performance. A technique using matrix algebra was developed to allow extension of the three phase co-ordinate method to analyse asymmetrical and symmetrical faults on both sides of the three phase delta-star transformer which is usually required when connecting large induction motors to the supply system. System simulation, applying these two techniques, was used to study the transient stability of a power system. The response of a typical system, loaded with a group of large induction motors, two three-phase delta-star transformers, a synchronous generator and an infinite system was analysed. The computer software developed to study this system has the advantage that different types of fault at different locations can be studied by simple changes in input data. The research also involved investigating the possibility of using different integrating routines such as Runge-Kutta-Gill, RungeKutta-Fehlberg and the Predictor-Corrector methods. The investigation enables the reduction of computation time, which is necessary when solving the induction motor equations expressed in terms of the three phase variables. The outcome of this investigation was utilised in analysing an introductory model (containing only minimal control action) of an isolated system having a significant induction motor load compared to the size of the generator energising the system.

A Basis for Z-Graded Identities of Matrices over Infinite Fields

2000 Mathematics Subject Classification: 16R10, 16R20, 16R50

Pseudodifferential operators with C*-algebra-valued symbols: Abstract characterizations

Given a separable unital C*-algebra C with norm parallel to center dot parallel to, let E-n denote the Banach-space completion of the C-valued Schwartz space on R-n with norm parallel to f parallel to(2)=parallel to < f, f >parallel to(1/2), < f, g >=integral f(x)* g(x)dx. The assignment of the pseudodifferential operator A=a(x,D) with C-valued symbol a(x,xi) to each smooth function with bounded derivatives a is an element of B-C(R-2n) defines an injective mapping O, from B-C(R-2n) to the set H of all operators with smooth orbit under the canonical action of the Heisenberg group on the algebra of all adjointable operators on the Hilbert module E-n. In this paper, we construct a left-inverse S for O and prove that S is injective if C is commutative. This generalizes Cordes' description of H in the scalar case. Combined with previous results of the second author, our main theorem implies that, given a skew-symmetric n x n matrix J and if C is commutative, then any A is an element of H which commutes with every pseudodifferential operator with symbol F(x+J xi), F is an element of B-C(R-n), is a pseudodifferential operator with symbol G(x - J xi), for some G is an element of B-C(R-n). That was conjectured by Rieffel.

Anisotropic correlated electron model associated with the Temperley-Lieb algebra

We present an anisotropic correlated electron model on a periodic lattice, constructed from an R-matrix associated with the Temperley-Lieb algebra. By modification of the coupling of the first and last sites we obtain a model with quantum algebra invariance.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Integrability and exact solution for coupled BCS systems associated with the su(4) Lie algebra

We introduce an integrable model for two coupled BCS systems through a solution of the Yang-Baxter equation associated with the Lie algebra su(4). By employing the algebraic Bethe ansatz, we determine the exact solution for the energy spectrum. An asymptotic analysis is conducted to determine the leading terms in the ground state energy, the gap and some one point correlation functions at zero temperature. (C) 2002 Published by Elsevier Science B.V.

On derivatives and norms of generalized matrix functions and respective symmetric powers

In recent papers, the authors obtained formulas for directional derivatives of all orders, of the immanant and of the m-th xi-symmetric tensor power of an operator and a matrix, when xi is a character of the full symmetric group. The operator norm of these derivatives was also calculated. In this paper, similar results are established for generalized matrix functions and for every symmetric tensor power.

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.

Linear algebra with applications

Lecture slides and notes for a PhD level course on linear algebra for electrical engineers and computer scientists. This course is given in in the framework of the School of Electronics and Computer Science Mathematics Training Courses https://secure.ecs.soton.ac.uk/notes/pg_maths/ (ECS password required)

Monte Carlo numerical treatment of large linear algebra problems

In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo for large problems, i.e., problems involving matrices with a number of non-zero elements ranging between one million and one billion. We are concentrating on analysis of the almost Optimal Monte Carlo (MAO) algorithm for evaluating bilinear forms of matrix powers since they form the so-called Krylov subspaces. Results are presented comparing the performance of the Robust and Non-robust Monte Carlo algorithms. The algorithms are tested on large dense matrices as well as on large unstructured sparse matrices.

Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.

Random orthogonal matrix simulation

This paper introduces a method for simulating multivariate samples that have exact means, covariances, skewness and kurtosis. We introduce a new class of rectangular orthogonal matrix which is fundamental to the methodology and we call these matrices L matrices. They may be deterministic, parametric or data specific in nature. The target moments determine the L matrix then infinitely many random samples with the same exact moments may be generated by multiplying the L matrix by arbitrary random orthogonal matrices. This methodology is thus termed “ROM simulation”. Considering certain elementary types of random orthogonal matrices we demonstrate that they generate samples with different characteristics. ROM simulation has applications to many problems that are resolved using standard Monte Carlo methods. But no parametric assumptions are required (unless parametric L matrices are used) so there is no sampling error caused by the discrete approximation of a continuous distribution, which is a major source of error in standard Monte Carlo simulations. For illustration, we apply ROM simulation to determine the value-at-risk of a stock portfolio.

A note on the Fredholm properties of Toeplitz operators on weighted Bergman spaces with matrix-valued symbols

We characterize the essential spectra of Toeplitz operators Ta on weighted Bergman spaces with matrix-valued symbols; in particular we deal with two classes of symbols, the Douglas algebra C+H∞ and the Zhu class Q := L∞ ∩VMO∂ . In addition, for symbols in C+H∞ , we derive a formula for the index of Ta in terms of its symbol a in the scalar-valued case, while in the matrix-valued case we indicate that the standard reduction to the scalar-valued case fails to work analogously to the Hardy space case. Mathematics subject classification (2010): 47B35,

The spectrum of an open vertex model based on the U(q)[SU(2)] algebra at roots of unity

We study the exact solution of an N-state vertex model based on the representation of the U(q)[SU(2)] algebra at roots of unity with diagonal open boundaries. We find that the respective reflection equation provides us one general class of diagonal K-matrices having one free-parameter. We determine the eigenvalues of the double-row transfer matrix and the respective Bethe ansatz equation within the algebraic Bethe ansatz framework. The structure of the Bethe ansatz equation combine a pseudomomenta function depending on a free-parameter with scattering phase-shifts that are fixed by the roots of unity and boundary variables. (C) 2010 Elsevier B.V. All rights reserved.

REDUCTION OF TODA LATTICE HIERARCHY TO GENERALIZED KDV HIERARCHIES AND THE 2-MATRIX MODEL

Toda lattice hierarchy and the associated matrix formulation of the 2M-boson KP hierarchies provide a framework for the Drinfeld-Sokolov reduction scheme realized through Hamiltonian action within the second KP Poisson bracket. By working with free currents, which Abelianize the second KP Hamiltonian structure, we are able to obtain a unified formalism for the reduced SL(M + 1, M - k) KdV hierarchies interpolating between the ordinary KP and KdV hierarchies. The corresponding Lax operators are given as superdeterminants of graded SL(M + 1, M - k) matrices in the diagonal gauge and we describe their bracket structure and field content. In particular, we provide explicit free field representations of the associated W(M, M - k) Poisson bracket algebras generalising the familiar nonlinear W-M+1 algebra. Discrete Backlund transformations for SL(M + 1, M - k) KdV are generated naturally from lattice translations in the underlying Toda-like hierarchy. As an application we demonstrate the equivalence of the two-matrix string model to the SL(M + 1, 1) KdV hierarchy.