Results 1 to 10 of about 458,963 (267)
Partial Order in Matrix Nearrings [PDF]
Bulletin of the Iranian Mathematical Society, 2022 AbstractLet N be a zero-symmetric (right) nearring with identity. We introduce a partial order in the matrix nearring corresponding to the partial order (defined by Pilz in Near-rings: the theory and its applications, North Holland, Amsterdam, 1983) in N. A positive cone in a matrix nearring is defined and a characterization theorem is obtained.
Tapatee Sahoo +4 more
openaire +1 more source
Matrix-free preconditioning using partial matrix estimation [PDF]
BIT Numerical Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cullum, J. K., Tůma, M. (Miroslav)
openaire +3 more sources
, 2022 The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy can be drastically different over different entries.
Hazan, E +4 more
openaire +3 more sources
Non-commutative partial matrix convexity [PDF]
Indiana University Mathematics Journal, 2008 Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + ^T ,$ where $L$ has degree at most one in $x$ and $ $ is a (column) vector which is linear in $x,$ so that $ ^T $ is a both sum of squares ...
Hay, Damon M. +3 more
openaire +2 more sources
Partial Identifiability for Nonnegative Matrix Factorization
SIAM Journal on Matrix Analysis and Applications, 2023 27 pages, 8 figures, 7 examples. This third version makes minor modifications. Paper accepted in SIAM J.
Nicolas Gillis, Róbert Rajkó
openaire +2 more sources
New matrix partial order based on spectrally orthogonal matrix decomposition [PDF]
Linear and Multilinear Algebra, 2015 The research of the first author was supported by the Grants [grant number RFBR-15-01-01132], [grant number MD-962.2014.1]. The second and third authors have been partially supported by Ministerio de Economia y Competitividad from Spain, DGI [grant number MTM2013-43678-P].
Guterman, Alexander +2 more
openaire +2 more sources
Dynamic Matrix Rank with Partial Lookahead [PDF]
Theory of Computing Systems, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Partial Permutation and Alternating Sign Matrix Polytopes
SIAM Journal on Discrete Mathematics, 2022 We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial permutohedra that we show arise naturally as projections of these polytopes.
Heuer, Dylan, Striker, Jessica
openaire +3 more sources
Partial matrix contractions and intersections of matrix balls
Linear Algebra and its Applications, 1992 For a rectangular matrix \(C\), let \(s_ 1(C) \geq s_ 2(C) \geq \dots\) denote the singular values of \(C\), let \(\| C\| = s_ 1(C)\), and when \(\| C\| \leq 1\), define \(D_ C = \sqrt{I - C^* C}\). Fix \(n \times k\) \(A\) and \(p \times m\) \(B\) and let \(\mathcal M\) be the set of all \(X\) such that there exists \(Y\) for which \(\| \left[ {A\atop
Nævdal, Geir, Woerdeman, Hugo J.
openaire +2 more sources
Matrix partial-fraction expansion method
Electronics Letters, 1983 A method for partial-fraction expansion of m × p transfer functions H(s) is presented, and a general formula is given. The procedure does not require derivatives for the case of repeated roots and it is suitable for digital computer applications.
J. Leyva-Ramos, E.D. Denman
openaire +1 more source