检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Guoxu Zhou Zuyuan Yang Zongze Wu Jinlong Zhang
出 处:《Progress in Natural Science:Materials International》2008年第6期735-739,共5页自然科学进展·国际材料(英文版)
基 金:the National Natural Science Foundation of China(Grant Nos.U0635001,60674033,60774094);the Natural Science Fund of Guangdong Province, China(No.05006508).
摘 要:Joint diagonalization has attracted much attention and many algorithms have been presented so far. However, some ambiguities still exist in the objective functions for joint diagonalization. In this paper, some criterions are proposed to eliminate the above ambiguities at first, and then a new objective function which satisfies these criterions is presented. The new objective function introduces diagonal constraints for joint diagonalization, thus the trivial and unbalance solutions are excluded easily. Exactly jointly diagonalizable theorem is built to interpret the reasonableness of the new objective function and the conjugate gradient method is used to provide fast and reliable convergence. Finally, non-orthogonal joint diagonalization algorithm with diagonal constraints (DDiag) is developed. Simulations show that DDiag is efficient and robust.Joint diagonalization has attracted much attention and many algorithms have been presented so far.However,some ambiguities still exist in the objective functions for joint diagonalization.In this paper,some criterions are proposed to eliminate the above ambiguities at first,and then a new objective function which satisfies these criterions is presented.The new objective function introduces diagonal con-straints for joint diagonalization,thus the trivial and unbalance solutions are excluded easily.Exactly jointly diagonalizable theorem is built to interpret the reasonableness of the new objective function and the conjugate gradient method is used to provide fast and reliable convergence.Finally,non-orthogonal joint diagonalization algorithm with diagonal constraints(DDiag)is developed.Simulations show that DDiag is ecient and robust.
关 键 词:Joint diagonalization Blind source separation Conjugate gradient method
分 类 号:TP14[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70