Real and complex Schur forms have been receiving increasing attention from the fluid mechanics community recently,especially related to vortices and turbulence.Several decompositions of the velocity gradient tensor,su...Real and complex Schur forms have been receiving increasing attention from the fluid mechanics community recently,especially related to vortices and turbulence.Several decompositions of the velocity gradient tensor,such as the triple decomposition of motion(TDM)and normal-nilpotent decomposition(NND),have been proposed to analyze the local motions of fluid elements.However,due to the existence of different types and non-uniqueness of Schur forms,as well as various possible definitions of NNDs,confusion has spread widely and is harming the research.This work aims to clean up this confusion.To this end,the complex and real Schur forms are derived constructively from the very basics,with special consideration for their non-uniqueness.Conditions of uniqueness are proposed.After a general discussion of normality and nilpotency,a complex NND and several real NNDs as well as normal-nonnormal decompositions are constructed,with a brief comparison of complex and real decompositions.Based on that,several confusing points are clarified,such as the distinction between NND and TDM,and the intrinsic gap between complex and real NNDs.Besides,the author proposes to extend the real block Schur form and its corresponding NNDs for the complex eigenvalue case to the real eigenvalue case.But their justification is left to further investigations.展开更多
In tensor theory, the parallel factorization （PARAFAC）decomposition expresses a tensor as the sum of a set of rank-1tensors. By carrying out this numerical decomposition, mixedsources can be separated or unknown sys...In tensor theory, the parallel factorization （PARAFAC）decomposition expresses a tensor as the sum of a set of rank-1tensors. By carrying out this numerical decomposition, mixedsources can be separated or unknown system parameters can beidentified, which is the so-called blind source separation or blindidentification. In this paper we propose a numerical PARAFACdecomposition algorithm. Compared to traditional algorithms, wespeed up the decomposition in several aspects, i.e., search di-rection by extrapolation, suboptimal step size by Gauss-Newtonapproximation, and linear search by n steps. The algorithm is ap-plied to polarization sensitive array parameter estimation to showits usefulness. Simulations verify the correctness and performanceof the proposed numerical techniques.展开更多
文摘Real and complex Schur forms have been receiving increasing attention from the fluid mechanics community recently,especially related to vortices and turbulence.Several decompositions of the velocity gradient tensor,such as the triple decomposition of motion(TDM)and normal-nilpotent decomposition(NND),have been proposed to analyze the local motions of fluid elements.However,due to the existence of different types and non-uniqueness of Schur forms,as well as various possible definitions of NNDs,confusion has spread widely and is harming the research.This work aims to clean up this confusion.To this end,the complex and real Schur forms are derived constructively from the very basics,with special consideration for their non-uniqueness.Conditions of uniqueness are proposed.After a general discussion of normality and nilpotency,a complex NND and several real NNDs as well as normal-nonnormal decompositions are constructed,with a brief comparison of complex and real decompositions.Based on that,several confusing points are clarified,such as the distinction between NND and TDM,and the intrinsic gap between complex and real NNDs.Besides,the author proposes to extend the real block Schur form and its corresponding NNDs for the complex eigenvalue case to the real eigenvalue case.But their justification is left to further investigations.
基金supported by the National Natural Science Foundation of China(61571131)the Technology Innovation Fund of the 10th Research Institute of China Electronics Technology Group Corporation(H17038.1)
文摘In tensor theory, the parallel factorization （PARAFAC）decomposition expresses a tensor as the sum of a set of rank-1tensors. By carrying out this numerical decomposition, mixedsources can be separated or unknown system parameters can beidentified, which is the so-called blind source separation or blindidentification. In this paper we propose a numerical PARAFACdecomposition algorithm. Compared to traditional algorithms, wespeed up the decomposition in several aspects, i.e., search di-rection by extrapolation, suboptimal step size by Gauss-Newtonapproximation, and linear search by n steps. The algorithm is ap-plied to polarization sensitive array parameter estimation to showits usefulness. Simulations verify the correctness and performanceof the proposed numerical techniques.
