Displaying 1421 – 1440 of 3007

Showing per page

Moore-Penrose inverses of Gram operators on Hilbert C*-modules

M. S. Moslehian, K. Sharif, M. Forough, M. Chakoshi (2012)

Studia Mathematica

Let t be a regular operator between Hilbert C*-modules and t be its Moore-Penrose inverse. We investigate the Moore-Penrose invertibility of the Gram operator t*t. More precisely, we study some conditions ensuring that t = ( t * t ) t * = t * ( t t * ) and ( t * t ) = t t * . As an application, we get some results for densely defined closed operators on Hilbert C*-modules over C*-algebras of compact operators.

Multi-agent solver for non-negative matrix factorization based on optimization

Zhipeng Tu, Weijian Li (2021)

Kybernetika

This paper investigates a distributed solver for non-negative matrix factorization (NMF) over a multi-agent network. After reformulating the problem into the standard distributed optimization form, we design our distributed algorithm (DisNMF) based on the primal-dual method and in the form of multiplicative update rule. With the help of auxiliary functions, we provide monotonic convergence analysis. Furthermore, we show by computational complexity analysis and numerical examples that our distributed...

Multichannel deblurring of digital images

Michal Šorel, Filip Šroubek, Jan Flusser (2011)

Kybernetika

Blur is a common problem that limits the effective resolution of many imaging systems. In this article, we give a general overview of methods that can be used to reduce the blur. This includes the classical multi-channel deconvolution problems as well as challenging extensions to spatially varying blur. The proposed methods are formulated as energy minimization problems with specific regularization terms on images and blurs. Experiments on real data illustrate very good and stable performance of...

Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions

Siao Hong, Shuangnian Hu, Shaofang Hong (2016)

Open Mathematics

Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...

Multiplicative Cauchy functional equation and the equation of ratios on the Lorentz cone

Jacek Wesołowski (2007)

Studia Mathematica

It is proved that the solution of the multiplicative Cauchy functional equation on the Lorentz cone of dimension greater than two is a power function of the determinant. The equation is solved in full generality, i.e. no smoothness assumptions on the unknown function are imposed. Also the functional equation of ratios, of a similar nature, is solved in full generality.

Multiplicative maps that are close to an automorphism on algebras of linear transformations

L. W. Marcoux, H. Radjavi, A. R. Sourour (2013)

Studia Mathematica

Let be a complex, separable Hilbert space of finite or infinite dimension, and let ℬ() be the algebra of all bounded operators on . It is shown that if φ: ℬ() → ℬ() is a multiplicative map(not assumed linear) and if φ is sufficiently close to a linear automorphism of ℬ() in some uniform sense, then it is actually an automorphism; as such, there is an invertible operator S in ℬ() such that φ ( A ) = S - 1 A S for all A in ℬ(). When is finite-dimensional, similar results are obtained with the mere assumption that there...

Currently displaying 1421 – 1440 of 3007