Results 11 to 20 of about 51 (51)
The Dittert′s function on a set of nonnegative matrices
International Journal of Mathematics and Mathematical Sciences, Volume 13, Issue 4, Page 709-716, 1990., 1990 Let Kn denote the set of all n × n nonnegative matrices with entry sum n. For X ∈ Kn with row sum vector (r1, …, rn), column sum vector (c1, …, cn), Let ϕ(X)=∏iri+∏jcj−perX. Dittert′s conjecture asserts that ϕ(X) ≤ 2 − n!/nn for all X ∈ Kn with equality iff X = [1/n]n×n. This paper investigates some properties of a certain subclass of Kn related to the
Suk Geun Hwang, Mun-Gu Sohn, Si-Ju Kim
wiley +1 more source
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
Open Mathematics, 2019 A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola ...
Hou Zhiwu, Jing Xia, Gao Lei
doaj +1 more source
BelgeoThis article explores the biographical mobility and residential trajectories of three individuals identifying as queer and living in a housing cooperative – which will be referred to as Tossal –located in the ruins of a former factory on the margins of ...
Hugo Soucaze
doaj +1 more source
A Numerical Algorithm For Stable 2d Autoregressive Filter Design
, 2003 Based on previous theoretical results we present in this paper a global estimation scheme for solving the stable 2D autoregressive filter problem. The di#erent algorithms are based on the traditional Newton method and on the log barrier method that is ...
Jeffrey S. Geronimo +3 more
core
Means of positive matrices [PDF]
Means of positive numbers are well-know but the theory of matrix means due to Kubo and Ando is less known. The lecture gives a short introduction to means, the emphasis is on matrices.
Petz, Dénes
core
, 2008 A sign pattern matrix is a matrix whose entries are from the set {+, −, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A.
Marina Arav +4 more
core
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
, 1997 . Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM).
Abdo Y. Alfakih, Henry Wolkowicz
core
ESTIMATING THE CONSUMPTION MATRIX FROM INEXACT DATA IN THE LEONTIEF MODEL
, 2008 . The Leontief model, originally developed for describing an economic system in terms of mutually interrelated and structurally conditioned simultaneous flows of commodities and services, has important applications to wide ranging disciplines.
Moody +4 more
core
Combinatorial aspects of generalized complementary basic matrices
Open Mathematics, 2013 Fiedler Miroslav, Hall Frank
doaj +1 more source
Some inequalities for generalized eigenvalues of perturbation problems on Hermitian matrices. [PDF]
J Inequal Appl, 2018 Hong Y, Lim D, Qi F.
europepmc +1 more source