Relationship Between The Impedance Matrix And The Transfer Matrix With Specific Reference To Symmetrical, Reciprocal And Conservative Systems

Impedance matrix and transfer matrix methods are often used in the analysis of linear dynamical systems. In this paper, general relationships between these matrices are derived. The properties of the impedance matrix and the transfer matrix of symmetrical systems, reciprocal systems and conservative systems are investigated. In the process, the following observations are made: (a) symmetrical systems are not a subset of reciprocal systems, as is often misunderstood; (b) the cascading of reciprocal systems again results in a reciprocal system, whereas cascading of symmetrical systems does not necessarily result in a symmetrical system; (c) the determinant of the transfer matrix, being ±1, is a property of both symmetrical systems and reciprocal systems, but this condition, however, is not sufficient to establish either the reciprocity or the symmetry of the system; (d) the impedance matrix of a conservative system is skew-Hermitian.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

A transfer matrix approach for evaluation of the response of a multi-layer infinite plate to a two-dimensional pressure excitation

A 6 X 6 transfer matrix is presented to evaluate the response of a multi-layer infinite plate to a given two-dimensional pressure excitation on one of its faces or, alternatively, to evaluate the acoustic pressure distribution excited by the normal velocity components of the radiating surfaces. It is shown that the present transfer matrix is a general case embodying the transfer matrices of normal excitation and one-dimensional pressure excitation due to an oblique incident wave. It is also shown that the present transfer matrix obeys the necessary checks to categorize the physically symmetric multi-layer plate as dynamically symmetric. Expressions are derived to obtain the wave propagation parameters, such as the transmission, absorption and reflection coefficients, in terms of the elements of the transfer matrix presented. Numerical results for transmission loss and reflection coefficients of a two-layer configuration are presented to illustrate the effect of angles of incidence, layer characteristics and ambient media.

Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays

A symmetrizer of a nonsymmetric matrix A is the symmetric matrix X that satisfies the equation XA = A(t)X, where t indicates the transpose. A symmetrizer is useful in converting a nonsymmetric eigenvalue problem into a symmetric one which is relatively easy to solve and finds applications in stability problems in control theory and in the study of general matrices. Three designs based on VLSI parallel processor arrays are presented to compute a symmetrizer of a lower Hessenberg matrix. Their scope is discussed. The first one is the Leiserson systolic design while the remaining two, viz., the double pipe design and the fitted diagonal design are the derived versions of the first design with improved performance.

Density-matrix renormalization-group study of low-lying excitations of polyacene within a Pariser-Parr-Pople model

We have carried out symmetrized density-matrix renormalization-group calculations to study the nature of excited states of long polyacene oligomers within a Pariser-Parr-Pople Hamiltonian. We have used the C-2 symmetry, the electron-hole symmetry, and the spin parity of the system in our calculations. We find that there is a crossover in the lowest dipole forbidden two-photon state and the lowest dipole allowed excited state with size of the oligomer. In the long system limit, the two-photon state lies below the lowest dipole allowed excited state. The triplet state lies well below the two-photon state and energetically does not correspond to its description as being made up of two triplets. These results are in agreement with the general trends in linear conjugated polymers. However, unlike in linear polyenes wherein the two-photon state is a localized excitation, we find that in polyacenes, the two-photon excitation is spread out over the system. We have doped the systems with a hole and an electron and have calculated the charge excitation gap. Using the charge gap and the optical gap, we estimate the binding energy of the 1(1)B(-) exciton to be 2.09 eV. We have also studied doubly doped polyacenes and find that the bipolaron in these systems, to be composed of two separated polarons, as indicated by the calculated charge-density profile and charge-charge correlation function. We have studied bond orders in various states in order to get an idea of the excited state geometry of the system. We find that the ground state, the triplet state, the dipole allowed state, and the polaron excitations correspond to lengthening of the rung bonds in the interior of the oligomer while the two-photon excitation corresponds to the rung bond lengths having two maxima in the system.

Transfer matrix modeling of hyperbolic and parabolic ducts with incompressible mean flow

A general differential equation for the propagation of sound in a variable area duct or nozzle carrying incompressible mean flow (of low Mach number) is derived and solved for hyperbolic and parabolic shapes. Expressions for the state variables of acoustic pressure and acoustic mass velocity of the shapes are derived. Self‐consistent expressions for the four‐pole parameters are developed. The conical, exponential, catenoidal, sine, and cosine ducts are shown to be special cases of hyperbolic ducts. Finally, it is shown that if the mean flow in computing the transmission loss of the mufflers involving hyperbolic and parabolic shapes was not neglected, little practical benefit would be derived.

A matrix model for QCD: QCD color is mixed

We use general arguments to show that colored QCD states when restricted to gauge invariant local observables are mixed. This result has important implications for confinement: a pure colorless state can never evolve into two colored states by unitary evolution. Furthermore, the mean energy in such a mixed colored state is infinite. Our arguments are confirmed in a matrix model for QCD that we have developed using the work of Narasimhan and Ramadas(3) and Singer.(2) This model, a (0 + 1)-dimensional quantum mechanical model for gluons free of divergences and capturing important topological aspects of QCD, is adapted to analytical and numerical work. It is also suitable to work on large N QCD. As applications, we show that the gluon spectrum is gapped and also estimate some low-lying levels for N = 2 and 3 (colors). Incidentally the considerations here are generic and apply to any non-Abelian gauge theory.

