نتایج جستجو برای: strong regularity algorithms
تعداد نتایج: 710824 فیلتر نتایج به سال:
In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...
in this article we study two different generalizations of von neumann regularity, namely strong topological regularity and weak regularity, in the banach algebra context. we show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. then we consider strong topological regularity of certain concrete algebras. moreover we obtain ...
Splitting schemes are a class of powerful algorithms that solve complicated monotone inclusion and convex optimization problems that are built from many simpler pieces. They give rise to algorithms in which the simple pieces of the decomposition are processed individually. This leads to easily implementable and highly parallelizable algorithms, which often obtain nearly state-of-the-art perform...
In this paper we give very sharp bounds for the distance between regularity and strong regularity. The solution of this problem uses a general matrix analogue [18] of the Perron-Frobenius Theory. This theory has been graded as a challenge problem for future research by the International Linear Algebra Society [7]. An interval matrix [A] ∈ IIMn(IR) is called regular, if every A ∈ [A] is nonsingu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید