Parallelizable eigenvalue decomposition techniques via the matrix sector function
نویسندگان
چکیده
Many modern high-resolution spectral estimators in signal processing and control make use of the subspace information afforded by the singular value decomposition of the data matrix, or the eigenvalue decomposition of the covariance matrix. The derivation of these estimators involves some form of matrix decomposition. In this paper, new computational techniques for obtaining eigenvalues and eigenvectors of a square matrix are presented. These techniques are based on the matrix sector function which can be applied to break down a given matrix into matrices of smaller dimensions and consequently this approach is suitable for parallel implementation. Finally, an example which illustrates the proposed method is provided.
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملProperties of eigenvalue function
For the eigenvalue function on symmetric matrices, we have gathered a number of it’s properties.We show that this map has the properties of continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability. Eigenvalue function will be extended to a larger set of matrices and then the listed properties will prove again.
متن کاملA Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
Abstract—In the past two decades, the semidefinite programming technique has been proven to be extremely successful in the convexificiation of hard optimization problems appearing in graph theory, control theory, polynomial optimization theory, and many areas in engineering. In particular, major power optimization problems, such as optimal power flow, state estimation and unit commitment, can b...
متن کاملParallel Implementation of a Symmetric Eigensolver Based on the Yau and Lu Method
In this paper, we present preliminary results on a complete eigensolver based on the Yau and Lu method. We rst give an overview of this invariant subspace decomposition method for dense symmetric matrices followed by numerical results and work in progress of a distributed-memory implementation. We expect that the algorithm's heavy reliance on matrix-matrix multiplication, coupled with FFT shoul...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کامل