EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 455

A linear assignment formulation of the multiattribute decision problem

Jean-Marie Blin (1976)

RAIRO - Operations Research - Recherche Opérationnelle

A linear programming based analysis of the CP-rank of completely positive matrices

Yingbo Li, Anton Kummert, Andreas Frommer (2004)

International Journal of Applied Mathematics and Computer Science

A real matrix A is said to be completely positive (CP) if it can be decomposed as A = BB^T, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Φ_k the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank...

A linearization of Connes' embedding problem.

Collins, Benoît, Dykema, Ken (2008)

The New York Journal of Mathematics [electronic only]

A local form for the automorphisms of the spectral unit ball.

Pascal J. Thomas (2008)

Collectanea Mathematica

A Local-Global Principle for Quadric Forms.

Alexander Prestel (1975)

Mathematische Zeitschrift

A lower bound sequence for the minimum eigenvalue of Hadamard product of an $M$ -matrix and its inverse

Wenlong Zeng, Jianzhou Liu (2022)

Czechoslovak Mathematical Journal

We propose a lower bound sequence for the minimum eigenvalue of Hadamard product of an $M$ -matrix and its inverse, in terms of an $S$ -type eigenvalues inclusion set and inequality scaling techniques. In addition, it is proved that the lower bound sequence converges. Several numerical experiments are given to demonstrate that the lower bound sequence is sharper than some existing ones in most cases.

A Markov approach to the generalized Syracuse algorithm

K. Matthews, A. Watts (1985)

Acta Arithmetica

A matrix constructive method for the analytic-numerical solution of coupled partial differential systems

Lucas Jódar, Enrique A. Navarro, M. V. Ferrer (1995)

Applications of Mathematics

In this paper we construct analytic-numerical solutions for initial-boundary value systems related to the equation $u_{t} - A u_{x x} - B u = 0$ , where $B$ is an arbitrary square complex matrix and $A$ ia s matrix such that the real part of the eigenvalues of the matrix $\frac{1}{2} (A + A^{H})$ is positive. Given an admissible error $ε$ and a finite domain $G$ , and analytic-numerical solution whose error is uniformly upper bounded by $ε$ in $G$ , is constructed.

A matrix derivation of a representation theorem for (tr Ap)1/p.

Heinz Neudecker (1989)

Qüestiió

A matrix derivation of a well-known representation theorem for (tr Ap)1/p is given, which is the solution of a restricted maximization problem. The paper further gives a solution of the corresponding restricted minimization problem.