Results 21 to 30 of about 5,394,718 (279)
A New Slack Lyapunov Functional for Dynamical System with Time Delay
The traditional method of constructing a Lyapunov functional for dynamical systems with time delay is usually dependent on positive definite matrices in the quadratic form.
Can Zhao +3 more
doaj +1 more source
Geometrical Inverse Preconditioning for Symmetric Positive Definite Matrices
We focus on inverse preconditioners based on minimizing F ( X ) = 1 − cos ( X A , I ) , where X A is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F ( X )
Jean-Paul Chehab, Marcos Raydan
doaj +1 more source
In this paper we prove among others that, if the positive definite matrices A, B of order n satisfy the condition 0 < mIn ≤ B − A ≤ M In, for some constants 0 < m < M, where In is the identity matrix, then0 ≤ (1 − t) [det (A)]−1 + t [det (A + mIn)]−1 − [
Silvestru Sever Dragomir
doaj
In this paper, two separately methods were suggested for coding information .The first method was introduced using the directness of symmetric matrices .The contraction function was used for introducing the second method .For more complexity the ...
Adel Mohammad Hassan Rizak Al-Rammahi
doaj +1 more source
In this paper we prove among others that, if (Aj)j=1,...,m are positive definite matrices of order n ≥ 2 and qj ≥ 0, j = 1, ..., m with ∑j=1mqj=1$$\sum\nolimits_{j = 1}^m {{q_j} = 1} $$, then 0≤11−mini∈{1,…,m}{qi}×[∑i=1mqi(1−qi)[det(Ai)]−1−2n+1∑1 ...
Dragomir Silvestru Sever
doaj +1 more source
Dimensionality Reduction of SPD Data Based on Riemannian Manifold Tangent Spaces and Isometry
Symmetric positive definite (SPD) data have become a hot topic in machine learning. Instead of a linear Euclidean space, SPD data generally lie on a nonlinear Riemannian manifold.
Wenxu Gao +3 more
doaj +1 more source
Positive definite completions of partial Hermitian matrices [PDF]
The question of which partial Hermitian matrices (some entries specified, some free) may be completed to positive definite matrices is addressed. It is shown that if the diagonal entries are specified and principal minors, composed of specified entries ...
Eduardo M. Sá +7 more
core +1 more source
Adapting the interior point method for the solution of LPs on serial, coarse grain parallel and massively parallel computers [PDF]
In this paper we describe a unified scheme for implementing an interior point algorithm (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton's method.
Levkovitz, R +3 more
core +6 more sources
On the cardinality of complex matrix scalings
We disprove a conjecture made by Rajesh Pereira and Joanna Boneng regarding the upper bound on the number of doubly quasi-stochastic scalings of an n × n positive definite matrix.
Hutchinson George
doaj +1 more source
The Preconditioned SOR Iterative Method for Positive Definite Matrices
We present several iterations for preconditioners introduced by Tarazaga and Cuellar (2009), and study the convergence of the method for solving a linear system whose coefficient matrix is positive definite matrices, and we also find that they complete ...
Yu-Qin Bai, Yan-Ping Xiao, Wei-Yuan Ma
doaj +1 more source

