We obtain necessary conditions for convergence of the Cauchy Picard sequence of iterations for Tricomi mappings defined on a uniformly convex linear complete metric space.
The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of n×n triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of n−1.
This paper is dealing with solvability of interval systems of linear equations in max-min algebra. Max-min algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and \kr, where a⊕b=max{a,b},a\krb=min{a,b}. The notation \mbfA\krx=\mbfb represents an interval system of linear equations, where \mbfA=[\pA,\nA] and \mbfb=[\pb,\nb] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 and T5 solvability and give necessary and sufficient conditions for them.