Results 11 to 20 of about 1,604,213 (297)
Advanced Science, 2023 The regulation of inflammatory response at the site of injury and macrophage immunotherapy is critical for tissue repair. Chiral selfâassemblies are one of the most ubiquitous life cues, which is closely related to biological functions, life processes ...
Lei Yang +8 more
doaj +1 more source
Good hidden P-matrix sandwiches
Linear Algebra and its Applications, 2007 A real square matrix is called a \(P\)-matrix if all its principal minors are positive. The problem of recognizing when a matrix is a \(P\)-matrix is known to be co-NP-complete [see \textit{G. E. Coxson}, Math. Program. 64, 173--178 (1994; Zbl 0822.90132)] and so is expected to be hard.
Morris, Walter D., Namiki, Makoto
openaire +2 more sources
Photodynamic Pattern Memory Surfaces with Responsive Wrinkled and Fluorescent Patterns
Advanced Science, 2020 Reversible pattern systems, namely pattern memory surfaces, possessing tunable morphology play an important role in the development of smart materials; however, the construction of these surfaces is still extensively challenging because of complicated ...
Shuai Chen +5 more
doaj +1 more source
M-matrix and inverse M-matrix extensions
Special Matrices, 2020 A class of matrices that simultaneously generalizes the M-matrices and the inverse M-matrices is brought forward and its properties are reviewed. It is interesting to see how this class bridges the properties of the matrices it generalizes and provides a
McDonald J.J. +6 more
doaj +1 more source
Completions of P-matrix patterns
Linear Algebra and its Applications, 2000 A partially specified matrix is said to be a partial \(P\)-matrix if every fully specified principal submatrix is a \(P\)-matrix (i.e. a matrix such that all the determinants of its principal submatrices are positive. A pattern (a list of positions in the matrix) has a \(P\)-completion if every partial \(P\)-matrix specified by the pattern can be ...
DeAlba, Luz, Hogben, Leslie
openaire +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 ...
Fallat, Shaun M. +3 more
openaire +1 more source
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 +4 more sources
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.
Xiaojun Chen, Shuhuang Xiang
openaire +1 more source
The (weakly) sign symmetric P-matrix completion problems
The Electronic Journal of Linear Algebra, 2003 The completion problem is studied for some sub-classes of the class of \(P\)-matrices. A {completion} of a partial matrix (i.e. a matrix with some unspecified entries) is a specific choice of values for the unspecified entries. A {pattern} for \(n\times n\) matrices is a subset of \(\mathcal{N}\times\mathcal{N}\) where \(\mathcal{N}=\{1,\dots,n\}\).
DeAlba, Luz +3 more
openaire +4 more sources
On matrices whose exponential is a P-matrix
, 2021 A matrix is called a P-matrix if all its principal minors are positive. P-matrices have found important applications in functional analysis, mathematical programming, and dynamical systems theory. We introduce a new class of real matrices denoted~$\EP$. A matrix is in~$\EP$ if and only if its matrix exponential is a P-matrix for all positive times.
Wu, Chengshuai, Margaliot, Michael
openaire +2 more sources