Auswahlverfahren bei linearer Limitierung (Q768403)

Recently K. Endl has considered summation methods which include Hausdorff processes as special case in which the matrix of transformation splits into \(k\) matrices each transforming a subsequence of the given sequence whose indices belong to a residue class modulo \(k\) into corresponding subsequence of the transformed sequence [Math. Z. 65, 113--132 (1956; Zbl 0070.06002)]. The author of the present paper pursues this idea. The set of non-negative integers is split up into any family (finite or infinite) of disjoint subsequences. To each subsequence of this family, a matrix process is chosen arbitrarily. These are used to build up another matrix which transforms any given sequence into another, the transforms of the subsequence corresponding to the indices in any given subsequence of integers in the family being the corresponding subsequence of the transformed sequence by the matrix built up. The new matrix could be expressed as the sum of matrices each of which is defined in terms of the corresponding matrix process chosen and these matrices are mutually orthogonal (that is, the product of any two is zero). The matrix process thus built up is regarded symbolically as the sum of the component processes. The author investigates the regularity, permutability and mutual consistency of such processes in terms of the corresponding property of the component process. The author gives an example to show that the whole process can be strictly stronger than the individual processes.