Strain Gradient Effects on Deformation Strengthening Behavior of Particle Reinforced Metal Matrix Composites

Dislocation models with considering the mismatch of elastic modulus between matrix and reinforcing particles are used to determine the effective strain gradient \ita for particle reinforced metal matrix composites (MMCp) in the present research. Based on Taylor relation and the kinetics of dislocation multiplication, glide and annihilation, a strain gradient dependent constitutive equation is developed. By using this strain gradient-dependent constitutive equation, size-dependent deformation strengthening behavior is characterized. The results demonstrate that the smaller the particle size, the more excellent in the reinforcing effect. Some comparisons with the available experimental results demonstrate that the present approach is satisfactory.

Mechanical and magnetic properties of metal fibre networks, with and without a polymeric matrix

Bonded networks of metal fibres are highly porous, permeable materials, which often exhibit relatively high strength. Material of this type has been produced, using melt-extracted ferritic stainless steel fibres, and characterised in terms of fibre volume fraction, fibre segment (joint-to-joint) length and fibre orientation distribution. Young's moduli and yield stresses have been measured. The behaviour when subjected to a magnetic field has also been investigated. This causes macroscopic straining, as the individual fibres become magnetised and tend to align with the applied field. The modeling approach of Markaki and Clyne, recently developed for prediction of the mechanical and magneto-mechanical properties of such materials, is briefly summarised and comparisons are made with experimental data. The effects of filling the inter-fibre void with compliant (polymeric) matrices have also been explored. In general the modeling approach gives reliable predictions, particularly when the network architecture has been characterised using X-ray tomography. © 2005 Published by Elsevier Ltd.

Particulate Size Effects in the Particle-Reinforced Metal-Matrix Composites

The influences of I,article size on the mechanical properties of the particulate metal matrix composite;are obviously displayed in the experimental observations. However, the phenomenon can not be predicted directly using the conventional elastic-plastic theory. It is because that no length scale parameters are involved in the conventional theory. In the present research, using the strain gradient plasticity theory, a systematic research of the particle size effect in the particulate metal matrix composite is carried out. The roles of many composite factors, such as: the particle size, the Young's modulus of the particle, the particle aspect ratio and volume fraction, as well as the plastic strain hardening exponent of the matrix material, are studied in detail. In order to obtain a general understanding for the composite behavior, two kinds of particle shapes, ellipsoid and cylinder, are considered to check the strength dependence of the smooth or non-smooth particle surface. Finally, the prediction results will be applied to the several experiments about the ceramic particle-reinforced metal-matrix composites. The material length scale parameter is predicted.

A micromechanical model of influence of particle fracture and particle cluster on mechanical properties of metal matrix composites

A general analytical model for a composite with an isotropic matrix and two populations of spherical inclusions is proposed. The method is based on the second order moment of stress for evaluating the homogenised effective stress in the matrix and on the secant moduli concept for the plastic deformation. With Webull's statistical law for the strength of SiCp particles, the model can quantitatively predict the influence of particle fracture on the mechanical properties of PMMCs. Application of the proposed model to the particle cluster shows that the particle cluster has neglected influence on the strain and stress curves of the composite. (C) 1998 Elsevier Science B.V.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

MODIFIED ENGAGEMENT METHOD FOR MATRIX OPERATION

We describe a modified engagement method for matrix operation based on a two-dimensional crossed-ring interconnection network, Our method incorporates fewer steps than that reported by Bocker et al. [Appl. Opt. 22, 804 (1983)], and its performance is found to be the most efficient (minimum steps) in comparison with other systolic and/or engagement methods for matrix operation. Thus, it may be helpful for other optical and electronic implementations of matrix operations. One compact optoelectronic integrity approach for implementing the modified engagement method is briefly described. (C) 1995 Optical Society of America

Analysis of characteristic matrix for a uniaxially birefringent thin film

As the principal section consistent with the principal plane, electromagnetic propagation in a uniaxially birefingent thin film can be described with a concise 2 x 2 characteristic matrix, in which the refractive indices of the forward and backward propagating extraordinary rays are different and dependent. In this letter, based on Huygen's construction, the refractive indices and effective optical admittances of the forward and backward propagating extraordinary rays are discussed further, and the 2 x 2 characteristic matrix is simplified. Furthermore, the input optical admittance, reflectance and transmittance of assembly is presented, just as an isotropic thin film. The result can be extended to the general case of multilayer uniaxially birefringent thin films with their optic axes in the incident plane. Copyright (c) EPLA, 2007.

Fast calculation technique for scattering in T-matrix method

In scattering calculations using the T-matrix method, the calculation of the T-matrix involves multiplication and inversion of matrices. These two types of matrix operations are time-consuming, especially for the matrices with large size. Petrov et al. [D. Petrov, Y. Shkuratov, G. Videen, Opt. Lett. 32 (2007) 1168] proposed an optimized matrix inversion technique, which suggests the inversion of two matrices, each of which contains half the number of rows. This technique reduces time-consumption significantly. On the basis of this approach, we propose another fast calculation technique for scattering in the T-matrix method, which obtains the scattered fields through carrying out only the operations between matrices and the incident field coefficient. Numerical results show that this technique can decrease time-consumption by more than half that of the optimized matrix inversion technique by Petrov et al. (c) 2008 Elsevier B.V. All rights reserved.