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 2 Next

Displaying 21 – 40 of 125

Showing per page

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 new inclusion interval for the real eigenvalues of real matrices

Yinghua Wang, Xinnian Song, Lei Gao (2023)

Czechoslovak Mathematical Journal

By properties of Cvetković-Kostić-Varga-type (or, for short, CKV-type) B-matrices, a new class of nonsingular matrices called CKV-type B ¯ -matrices is given, and a new inclusion interval of the real eigenvalues of real matrices is presented. It is shown that the new inclusion interval is sharper than those provided by J. M. Peña (2003), and by H. B. Li et al. (2007). We also propose a direct algorithm for computing the new inclusion interval. Numerical examples are included to illustrate the effectiveness...

A new look at totally positive matrices

Miroslav Fiedler (2016)

Czechoslovak Mathematical Journal

A close relationship between the class of totally positive matrices and anti-Monge matrices is used for suggesting a new direction for investigating totally positive matrices. Some questions are posed and a partial answer in the case of Vandermonde-like matrices is given.

A new series of conjectures and open questions in optimization and matrix analysis

Jean-Baptiste Hiriart-Urruty (2009)

ESAIM: Control, Optimisation and Calculus of Variations

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review 49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

A new series of conjectures and open questions in optimization and matrix analysis

Jean-Baptiste Hiriart-Urruty (2008)

ESAIM: Control, Optimisation and Calculus of Variations

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

A note on certain ergodicity coeflcients

Francesco Tudisco (2015)

Special Matrices

We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem...

Currently displaying 21 – 40 of 125