检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:QIU Yu-yang ZHANG Zhen-yue WANG An-ding
机构地区:[1]Department of Mathematics, Zhejiang University, Yuquan Campus, Hangzhou 310027, China [2]College of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou 310018, China [3]College of Information and Electronics, Zhejiang Gongshang University, Hangzhou 310018, China
出 处:《Applied Mathematics(A Journal of Chinese Universities)》2009年第4期451-461,共11页高校应用数学学报(英文版)(B辑)
基 金:supported in part by the Social Science Foundation of Ministry of Education(07JJD790154);the National Science Foundation for Young Scholars (60803076);the Natural Science Foundation of Zhejiang Province (Y6090211);Foundation of Education Department of Zhejiang Province (20070590);the Young Talent Foundation of Zhejiang Gongshang University
摘 要:The matrix least squares (LS) problem minx ||AXB^T--T||F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ||A1X1B1^T + A2X2B2^T - T||F can also be regarded as the constrained LS problem minx=diag(x1,x2) ||AXB^T -T||F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ||A1X1B1^T+A2X2B2^T -T||F is equivalent to min x=diag(x1 ,x2) ||AXB^T - T||F whose solutions are included in the solution set of unconstrained problem minx ||AXB^T - T||F. So the general solutions of min x1,x2 ||A1X1B^T + A2X2B2^T -T||F are reconstructed by selecting the parameter matrix in that of minx ||AXB^T - T||F.The matrix least squares (LS) problem minx ||AXB^T--T||F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ||A1X1B1^T + A2X2B2^T - T||F can also be regarded as the constrained LS problem minx=diag(x1,x2) ||AXB^T -T||F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ||A1X1B1^T+A2X2B2^T -T||F is equivalent to min x=diag(x1 ,x2) ||AXB^T - T||F whose solutions are included in the solution set of unconstrained problem minx ||AXB^T - T||F. So the general solutions of min x1,x2 ||A1X1B^T + A2X2B2^T -T||F are reconstructed by selecting the parameter matrix in that of minx ||AXB^T - T||F.
关 键 词:least squares problem generalized inverse solution set general solutions parameter matrix
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.46