The geometric mean algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The geometric mean algorithm

Bisection (of a real interval) is a well known algorithm to compute eigenvalues of symmetric matrices. Given an initial interval [a, b], convergence to an eigenvalue which has size much smaller than a or b may be made considerably faster if one replaces the usual arithmetic mean (of the end points of the current interval) with the geometric mean. Exploring this idea, we have implemented geometr...

متن کامل

The geometric mean decomposition

Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary...

متن کامل

The matrix geometric mean

An attractive candidate for the geometric mean of m positive definite matrices A1, . . . , Am is their Riemannian barycentre G. One of its important properties, monotonicity in the m arguments, has been established recently by J. Lawson and Y. Lim. We give a much simpler proof of this result, and prove some other inequalities. One of these says that, for every unitarily invariant norm, |||G||| ...

متن کامل

Some weighted operator geometric mean inequalities

In this paper, using the extended Holder- -McCarthy inequality, several inequalities involving the α-weighted geometric mean (0<α<1) of two positive operators are established. In particular, it is proved that if A,B,X,Y∈B(H) such that A and B are two positive invertible operators, then for all r ≥1, ‖X^* (A⋕_α B)Y‖^r≤‖〖(X〗^* AX)^r ‖^((1-α)/2) ‖〖(Y〗^* AY)^r ‖^((1-α)/2) ‖〖(X〗^* BX)^r ‖^(α/2) ‖〖(Y...

متن کامل

Geometric Mean based Boosting Algorithm to Resolve Data Imbalance Problem

In classification or prediction tasks, data imbalance problem is frequently observed when most of samples belong to one majority class. Data imbalance problem has received a lot of attention in machine learning community because it is one of the causes that degrade the performance of classifiers or predictors. In this paper, we propose geometric mean based boosting algorithm (GMBoost) to resolv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2012

ISSN: 0096-3003

DOI: 10.1016/j.amc.2012.08.002