نتایج جستجو برای: Miranda-Thompson majorization
تعداد نتایج: 10394 فیلتر نتایج به سال:
Miranda-Thompson majorization is a group-induced cone ordering on $mathbb{R}^{n}$ induced by the group of generalized permutation with determinants equal to 1. In this paper, we generalize Miranda-Thompson majorization on the matrices. For $X$, $Yin M_{m,n}$, $X$ is said to be Miranda-Thompson majorized by $Y$ (denoted by $Xprec_{mt}Y$) if there exists some $Din rm{Conv(G)}$ s...
This paper describes our experience in formalising arguments about the Miranda functional programming language in Isabelle. After explaining some of the problems of reasoning about Miranda, we explain our two different approaches to encoding Miranda in Isabelle. We conclude by discussing some shorter examples and a case study of reasoning about hardware. Miranda1[Turner, 1990, Thompson, 1995b] ...
The resemblance between the Horn-Thompson theorem and a recent theorem by Dacorogna-Marcellini-Tanteri indicates that Schur convexity and the majorization relation are relevant for applications in the calculus of variations and its related notions of convexity, such as rank-one convexity or quasiconvexity. We give in theorem 6.6 simple necessary and sufficient conditions for an isotropic object...
In this paper we give some useful combinatorial properties of polynomial paths. We also introduce generalized majorization between three sequences of integers and explore its combinatorics. In addition, we give a new, simple, purely polynomial proof of the convexity lemma of E. M. de Sá and R. C. Thompson. All these results have applications in matrix completion theory.
Ueli C Müller ([email protected]) Philip Asherson ([email protected]) Tobias Banaschewski ([email protected]) Jan Buitelaar ([email protected]) Richard Epstein ([email protected]) Jaques Eisenberg ([email protected]) Michael Gill ([email protected]) Iris Manor ([email protected]) Ana Miranda ([email protected]) Robert D Oades (robert.oades@uni-due...
Let F and Fm be the usual spaces of n-dimensional column and m-dimensional row vectors on F, respectively, where F is the field of real or complex numbers. In this paper, the relations gsmajorization, lgw-majorization, and rgw-majorization are considered on F and Fm. Then linear maps T : F → F preserving lgw-majorization or gs-majorization and linear maps S : Fn → Fm, preserving rgw-majorizatio...
There are important connections between majorization and convex polyhedra. Both weak majorization and majorization are preorders related to certain simple convex cones. We investigate the facial structure of a polyhedral cone C associated with a layered directed graph. A generalization of weak majorization based on C is introduced. It de nes a preorder of matrices. An application in statistical...
For many least-squares decomposition models efficient algorithms are well known. A more difficult problem arises in decomposition models where each residual is weighted by a nonnegative value. A special case is principal components analysis with missing data. Kiers (1997) discusses an algorithm for minimizing weighted decomposition models by iterative majorization. In this paper, we propose a m...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید