scipy.linalg.lapack.dggev#
- scipy.linalg.lapack.dggev(a, b, compute_vl=1, compute_vr=1, lwork=..., overwrite_a=0, overwrite_b=0) = <flapack function dggev>#
Solve the generalized eigenproblem
a @ v = (alpha / beta) * b @ v(LAPACKdggev).- Parameters:
- andarray
Square matrix of shape
(n, n).- bndarray
Square matrix of shape
(n, n), the second member of the pair.- compute_vlint, optional
If nonzero, left eigenvectors are computed. Default is 1.
- compute_vrint, optional
If nonzero, right eigenvectors are computed. Default is 1.
- lworkint, optional
Size of the workspace. Default is
8 * n. Usethe value reported in work[0]for the optimal value.- overwrite_aint, optional
If nonzero, a may be overwritten in place. Default is 0.
- overwrite_bint, optional
If nonzero, b may be overwritten in place. Default is 0.
- Returns:
- alpharndarray
Real parts of the numerators of
alpha / beta.- alphaindarray
Imaginary parts of the numerators of
alpha / beta.- betandarray
Denominators; an eigenvalue is infinite where
betais zero.- vlndarray
Left eigenvectors, or a
(1, n)placeholder when compute_vl is 0.- vrndarray
Right eigenvectors, or a
(1, n)placeholder when compute_vr is 0.- workndarray
Workspace actually used;
work[0]is the optimal lwork.- infoint
0 on success; if negative, the
-info-th argument had an illegal value; if positive, the algorithm failed to converge.