A Non-Hermitian Joint Diagonalization based Blind Source Separation algorithm for Operational Modal Analysis
نویسندگان
چکیده
Second Order Blind Source Separation (SO-BSS) techniques possess several mathematical characteristics making them a viable option for Operational Modal Analysis (OMA). However, on closer scrutiny it is revealed that there are certain subtleties that limit their direct application to OMA applications. This paper continues from past work of the authors, which focussed on understanding SO-BSS techniques from a perspective of OMA applicability and developing SO-BSS based algorithm for OMA. In this paper, a new algorithm is proposed that overcomes the inherent limitations of SO-BSS algorithms with regards to their applicability to OMA. These limitations include applicability to heavily damped systems, identification of complex modes, and applicability to scenarios where number of available sensors is lesser than the number of modes to be estimated, etc. The algorithm’s advantage over original form of SO-BSS is demonstrated by means of an analytical example.
منابع مشابه
Joint diagonalization via subspace fitting techniques
Joint diagonalization problems of Hermitian or non-Hermitian matrices occur as the final parameter estimation step in several blind source separation problems such as ACMA, JADE, PARAFAC, and SOBI. Previous approaches have been Jacobi iteration schemes and alternating projections. Here we show how the joint diagonalization problem can be formulated as a (weighted) subspace fitting problem so th...
متن کاملA blind source separation based approach for modal parameter estimation in traditional input-output eperimental modal analysis framework (bn1724)
Though Blind Source Separation (BSS) techniques have typically been applied within Operational Modal Analysis (OMA) framework, there joint diagonalization property can also be utilized within traditional input-output Experimental Modal Analysis (EMA) for the purpose of modal parameter estimation. This paper explores this possibility and suggests an approach to achieve the same. The paper presen...
متن کاملA Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation
A new efficient algorithm is presented for joint diagonalization of several matrices. The algorithm is based on the Frobenius-norm formulation of the joint diagonalization problem, and addresses diagonalization with a general, non-orthogonal transformation. The iterative scheme of the algorithm is based on a multiplicative update which ensures the invertibility of the diagonalizer. The algorith...
متن کاملA fast algorithm for joint diagonalization with application to blind source separation
We present a new approach to approximate joint diagonalization of a set of matrices. The main advantages of our method are computational efficiency and generality. The algorithm is based on the Frobeniusnorm formulation of the joint diagonalization problem, and addresses diagonalization with a general, non-orthogonal transformation. The iterative scheme of the algorithm inherits the key ideas f...
متن کاملNon-orthogonal joint diagonalization in the least-squares sense with application in blind source separation
Approximate joint diagonalization of a set of matrices is an essential tool in many blind source separation (BSS) algorithms. A common measure of the attained diagonalization of the set is the weighted least-squares (WLS) criterion. However, most well-known algorithms are restricted to finding an orthogonal diagonalizing matrix, relying on a whitening phase for the nonorthogonal factor. Often, ...
متن کامل