Relaxed Steepest Descent and Cauchy-Barzilai-Borwein Method

The negative gradient direction to find local minimizers has been associated with the classical steepest descent method which behaves poorly except for very well conditioned problems. We stress out that the poor behavior of the steepest descent methods is due to the optimal Cauchy choice of steplength and not to the choice of the search direction. We discuss over and under relaxation of the optimal steplength. In fact, we study and extend recent nonmonotone choices of steplength that significantly enhance the behavior of the method. For a new particular case (Cauchy-Barzilai-Borwein method), we present a convergence analysis and encouraging numerical results to illustrate the advantages of using nonmonotone overrelaxations of the gradient method.     

On Pure Quotients and Pure Subobjects

In the theory of accessible categories, pure subobjects, i.e. filtered colimits of split monomorphisms, play an important role. Here we investigate pure quotients, i.e., filtered colimits of split epimorphisms. For example, in abelian, finitely accessible categories, these are precisely the cokernels of pure subobjects, and pure subobjects are precisely the kernels of pure quotients.     

有限交换群的Burnside环的增广理想的连续商群的结构

本文对有限交换群的Burnside环的增广理想的n次幂与n 1次幂之商进行了讨论,完整地给出了这类连续商群的结构.     

<Emphasis Type="Italic">w</Emphasis>*-Basic Sequences and Reflexivity of Banach Spaces

We observe that a separable Banach space X is reflexive iff each of its quotients with Schauder basis is reflexive. Similarly if ℒ(X, Y) is not reflexive for reflexive X and Y then ℒ(X ₁, Y) is is not reflexive for some X ₁ ⊂ X, X ₁ having a basis. This work was supported by the grants No. 201/03/0041 and No. 201/04/0090 of the Grant Agency of the Czech Republic and by the grant No. A1019801 of the Academy of Sciences of the Czech Republic.     

MODAL SYNTHESIS METHOD FOR NORM COMPUTATION OF H∞ DECENTRALIZED CONTROL SYSTEMS （II）

When using H∞ techniques to design decentralized controllers for large systems, the whole system is divided into subsystems, which are analysed using H∞ control theorybefore being recombined. An analogy was established with substructural analysis instructural mechanics, in which H∞ decentralized control theory corresponds to substructuralmodal synthesis theory so that the optimal H∞ norm of the whole system corresponds to thefundamental vibration frequency of the whole structure. Hence, modal synthesismethodology and the extended Wittrick-Williams algorithm were transplanted from structuralmechanics to compute the optimal H∞ norm of the control system. The orthogonality and theexpansion theorem of eigenfunctions of the subsystems H~ control are presented in part (I)of the paper. The modal synthesis method for computation of the optimal H∞ norm ofdecentralized control systems and numerical examples are presented in part (Ⅱ).     

On the Structure of the Augmentation Quotient Group for Some Non-abelian p-groups

In this paper,we study the basis of augmentation ideals and the quotient groups of finite non-abelian p-group which has a cyclic subgroup of index p,where p is an odd prime,and k is greater than or equal to 3.A concrete basis for the augmentation ideal is obtained and then the structure of its quotient groups can be determined.     

Mutation pairs and quotient categories of Abelian categories

The notion of 𝒟-mutation pairs of subcategories in an abelian category is defined in this article. When (𝒵,𝒵) is a 𝒟-mutation pair in an abelian category 𝒜, the quotient category 𝒵∕𝒟 carries naturally a triangulated structure. Moreover, our result generalize the construction of the quotient triangulated category by Happel [10 Happel, D. (1988). Triangulated Categories in the Representation of Finite Dimensional Algebras. London Mathematical Society, LMN, Vol. 119. Cambridge: Cambridge University Press.[Crossref] , [Google Scholar], Theorem 2.6]. Finally, we find a one-to-one correspondence between cotorsion pairs in 𝒜 and cotorsion pairs in the quotient category 𝒵∕𝒟, and study homological finiteness of subcategories in a mutation pair.     

Convergence of Nonstationary Iterative Methods for Solving Singular Linear Equations with Index One

In this paper, we investigate the nonstationary iterative scheme for solving consistent singular linear system with index one. We utilize the group inverse to present a sufficient condition for the convergence of the nonstationary iterative method. Our result extends the known results of the stationary iterative scheme. Finally, we present a sufficient condition for the multisplitting algorithm and provide numerical examples to illustrate the advantages of nonstationary method.     

QZ algorithm with two-sided generalized Rayleigh quotient shifts

We generalize the recently proposed two-sided Rayleigh quotient single-shift and the two-sided Grassmann–Rayleigh quotient double-shift used in the QR algorithm and apply the generalized versions to the QZ algorithm. With such shift strategies the QZ algorithm normally has a cubic local convergence rate. Our main focus is on the modified shift strategies and their corresponding truncated versions. Numerical examples are provided to demonstrate the convergence properties and the efficiency of the QZ algorithm equipped with the proposed shifts. For the truncated versions, local convergence analysis is not provided. Numerical examples show they outperform the modified shifts and the standard Rayleigh quotient single-shift and Francis double-shift.