Results 31 to 40 of about 6,368,085 (214)
Low rank approximation of the symmetric positive semidefinite matrix
Journal of Computational and Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuefeng Duan +3 more
openaire +3 more sources
MathematicsThis article proposes a novel robust invariance condition for uncertain linear discrete-time systems with state and control constraints, utilizing a method of semidefinite programming duality.
Hongli Yang +3 more
doaj +1 more source
Refined Upper Solution Bound of the Continuous Coupled Algebraic Riccati Equation
Complexity, 2020 The continuous coupled algebraic Riccati equation (CCARE) has wide applications in control theory and linear systems. In this paper, by a constructed positive semidefinite matrix, matrix inequalities, and matrix eigenvalue inequalities, we propose a new ...
Li Wang
doaj +1 more source
An elementary proof of Chollet’s permanent conjecture for 4 × 4 real matrices
Special Matrices, 2021 A proof of the statement per(A ∘ B) ≤ per(A)per(B) is given for 4 × 4 positive semidefinite real matrices. The proof uses only elementary linear algebra and a rather lengthy series of simple inequalities.
Hutchinson George
doaj +1 more source
Generalized Randić Estrada Indices of Graphs
Mathematics, 2022 Let G be a simple undirected graph on n vertices. V. Nikiforov studied hybrids of AG and DG and defined the matrix AαG for every real α∈[0,1] as AαG=αDG+(1−α)AG.
Eber Lenes +3 more
doaj +1 more source
On the Controllability of Matrix Pairs $(A,K)$ with K Positive Semidefinite [PDF]
SIAM Journal on Algebraic Discrete Methods, 1984 A well-known result of Chen and Wimmer is: If A, H and K are \(n\times n\) matrices such that H and K are Hermitian, K is positive semidefinite and \(K=AH+HA^*\) and if (A,K) is controllable, then A has no eigenvalues on the imaginary axis and H is nonsingular.
Carlson, David +2 more
openaire +2 more sources
Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix [PDF]
, 2017 We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters, the matrix is positive definite (or positive semidefinite).
openaire +2 more sources
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source
Maximization of the Spectral Gap for Chemical Graphs by means of a Solution to a Mixed Integer Semidefinite Program [PDF]
Computer Methods in Materials Science, 2016 In this paper we analyze the spectral gap of a weighted graph which is the difference between the smallest positive and largest negative eigenvalue of its adjacency matrix. Such a graph can represent e.g. a chemical organic molecule.
Soňa Pavlíková, Daniel Ševčovič
doaj +1 more source
Real factorization of positive semidefinite matrix polynomials
Linear Algebra and its ApplicationsSuppose $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