Results 21 to 30 of about 1,579,149 (313)
The combinatorially symmetric P-matrix completion problem
The Electronic Journal of Linear Algebra, 1996 An \(n\times n\) real matrix is called a \(P\)-matrix if all its principal minors are positive. The \(P\)-matrix completion problem asks which partial \(P\)-matrices have a completion to a \(P\)-matrix. The authors prove that every partial \(P\)-matrix with combinatorially symmetric specified entries has a \(P\)-matrix completion.
Johnson, Charles R, Kroschel, Brenda K
openaire +5 more sources
P-Matrix Reasoning and Information Intelligent Mining
Applied Mathematics and Nonlinear Sciences, 2022 Abstract P-sets (P stand for Packet) and P-matrix are novel and effective mathematical tools for studying dynamic information systems. In this paper, the concept of P-information mining is given by using the dynamic characteristics of P-sets and P-matrix structure.
Xiuquan Zhang, Lin Shen
openaire +1 more source
P matrix properties, injectivity, and stability in chemical reaction systems [PDF]
, 2007 In this paper we examine matrices which arise naturally as Jacobians in chemical dynamics. We are particularly interested in when these Jacobians are P matrices (up to a sign change), ensuring certain bounds on their eigenvalues, precluding certain ...
Hadamard J. +3 more
core +1 more source
Perturbation Bounds of P-Matrix Linear Complementarity Problems [PDF]
SIAM Journal on Optimization, 2008 We define a new fundamental constant associated with a P-matrix and show that this constant has various useful properties for the P-matrix linear complementarity problems (LCP). In particular, this constant is sharper than the Mathias-Pang constant in deriving perturbation bounds for the P-matrix LCP.
Shuhuang Xiang, Xiaojun Chen
openaire +2 more sources
Generalized Drinfeld-Sokolov Reductions and KdV Type Hierarchies [PDF]
, 1992 Generalized Drinfeld-Sokolov (DS) hierarchies are constructed through local reductions of Hamiltonian flows generated by monodromy invariants on the dual of a loop algebra.
A.B. Zamolodchikov +39 more
core +3 more sources
Hyperon-Nucleon Final State Interaction in Kaon Photoproduction of the Deuteron [PDF]
, 2001 Final state hyperon-nucleon interaction in strangeness photoproduction of the deuteron is investigated making use of the covariant reaction formalism and the P-matrix approach to the YN system. Remarkably simple analytical expression for the amplitude is
A. M. Badalyan +17 more
core +2 more sources
P-matrix completions under weak symmetry assumptions
Linear Algebra and its Applications, 2000 An \(n\times n\) matrix is called a \(\Pi\)-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative \(P\)-matrix, (weakly) sign-symmetric, positive, nonnegative \(P_{0,1}\)-matrix, or Fischer, or Koteljanskii matrix. The paper deals with the \(\Pi\)-matrix completion problems, that is, when a partial \(\Pi\)-matrix has a \(\Pi\)-matrix ...
Juan R. Torregrosa +3 more
openaire +2 more sources
Journal of Advanced Joining Processes, 2022 Due to their positive properties, AMC materials represent a current trend in industrial applications and thus a major research focus. But currently their difficult machinability limits a full establishment.
M. Winkler +4 more
doaj +1 more source
The almost semimonotone matrices
Special Matrices, 2019 A (strictly) semimonotone matrix A ∈ ℝn×n is such that for every nonzero vector x ∈ ℝn with nonnegative entries, there is an index k such that xk > 0 and (Ax)k is nonnegative (positive).
Wendler Megan
doaj +1 more source
Dynamics of competitive systems with a single common limiting factor
Mathematical Biosciences and Engineering, 2014 The concept of limiting factors (or regulating factors) succeeded in formulating the well-known principle of competitive exclusion.This paper shows that the concept of limiting factors is helpful not only to formulate the competitive exclusion principle,
Ryusuke Kon
doaj +1 more source