Results 101 to 110 of about 41,274 (203)
Journal of MathematicsData completion techniques offer numerous advantages in various fields. However, completing large datasets that must satisfy specific criteria can be challenging, necessitating the use of approximative completion methods.
Hajar A. Alshaikh +2 more
doaj +1 more source
Operational Choices for Risk Aggregation in Insurance: PSDization and SCR Sensitivity
Risks, 2018 This work addresses crucial questions about the robustness of the PSDization process for applications in insurance. PSDization refers to the process that forces a matrix to become positive semidefinite.
Xavier Milhaud +2 more
doaj +1 more source
Positive Semidefinite Metric Learning with Boosting
, 2009 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
Weighted Algebraic Connectivity Maximization for Optical Satellite Networks
IEEE Access, 2017 In this paper, the topology configuration methods for heterogeneous optical satellite networks are investigated. Our objectives are to maximize weighted algebraic connectivity with respect to both network initialization and reconfiguration scenarios ...
Yongxing Zheng +5 more
doaj +1 more source
Some inequalities for unitarily invariant norms of matrices
Journal of Inequalities and Applications, 2011 This article aims to discuss inequalities involving unitarily invariant norms. We obtain a refinement of the inequality shown by Zhan. Meanwhile, we give an improvement of the inequality presented by Bhatia and Kittaneh for the Hilbert-Schmidt norm ...
Wang Shaoheng, Zou Limin, Jiang Youyi
doaj
A Generalized HSS Iteration Method for Continuous Sylvester Equations
Journal of Applied Mathematics, 2014 Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a generalized HSS (GHSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semidefinite matrices ...
Xu Li +3 more
doaj +1 more source
Semidefinite code bounds based on quadruple distances
, 2010 Let $A(n,d)$ be the maximum number of $0,1$ words of length $n$, any two having Hamming distance at least $d$. We prove $A(20,8)=256$, which implies that the quadruply shortened Golay code is optimal.
Gijswijt, Dion C. +2 more
core +2 more sources
On permanents of positive semidefinite matrices
Linear Algebra and its Applications, 1985 Let A and B be positive semidefinite real symmetric matrices. Using properties of tensor products, \textit{T. Ando} [Hokkaido Math. J. 10, Special Issue, 10, No.1, 18-36 (1981; Zbl 0484.15006)] proved that \(per(A+B)\geq per A+per B\). In this paper, it is shown that the Binet- Cauchy formula for the permanent of a product of matrices can also be used ...
openaire +1 more source
Enhanced Young-type inequalities utilizing Kantorovich approach for semidefinite matrices
Open MathematicsThis article introduces new Young-type inequalities, leveraging the Kantorovich constant, by refining the original inequality. In addition, we present a range of norm-based inequalities applicable to positive semidefinite matrices, such as the Hilbert ...
Bani-Ahmad Feras +1 more
doaj +1 more source
Singular value inequalities for matrices related to convex and concave functions
Journal of Inequalities and ApplicationsIn this note, we give several singular value inequalities involving convex and concave functions, which can be considered as generalizations of Al-Natoor et al.’s results (J. Math. Inequal. 17:581–589, 2023).
Shengyan Ma, Lihong Hu, Xiaohui Fu
doaj +1 more source