最小二乘均值的新确定性方法
New deterministic approaches to the least square mean
摘要:
本文给出了有限个正定矩阵集合的最小二乘均值(也称为几何平均或重心)的新的确定性逼近。设A1,A2,...,Am是Md(C)+的任意元素,其中Md(C)+是实向量空间中自伴矩阵H(n)的开锥.我们考虑m个矩阵的块序列,即,(A1,...,Am,A1,...,Am,A1,...,Am,.)。我们在每个块上取一个置换,然后取这个新序列的通常的归纳平均值。本文的主要结果是,这种分块置换序列的归纳平均逼近Md(C)+上的最小二乘平均。这推广了Holbrook的一个定理.此外,我们还估计了收敛的收敛速率。
英文摘要:
In this paper we presents new deterministic approximations to the least square mean, also called geometric mean or barycenter of a finite collection of positive definite matrices. Let A1, A2, ..., Am be any elements of Md(C)+, where the set Md(C)+ is the open cone in the real vector space of selfadjoint matrices H(n). We consider a sequence of blocks of m matrices, that is,(A1, ..., Am, A1, ...,Am, A1, ...,Am, ...). We take a permutation on every block and then take the usual inductive mean of that new sequence. The main result of this work is that the inductive mean of this block permutation sequence approximate the least square mean on Md(C)+. This generalizes a Theorem obtain by Holbrook. Even more, we have an estimate for the rate of convergence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。