Results 11 to 20 of about 28,541,050 (306)
The combinatorially symmetric P-matrix completion problem [PDF]
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
Completions of P-matrix patterns [PDF]
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 +3 more sources
The (weakly) sign symmetric P-matrix completion problems [PDF]
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 +5 more sources
P-matrix recognition is co-NP-complete
CoRR, 2007 This is a summary of the proof by G.E. Coxson that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn.
Jan Foniok (23876049)
openaire +5 more sources
Rigorous P-matrix for uniform NSPUDT
Archives of Acoustics, 2014 A rigorous scattering matrix in mixed representation (P-Matrix) is presented for natural single-phase unidirectional transducer (NSPUDT) of surface acoustic wave (SAW).
E. DANICKI
doaj +1 more source
M-MATRIX-WP6.M1 - "DASHBOARDS OPERATIONAL WITHIN THE PILOT PARTICIPATING AGENCIES"
, 2022 M-MATRIX-WP6.M1 - “Dashboards operational within the pilot participating agencies” Milestone report for M1 of MATRIX ...
MATRIX
core +1 more source
RenevanWesten/Matrix-DO: Matrix-DO
, 2022 <p>The Python Matrix-DO software.</p><p>This software is part of the European Union's Horizon 2020 research and innovation program for the ITN TiPES under Grant Agreement Number 643073.</p ...
RenevanWesten
core +1 more source
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
Grewia polysaccharide as a pharmaceutical excipient in matrix tablets [PDF]
, 2011 Matrix-based tablets using different concentrations of grewia gum, and the model drug ibuprofen, were prepared using a wet granulation technique. Similar formulations were also prepared using HPMC, guar gum or ethyl cellulose as the polymer matrix.
Conway, Barbara R +6 more
core +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 0001, Shuhuang Xiang
openaire +2 more sources