• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.213-228
• /
• 2010

A weighted version of the geometric mean of k ($\geq\;3$) positive invertible operators is given. For operators $A_1,{\ldots},A_k$ and for nonnegative numbers ${\alpha}_1,\ldots,{\alpha}_k$ such that $\sum_\limits_{i=1}^k\;\alpha_i=1$, we define weighted geometric means of two types, the first type by a direct construction through symmetrization procedure, and the second type by an indirect construction through the non-weighted (or uniformly weighted) geometric mean. Both of them reduce to $A_1^{\alpha_1}{\cdots}A_k^{{\alpha}_k}$ if $A_1,{\ldots},A_k$ commute with each other. The first type does not have the property of permutation invariance, but satisfies a weaker one with respect to permutation invariance. The second type has the property of permutation invariance. We also show a reverse inequality for the arithmetic-geometric mean inequality of the weighted version.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.479-495
• /
• 2013

Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.

• The Pure and Applied Mathematics
• /
• v.26 no.3
• /
• pp.189-197
• /
• 2019

In this paper we obtain some new inequalities for the weighted chaotically geometric mean of two positive operators on a complex Hilbert space.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2003

In this article, we consider a Bayesian estimation method for the geometric mean of $textsc{k}$ exponential parameters, Using the Tibshirani's orthogonal parameterization, we suggest an invariant prior distribution of the $textsc{k}$ parameters. It is seen that the prior, probability matching prior, is better than the uniform prior in the sense of correct frequentist coverage probability of the posterior quantile. Then a weighted Monte Carlo method is developed to approximate the posterior distribution of the mean. The method is easily implemented and provides posterior mean and HPD(Highest Posterior Density) interval for the geometric mean. A simulation study is given to illustrates the efficiency of the method.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.985-995
• /
• 2024

We see fundamental properties of the log-determinant α-divergence including the convexity of weighted geometric mean and the reversed sub-additivity under tensor product. We introduce a symmetrized divergence and show its properties including the boundedness and monotonicity on parameters. Finally, we discuss the barycenter minimizing the weighted sum of symmetrized divergences.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.191-204
• /
• 2017

A new fifth-order weighted Runge-Kutta algorithm based on heronian mean for solving initial value problem in ordinary differential equations is considered in this paper. Comparisons in terms of numerical accuracy and size of the stability region between new proposed Runge-Kutta(5,5) algorithm, Runge-Kutta (5,5) based on Harmonic Mean, Runge-Kutta(5,5) based on Contra Harmonic Mean and Runge-Kutta(5,5) based on Geometric Mean are carried out as well. The problems, methods and comparison criteria are specified very carefully. Numerical experiments show that the new algorithm performs better than other three methods in solving variety of initial value problems. The error analysis is discussed and stability polynomials and regions have also been presented.

• Kyungpook Mathematical Journal
• /
• v.49 no.1
• /
• pp.167-181
• /
• 2009

Based on Ricatti equation $XA^{-1}X=B$ for two (positive invertible) operators A and B which has the geometric mean $A{\sharp}B$ as its solution, we consider a cubic equation $X(A{\sharp}B)^{-1}X(A{\sharp}B)^{-1}X=C$ for A, B and C. The solution X = $(A{\sharp}B){\sharp}_{\frac{1}{3}}C$ is a candidate of the geometric mean of the three operators. However, this solution is not invariant under permutation unlike the geometric mean of two operators. To supply the lack of the property, we adopt a limiting process due to Ando-Li-Mathias. We define reasonable geometric means of k operators for all integers $k{\geq}2$ by induction. For three positive operators, in particular, we define the weighted geometric mean as an extension of that of two operators.

• Kyungpook Mathematical Journal
• /
• v.47 no.4
• /
• pp.595-600
• /
• 2007

In this paper we consider weighted arithmetic and geometric means of several positive definite operators proposed by Sagae and Tanabe and we establish a reverse inequality of the arithmetic and geometric means via Specht ratio and the Thompson metric on the convex cone of positive definite operators.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.709-723
• /
• 2024

We study the distributions of waiting times in variations of the geometric distribution of order k. Variation imposes length on the runs of successes and failures. We study two types of waiting time random variables. First, we consider the waiting time for a run of k consecutive successes the first time no sequence of consecutive k failures occurs prior, denoted by T^(k). Next, we consider the waiting time for a run of k consecutive failures the first time no sequence of k consecutive successes occurred prior, denoted by J^(k). In addition, we study the distribution of the weighted average. The exact formulae of the probability mass function, mean, and variance of distributions are also obtained.

• Korean Journal of Remote Sensing
• /
• v.36 no.4
• /
• pp.503-513
• /
• 2020

This paper presents a method to evaluate denoising filters based on edge locations in their denoised images. Image quality assessment has often been performed by using structural similarity (SSIM). However, SSIM does not provide clearly the geometric accuracy of features in denoised images. Thus, in this paper, a method to localize edge locations with subpixel accuracy based on adaptive weighting of gradients is used for obtaining the subpixel locations of edges in ground truth image, noisy images, and denoised images. Then, this paper proposes a method to evaluate the geometric accuracy of edge locations based on root mean squares error (RMSE) and jaggedness with reference to ground truth locations. Jaggedness is a measure proposed in this study to measure the stability of the distribution of edge locations. Tested denoising filters are anisotropic diffusion (AF), bilateral filter, guided filter, weighted guided filter, weighted mean of patches filter, and smoothing filter (SF). SF is a simple filter that smooths images by applying a Gaussian blurring to a noisy image. Experiments were performed with a set of simulated images and natural images. The experimental results show that AF and SF recovered edge locations more accurately than the other tested filters in terms of SSIM, RMSE, and jaggedness and that SF produced better results than AF in terms of jaggedness.