Results 101 to 110 of about 49,656 (213)

Computing the Entropy of a Large Matrix

, 2014
Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an efficient way.
Bessire, Bänz, Stefanov, André, Wihler, Thomas P.   +2 more
core   +1 more source

Uniqueness of size-2 positive semidefinite matrix factorizations

We characterize when a size-2 positive semidefinite (psd) factorization of a positive matrix of rank 3 and psd rank 2 is unique. The characterization is obtained using tools from rigidity theory. In the first step, we define s-infinitesimally rigid psd factorizations and characterize 1- and 2-infinitesimally rigid size-2 psd factorizations.
Dawson, Kristen, Hoşten, Serkan, Kubjas, Kaie, Metsälampi, Lilja   +3 more
openaire   +2 more sources

Definition and Computation of Tensor‐Based Generalized Function Composition

Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.
ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
wiley   +1 more source

Interpolation unitarily invariant norms inequalities for matrices with applications

AIMS Mathematics
Let $ A_j, B_j, P_j $, and $ Q_j \in M_{n}(\mathbb{C}) $, where $ j = 1, 2, \dots, m $. For a real number $ c \in [0, 1] $, we prove the following interpolation inequality: $ \begin{equation*} {\left\vert\kern-0.1ex\left\vert\kern-0.1ex\left\vert {\
Mohammad Al-Khlyleh, Mohammad Abdel Aal, Mohammad F. M. Naser   +2 more
doaj   +1 more source

Proximal Alternating Direction Method with Relaxed Proximal Parameters for the Least Squares Covariance Adjustment Problem

Abstract and Applied Analysis, 2014
We consider the problem of seeking a symmetric positive semidefinite matrix in a closed convex set to approximate a given matrix. This problem may arise in several areas of numerical linear algebra or come from finance industry or statistics and thus has
Minghua Xu, Yong Zhang, Qinglong Huang, Zhenhua Yang   +3 more
doaj   +1 more source

Analyzing the Free States of one Quantum Resource Theory as Resource States of Another

Advanced Quantum Technologies, Volume 9, Issue 2, February 2026.
The article investigates how free states in one quantum resource theory can become highly resourceful in another. It systematically studies multipartite entanglement, fermionic non‐Gaussianity, imaginarity, realness, spin coherence, Clifford non‐stabilizerness, Sn‐equivariance, and non‐uniform entanglement, combining rigorous analytical tools and ...
Andrew E. Deneris, Paolo Braccia, Pablo Bermejo, N. L. Diaz, Antonio A. Mele, M. Cerezo   +5 more
wiley   +1 more source

Advanced p-numerical radius bounds through partitioned matrix methodologies

Results in Applied Mathematics
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

A new approach for handling missing correlation values for meta‐analytic structural equation modeling: Corboundary R package

Campbell Systematic Reviews, 2020
With increased use of multivariate meta‐analysis in numerous disciplines, where structural relationships among multiple variables are examined, researchers often encounter a particular challenge due to missing information.
Soyeon Ahn, John M. Abbamonte
doaj   +1 more source

Semidefinite geometry of the numerical range

, 2008
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI), an affine ...
Henrion, Didier
core   +1 more source

Multi‐Objective Robust Controller Synthesis With Integral Quadratic Constraints in Discrete‐Time

International Journal of Robust and Nonlinear Control, Volume 36, Issue 3, Page 935-954, February 2026.
ABSTRACT This article presents a novel framework for the robust controller synthesis problem in discrete‐time systems using dynamic Integral Quadratic Constraints (IQCs). We present an algorithm to minimize closed‐loop performance measures such as the ℋ∞$$ {\mathscr{H}}_{\infty } $$‐norm, the energy‐to‐peak gain, the peak‐to‐peak gain, or a ...
Lukas Schwenkel, Johannes Köhler, Matthias A. Müller, Carsten W. Scherer, Frank Allgöwer   +4 more
wiley   +1 more source