dc-pyps functions related to HJC root search.
Find asymptotic root (det(W) = 0) in interval [s1, s2] using bisection method.
Parameters : | s1, s2 : float
tres : float
Q11 : array_like, shape (k1, k1) Q22 : array_like, shape (k2, k2) Q21 : array_like, shape (k2, k1) Q12 : array_like, shape (k1, k2)
k1, k2 : int
|
---|---|
Returns : | sout : float
|
Find, according to Frank Ball’s method, suitable starting guesses for each HJC root- the upper and lower limits for bisection. Exactly one root should be between those limits.
Parameters : | sa, sb : float
tres : float
Q11 : array_like, shape (k1, k1) Q22 : array_like, shape (k2, k2) Q21 : array_like, shape (k2, k1) Q12 : array_like, shape (k1, k2)
k1, k2 : int
|
---|---|
Returns : | sr : array_like, shape (k2, 2)
|
Find number of eigenvalues of H(s) that are equal to or less than s.
Parameters : | s : float
tres : float
Q11 : array_like, shape (k1, k1) Q22 : array_like, shape (k2, k2) Q21 : array_like, shape (k2, k1) Q12 : array_like, shape (k1, k2)
k1 : int
k2 : int
|
---|---|
Returns : | ng : int |
Split interval [sa, sb] into two subintervals, each of which contains at least one root.
Parameters : | sa, sb : float
nga, ngb : int
tres : float
Q11 : array_like, shape (k1, k1) Q22 : array_like, shape (k2, k2) Q21 : array_like, shape (k2, k1) Q12 : array_like, shape (k1, k2)
k1, k2 : int
|
---|---|
Returns : | sa1, sb1, sa2, sb2 : floats
nga1, ngb1, nga2, ngb2 : ints
|