A Unified Approach to Methods for the Simultaneous Computation of All Zeros of Generalized Polynomials.
Parallel Nonlinear Multisplitting Methods.
Parallel Interval Multisplittings.
H-Splittings and two-stage iterative methods.
A linear programming based analysis of the CP-rank of completely positive matrices
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...
Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices.
Asynchronous weighted additive Schwarz methods.
On the existence theorems of Kantorovich, Miranda and Borsuk.
Page 1