Sentence examples for bounds of the minimum from inspiring English sources

Several convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of an M-matrix and an inverse M-matrix are given.

Some new convergent sequences of the lower bounds of the minimum eigenvalue (tau Bcirc A^{-1})) for the Hadamard product of B and (A^{-1}) are given.

In this paper, we present some new lower bounds of the minimum eigenvalue q ( A ∘ B − 1 ) for the Hadamard product of M-matrices, which improve (1.1), (1.2) and (1.3) and generalize the corresponding result of Xiang [6].

In this paper, we continue to research the problems mentioned above and give some convergent sequences for the lower bounds of the minimum eigenvalue of M-matrices which improve (1 - 6).

A number of bounds on the minimum distance of the corresponding codes for special selections of parameters are obtained by mathematical analysis.

We address a variation of this problem that considers certain constraints on each bus route, such as bounds on the distances traveled by the students, bounds on the number of visited bus stops, and bounds on the minimum number of students that a vehicle has to pick up.

We present lower and upper bounds on the minimum number of reticulation events in the minimum reticulate network (and infer an approximately parsimonious reticulate network).

We provide bounds on the minimum possible error of any unbiased photoclinometric surface slope estimate, and compute the sample sizes necessary to constrain errors within desired design thresholds.

In the paper, some new upper bounds for the spectral radius of the Hadamard product of nonnegative matrices, and the low bounds for the minimum eigenvalue of the Fan product of nonsingular M-matrices are given.

Several convergent sequences of the lower bounds for the minimum eigenvalue of M-matrices are given.

We start with the following lemma, which gives an upper bound of the minimum transmit power, given in Equation (6).