Browsing by Keywords "Matrix algebra"
Now showing items 1-20 of 83
-
Accuracy and efficiency considerations in the solution of extremely large electromagnetics problems
(2011)This study considers fast and accurate solutions of extremely large electromagnetics problems. Surface formulations of large-scale objects lead to dense matrix equations involving millions of unknowns. Thanks to recent ... -
Analysis of an arbitrary profile reflector antenna system having resistive type surface–E-polarization case
(IEEE, 2006)The regularized solution is performed for arbitrary shape conic section profile geometry. In this case the reflector surface is taken as made up of resistive type material. The problem is formulated depending on the circular ... -
Analysis of cross-correlations between financial markets after the 2008 crisis
(Elsevier BV, 2013)We analyze the cross-correlation matrix C of the index returns of the main financial markets after the 2008 crisis using methods of random matrix theory. We test the eigenvalues of C for universal properties of random ... -
Analysis of finite arrays of axially directed printed dipoles on electrically large circular cylinders
(IEEE, 2004)Various arrays consisting of finite number of printed dipoles on electrically large dielectric coated circular cylinders are investigated using a hybrid method of moments/Green's function technique in the spatial domain. ... -
Analysis of finite arrays of circumferentially oriented printed dipoles on electrically large cylinders
(Wiley, 2004)An efficient and accurate hybrid method of moments (MoM)/Green's function technique in the spatial domain is developed for the rigorous analysis of large, finite phased arrays of circumferentially oriented printed dipoles ... -
Analysis of the elliptic-profile cylindrical reflector with a non-uniform resistivity using the complex source and dual-series approach: H-polarization case
(Springer, 2013)An elliptic-profile reflector with varying resistivity is analyzed under the illumination by an H-polarized beam generated by a complex-source-point (CSP) feed. The emphasis is done on the focusing ability that is potentially ... -
Analyzing large sparse Markov chains of Kronecker products
(2009)Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ... -
Block SOR for Kronecker structured representations
(Elsevier, 2004)The Kronecker structure of a hierarchical Markovian model (HMM) induces nested block partitionings in the transition matrix of its underlying Markov chain. This paper shows how sparse real Schur factors of certain diagonal ... -
Compact representation of solution vectors in Kronecker-based Markovian analysis
(Springer Verlag, 2016)It is well known that the infinitesimal generator underlying a multi-dimensional Markov chain with a relatively large reachable state space can be represented compactly on a computer in the form of a block matrix in which ... -
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
(Elsevier, 2005)This paper presents an improved version of a componentwise bounding algorithm for the state probability vector of nearly completely decomposable Markov chains, and on an application it provides the first numerical results ... -
Compressive sampling and adaptive multipath estimation
(2010)In many signal processing problems such as channel estimation and equalization, the problem reduces to a linear system of equations. In this proceeding we formulate and investigate linear equations systems with sparse ... -
Computationally efficient wavelet affine invariant functions for shape recognition
(IEEE, 2004)An affine invariant function for object recognition is constructed from wavelet coefficients of the object boundary. In previous works, undecimated dyadic wavelet transform was used to construct affine invariant functions. ... -
Continuous and discrete fractional fourier domain decomposition
(IEEE (Institute of Electrical and Electronics Engineers), 2000)We introduce the fractional Fourier domain decomposition for continuous and discrete signals and systems. A procedure called pruning, analogous to truncation of the singular-value decomposition, underlies a number of ... -
Correlation of TEM data with confined phonons to determine strain and size of Ge nanocrystals embedded in SixNy matrix
(Academic Press, 2017)Models that use phonon confinement fail to provide consistent results for nanocrystal sizes in differing dielectric matrices due to varying stress experienced by nanocrystals in different dielectric environments. In cases ... -
Correlations between the ranks of submatrices and weights of random codes
(2009)The results of our study are twofold. From the random matrix theory point of view we obtain results on the rank distribution of column submatrices. We give the moments and the covariances between the ranks (q- rank) of ... -
Cost-efficient approximation of linear systems with repeated and multi-channel filtering configurations
(IEEE, Piscataway, NJ, United States, 1998)It is possible to obtain either exact realizations or useful approximations of linear systems or matrix-vector products arising in many different applications, by synthesizing them in the form of repeated or multi-channel ... -
Coupled deconvolution for frequency extrapolation of electromagnetic solutions with matrix pencil method
(2005)Matrix pencil method (MPM) has been widely used to estimate the parameters of complex-exponential based models. An important application is the extrapolation of the frequency-domain solutions of electromagnetic problems. ... -
Coupled matrix pencil method for frequency extrapolation of electromagnetic solutions
(2005)Matrix pencil method (MPM) is used to extrapolate the available electromagnetic solutions in frequency domain to estimate the high-frequency solutions. A new approach, namely, coupled MPM, is introduced to obtain the ... -
Decentralized blocking zeros and the decentralized strong stabilization problem
(IEEE, 1995)This paper is concerned with a new system theoretic concept, decentralized blocking zeros, and its applications in the design of decentralized controllers for linear time-invariant finite-dimensional systems. The concept ... -
Decomposing linear programs for parallel solution
(Springer Verlag, 1996)Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, these approaches suffer from unscalability ...
