bundles / scipy 1.17.1 / scipy / linalg / _decomp_qz / qz
function
scipy.linalg._decomp_qz:qz
source: /scipy/linalg/_decomp_qz.py :146
Signature
def qz ( A , B , output = real , lwork = None , sort = None , overwrite_a = False , overwrite_b = False , check_finite = True ) Summary
QZ decomposition for generalized eigenvalues of a pair of matrices.
Extended Summary
The QZ, or generalized Schur, decomposition for a pair of n-by-n matrices (A,B) is
(A,B) = (Q @ AA @ Z*, Q @ BB @ Z*)where AA, BB is in generalized Schur form if BB is upper-triangular with non-negative diagonal and AA is upper-triangular, or for real QZ decomposition (output='real') block upper triangular with 1x1 and 2x2 blocks. In this case, the 1x1 blocks correspond to real generalized eigenvalues and 2x2 blocks are 'standardized' by making the corresponding elements of BB have the form
[ a 0 ] [ 0 b ]
and the pair of corresponding 2x2 blocks in AA and BB will have a complex conjugate pair of generalized eigenvalues. If (output='complex') or A and B are complex matrices, Z' denotes the conjugate-transpose of Z. Q and Z are unitary matrices.
The documentation is written assuming array arguments are of specified "core" shapes. However, array argument(s) of this function may have additional "batch" dimensions prepended to the core shape. In this case, the array is treated as a batch of lower-dimensional slices; see linalg_batch for details. Note that calls with zero-size batches are unsupported and will raise a ValueError.
Parameters
A: (N, N) array_like2-D array to decompose
B: (N, N) array_like2-D array to decompose
output: {'real', 'complex'}, optionalConstruct the real or complex QZ decomposition for real matrices. Default is 'real'.
lwork: int, optionalWork array size. If None or -1, it is automatically computed.
sort: {None, callable, 'lhp', 'rhp', 'iuc', 'ouc'}, optionalNOTE: THIS INPUT IS DISABLED FOR NOW. Use ordqz instead.
Specifies whether the upper eigenvalues should be sorted. A callable may be passed that, given an eigenvalue, returns a boolean denoting whether the eigenvalue should be sorted to the top-left (True). For real matrix pairs, the sort function takes three real arguments (alphar, alphai, beta). The eigenvalue
x = (alphar + alphai*1j)/beta. For complex matrix pairs or output='complex', the sort function takes two complex arguments (alpha, beta). The eigenvaluex = (alpha/beta). Alternatively, string parameters may be used:'lhp' Left-hand plane (x.real < 0.0)
'rhp' Right-hand plane (x.real > 0.0)
'iuc' Inside the unit circle (x*x.conjugate() < 1.0)
'ouc' Outside the unit circle (x*x.conjugate() > 1.0)
Defaults to None (no sorting).
overwrite_a: bool, optionalWhether to overwrite data in a (may improve performance)
overwrite_b: bool, optionalWhether to overwrite data in b (may improve performance)
check_finite: bool, optionalIf true checks the elements of
AandBare finite numbers. If false does no checking and passes matrix through to underlying algorithm.
Returns
AA: (N, N) ndarrayGeneralized Schur form of A.
BB: (N, N) ndarrayGeneralized Schur form of B.
Q: (N, N) ndarrayThe left Schur vectors.
Z: (N, N) ndarrayThe right Schur vectors.
Notes
Q is transposed versus the equivalent function in Matlab.
Examples
import numpy as np from scipy.linalg import qz✓
A = np.array([[1, 2, -1], [5, 5, 5], [2, 4, -8]]) B = np.array([[1, 1, -3], [3, 1, -1], [5, 6, -2]])✓
AA, BB, Q, Z = qz(A, B)
✓AA BB Q Z✗
Q @ AA @ Z.T # Should be A Q @ BB @ Z.T # Should be B✓
AA, BB, Q, Z = qz(A, B, output='complex')
✓np.set_printoptions(precision=3, suppress=True)
✓AA BB Q Z✗
Q @ AA @ Z.conj().T # Should be A Q @ BB @ Z.conj().T # Should be B✗
See also
Aliases
-
scipy.linalg.qz