• No results found

polynomial matrix eigenvalue decomposition

Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition

Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition

... Abstract —In this paper, we present a new multichannel spectral factorization algorithm which can be utilized to cal- culate the approximate spectral factor of any para-Hermitian polynomial matrix. The ...

5

A comparison of iterative and DFT-based polynomial matrix eigenvalue decompositions

A comparison of iterative and DFT-based polynomial matrix eigenvalue decompositions

... approximate polynomial matrix eigenvalue decomposition ...to polynomial matrices, the PEVD will generate paraunitary matrices that diagonalise a parahermitian ...the ...

5

A DFT based approximate eigenvalue and singular value decomposition of polynomial matrices

A DFT based approximate eigenvalue and singular value decomposition of polynomial matrices

... constant matrix decomposi- ...to polynomial EVD and SVD of the corresponding polynomial ...order decomposition, phase alignment of decomposed constant matrices in DFT domain results in polyno- ...

16

Polynomial subspace decomposition for broadband angle of arrival estimation

Polynomial subspace decomposition for broadband angle of arrival estimation

... the decomposition techniques for the polynomial space-time covariance matrix on the performance of the polynomial MUSIC algorithm introduced in ...a polynomial eigenvalue decom- ...

5

Relevance of polynomial matrix decompositions to broadband blind signal separation

Relevance of polynomial matrix decompositions to broadband blind signal separation

... The polynomial matrix EVD (PEVD) is an extension of the conventional eigenvalue decomposition (EVD) to polynomial ...of polynomial matrix terminology such as parahermitian ...

11

Enforcing eigenvector smoothness for a compact DFT-based polynomial eigenvalue decomposition

Enforcing eigenvector smoothness for a compact DFT-based polynomial eigenvalue decomposition

... Each eigenvector at each frequency bin can be influenced by an arbitrary scalar phase angle and still be valid. Discon- tinuities in phase between adjacent frequency bins can arise due to this ambiguity in eigenvector ...

5

Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

... Abstract —The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this ...

12

On the existence and uniqueness of the eigenvalue decomposition of a parahermitian matrix

On the existence and uniqueness of the eigenvalue decomposition of a parahermitian matrix

... Hermitian matrix by an eigenvalue decomposition (EVD) to the case of a parahermitian matrix that is analytic at least on an annulus containing the unit ...parahermitian matrix EVD are ...

14

Shortening of paraunitary matrices obtained by polynomial eigenvalue decomposition algorithms

Shortening of paraunitary matrices obtained by polynomial eigenvalue decomposition algorithms

... Abstract —This paper extends the analysis of the recently in- troduced row-shift corrected truncation method for paraunitary matrices to those produced by the state-of-the-art sequential matrix diagonalisation ...

5

Inversion of Parahermitian matrices

Inversion of Parahermitian matrices

... a polynomial eigenvalue decomposition obtained by the sequential best rotation algorithm to decompose a parahermitian matrix into a product of two parau- nitary, ...

6

Implicit network descriptions of RLC networks and the problem of re-engineering

Implicit network descriptions of RLC networks and the problem of re-engineering

... associate polynomial structures with functions that describe the ...admittance matrix of a connected RLC ...admittance matrix can be written as the sum of tree - products in the graph of an RLC ...

234

On eigenvalue inequalities of a matrix whose graph is bipartite

On eigenvalue inequalities of a matrix whose graph is bipartite

... symmetric matrix with zero diagonal with respect to its ...largest eigenvalue of these ...largest eigenvalue of a real symmetric matrix whose entries lie in a nonnegative ...

12

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

... of matrix polynomials have been published in the literature for such ...density matrix, and partition that graph into several ...the matrix polynomial, and the result for the full ...

21

A New Approach for Isomorphism Identification among Compound Kinematic Chains and Mechanisms

A New Approach for Isomorphism Identification among Compound Kinematic Chains and Mechanisms

... adjacency matrix). The proposed Modified Adjacency Matrix has additional information about the link values of adjacent links of a ...characteristic polynomial and its coefficients will be unique to ...

6

A New Architecture Using Polynomial Matrix Multiplication for Advanced Wireless Communication

A New Architecture Using Polynomial Matrix Multiplication for Advanced Wireless Communication

... Polynomial matrix techniques equivalent to the singular value decomposition and Eigen Value Decomposition (EVD) for scalar matrices have received growing interest in recent ...or ...

5

Blind Source Separation via Generalized Eigenvalue Decomposition

Blind Source Separation via Generalized Eigenvalue Decomposition

... generalized eigenvalue (with exeption of the last source in the non-stationary ...generalized eigenvalue decomposition, with the matrices R x and Q x representing the covariances for the two ...

9

Decomposition of matrix sequences

Decomposition of matrix sequences

... In this section we treat the first decomposition theorem for matrix sequences (or matrix recurrences). The use of the theorem lies in the fact that the second m[r] ...

19

A Maximum Eigenvalue Approximation for Crack-Sizing Using Ultrasonic Arrays

A Maximum Eigenvalue Approximation for Crack-Sizing Using Ultrasonic Arrays

... calculated eigenvalue from the scattering matrix (solid lines), equation (15), are plotted in (a) as a function of the crack radius over the wavelength ˆ a for various numbers of array lengths (l= 32mm ...

50

Solutions of the matrix linear bilateral polynomial equation and their structure

Solutions of the matrix linear bilateral polynomial equation and their structure

... ones. Matrix Sylvester-type equations over different domains [2, 8], in particular, the matrix polynomial equation (1), appear in various branches of ...

9

A Numerical Approach to solve Three Parameter Matrix Eigenvalue Problems by Kronecker Product Method

A Numerical Approach to solve Three Parameter Matrix Eigenvalue Problems by Kronecker Product Method

... three-parameter eigenvalue problems is reduced to the solution of three simultaneous one-parameter problems with common ...one-parameter eigenvalue problems can be obtained by using known ...

6

Show all 10000 documents...

Related subjects