Normal subgroups of classical groups over Banach algebras.
Some iterative methods of mathematical programming use a damping sequence {α} such that 0 ≤ α ≤ 1 for all t, α → 0 as t → ∞, and Σ α = ∞. For example, α = 1/(t+1) in Brown's method for solving matrix games. In this paper, for a model class of iterative methods, the convergence rate for any damping sequence {α} depending only on time t is computed. The computation is used to find the best damping sequence.
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A. We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction, we obtain...
We describe subgroups of GLA which are normalized by elementary matrices for rings A satisfying the first stable range condition, Banach algebras A, von Neumann regular rings A, and other rings A.
Page 1