Results 101 to 110 of about 54,917 (203)
Real factorization of positive semidefinite matrix polynomials
Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and only if $\det(Q(x))$ is the square of a nonzero real polynomial.
Sarah Gift, Hugo J. Woerdeman
openaire +2 more sources
Data dissemination scheduling algorithm for V2R/V2V in multi-channel VANET
Considering that the data dissemination in multi-channel VANET (vehicular ad hoc network),a cooperative data dissemination scheduling algorithm was introduced for V2R(vehicle to roadside unit) and V2V(vehicle to vehicle).The algorithm created initial ...
Xin PENG +5 more
doaj +2 more sources
On the Solution of a Nonlinear Semidefinite Program Arising in Discrete-Time Feedback Control Design
A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem.
El-Sayed M. E. Mostafa
doaj +1 more source
Products of positive semidefinite matrices
The author proves that a matrix T is the product of finitely many nonnegative matrices if and only if det(T)\(\geq 0\) and in this case, five such matrices are sufficient.
openaire +1 more source
Advanced p-numerical radius bounds through partitioned matrix methodologies
The present investigation develops novel upper limits for the p-numerical radius of linear transformations through sophisticated partitioned matrix methodologies.
Raja’a Al-Naimi
doaj +1 more source
On polyhedral approximations of the positive semidefinite cone
Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 < \epsilon < 1$ and $A$
Fawzi, Hamza
core
Given matrices AA and BB of the same order, AA is called a section of BB if R(A)∩R(B−A)={0}{\mathscr{R}}\left(A)\cap {\mathscr{R}}\left(B-A)=\left\{0\right\} and R(AT)∩R((B−A)T)={0}{\mathscr{R}}\left({A}^{T})\cap {\mathscr{R}}\left({\left(B-A)}^{T ...
Eagambaram N.
doaj +1 more source
Tropicalizing the positive semidefinite cone
We study the tropicalization of the cone of positive semidefinite matrices over the ordered field of real Puiseux series. The tropical PSD matrices form the normal cone of the Newton polytope of the symmetric determinant at the vertex corresponding to the product of diagonal entries. We find generators and defining inequalities of the cone.
openaire +3 more sources
Positive Semidefinite Metric Learning with Boosting
The learning of appropriate distance metrics is a critical problem in image classification and retrieval. In this work, we propose a boosting-based technique, termed \BoostMetric, for learning a Mahalanobis distance metric.
Hengel, Anton van den +3 more
core
Functions Operating on Positive Semidefinite Quaternionic Matrices
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

