Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"positive (semi)definite matrix"”.
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
… that are fairly general. We have shown for a positive semi-definite matrix M, that the algorithm is globally convergent and has very good convergence properties. For some instances of the eligible kernel functions, the complexity of the algorithm, in terms of the number of iterations, …
-
ON THE LYAPUNOV-TYPE DIAGONAL STABILITY
… of the index set {1,...,n}. This type of matrix stability plays an important role in various applied areas such as population dynamics, systems theory and complex networks. We first examine a result of Redheffer that reduces Lyapunov diagonal stability of a matrix to common diagonal …
-
Response surface designs for the detection of model inadequacy
… parameter λ = σ⁻² β₂’ L β₂, where the positive semi-definite matrix L is determined by the experimental design. We use λ as a measure of a design's ability to detect the higher-order parameters, β₂. This investigation has concentrated on the development and evaluation of criteria for …