Martin R. Weber
Dresden University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Martin R. Weber.
Positivity | 2016
Marat Pliev; Martin R. Weber
Projections onto several special subsets in the Dedekind complete vector lattice of orthogonally additive, order bounded (called abstract Uryson) operators between two vector lattices E and F are considered and some new formulas are provided.
Analysis Mathematica | 1995
Martin R. Weber
AbstractДоказывается, что в ар химедовой векторной структуреX для того, чтобы каждый финитный элем ент являлся также тот ально финитным, достаточно, чтобы топология в подпрост ранствеMΦ пространст ва всех максимальныхl-идеало вM векторной структурыX обладала тем свойст вом, что замыкание (вM) счетно го объединения базисны х множеств лежитвMΦ.
Archive | 2014
Martin R. Weber
This book is the first systematical treatment of the theory of finite elements in Archimedean vector lattices and contains the results known on this topic up to the year 2013. It joins all important contributions achieved by a series of mathematicians that can only be found in scattered in literature.
Linear Algebra and its Applications | 1995
C. Türke; Martin R. Weber
Abstract Let γ = (γ1, …, γn) be a given vector with positive coordinates. A matrix A is said to satisfy the γ-maximum principle (γMP) if Ax = y, y ≥ 0 imply x ≥ 0 and max 1≤i≤n γ i χ i = max i ∈ N = (y) γ i χ i where N+) (y) is the set of indices such that y is positive. For an invertible matrix A with positive inverse the γMP is characterized geometrically by means of the behavior under A−1 of convex boundary parts of the simplex generated in ( R n+ by permissible multiples of the unit coordinate vectors. Some sufficient conditions and applications to M-matrices are given.
Linear Algebra and its Applications | 1998
H. Pühl; W. Schirotzek; Martin R. Weber
Abstract A matrix equation A x = y is considered in the space R n that is ordered by a cone K. In case K = R n + it is known that a matrix A is said to satisfy the maximum principle if A is invertible and for each y ∈ R n + ⧹ {0} the solution x belongs to R n+ and is such that xi = max1 ⩽ k ⩽ nxk and yi > 0 for some i. This concept is generalized to finitely generated and to circular cones K ⊂ R n . This is achieved by “evaluating” x and y with the aid of elements of a given base for the polar cone K∘ of K. The maximum principle is characterized geometrically by means of the behavior under A−1 of convex boundary parts of a base for K. A weighted maximum principle is investigated and an infinite dimensional example is indicated.
Positivity | 2018
Marat Pliev; Martin R. Weber
We study the collection of finite elements
Positivity | 2013
Helena Malinowski; Martin R. Weber
Mathematische Nachrichten | 2006
Zi Li Chen; Martin R. Weber
\Phi _{1}\big ({\mathcal {U}}(E,F)\big )
Mathematische Nachrichten | 1993
Martin R. Weber
Archive | 2013
K. C. Sivakumar; Martin R. Weber
Φ1(U(E,F)) in the vector lattice