A method due to Fay and Walls for associating a factorization system with a radical is examined for associative rings. It is shown that a factorization system results if and only if the radical is strict and supernilpotent. For groups and non-associative rings, no radical defines a factorization system.

The output behavior of a nonlinear control system depends not only on its input but also on its initial conditions. These two factors have to be considered simultaneously in nonlinear systems design. This paper presents a new definition, called dynamic right factorization, for nonlinear dynamic control systems. This factorization takes the initial conditions as well as the system input into acc...

Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not coobrantly generated. We also present a weak factorization system on the category of posets which is not coobrantly generated. No s...

We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...

we used qcd factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios br ( ?j/?k) and br ( ?j/??), can be accounted for this approach. we analyzed the decay within the framework of qcd factorization. we have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. we calculated this decays in a special scale ( ...

The importance of the prime factorization problem is very well known (e.g., many security protocols are based on the impossibility of a fast factorization of integers on traditional computers). It is necessary from a number k to establish two primes a and b giving k = a · b. Usually, k is written in a positional numeral system. However, there exists a variety of numeral systems that can be used...

A well-known result from linear system theory states that the minimal inner size of a factorization of the Hankel matrix H of a system gives the minimal order of a realization. In this brief it is shown that when dealing with positive linear systems, the existence of a factorization of the Hankel matrix into two nonnegative matrices is only a necessary condition for the existence of a positive ...

we prove that the class of profinite groups $g$ that have a factorization $g=ab$ with $a$ and $b$ abelian closed subgroups, is closed under taking strict projective limits. this is a generalization of a recent result by k.h.~hofmann and f.g.~russo. as an application we reprove their generalization of iwasawa's structure theorem for quasihamiltonian pro-$p$ groups.