o
    ?Hh#                     @   sX   d dl mZ d dlZd dlmZ d dlmZmZ ddl	m
Z
mZ dgZ			dd
dZdS )    )IterableN)_asarray_validated)
block_diagLinAlgError   )_compute_lworkget_lapack_funcscossinFTc           -      C   s   |s|r|du r
dnt |}|du rdnt |}t| dd} tj| j s,td| j | jd }||ks9|dkrGtd| d| jd  d	||ksO|dkr]td
| d| jd  d	| d|d|f | d||df | |dd|f | |d|df f\}}	}
}nt| tstdt| dkrtdt|  dd | D \}}	}
}t	g d||	|
|gD ]\}}|jd dkrt| dq|j\}}|j\}}|	j||fkrtd||f d|	j |
j||fkrtd||f d|
j || || krtd||  d||  d|| }t
dd ||	|
|fD }|r)dnd}t||d g||	|
|g\}}t||||d}|rN|d |d dnd |i}|d(||	|
|||||d!|d"
|^ }}}}}}}|j| }|dk rtd#|  d$| |dkrt| d%| |r||f|||ffS t||}t||}tt|} tt|}!t|||| || }"t|||" }#t||| |" }$t|| ||" }%t|| || |" }&tjt|#|$|%|&|"g|jd&}'tj||f|jd&}(|'d|#d|#f |(d|#d|#f< |#|" })|#|" |$ }*|#|% |& d'|"  }+|#|% |& d'|"  |$ },|r=|'d|$d|$f n
|'d|$d|$f  |(|)|*|+|,f< ||& |" })||& |" |%
  }*|#|" }+|#|" |% },|rw|'d|%d|%f  n	|'d|%d|%f |(|)|*|+|,f< |'d|&d|&f |(|||& |||& f< | |(|#|#|" |#|#|" f< | |(||& ||& |" |#|" |% |& d'|" |# |% |& f< |#})|#|" }*|#|% |& |" }+|#|% |& d'|"  },|r|!n|! |(|)|*|+|,f< |r|! n|!|(||& ||& |" |#|#|" f< ||(|fS ))u  
    Compute the cosine-sine (CS) decomposition of an orthogonal/unitary matrix.

    X is an ``(m, m)`` orthogonal/unitary matrix, partitioned as the following
    where upper left block has the shape of ``(p, q)``::

                                   ┌                   ┐
                                   │ I  0  0 │ 0  0  0 │
        ┌           ┐   ┌         ┐│ 0  C  0 │ 0 -S  0 │┌         ┐*
        │ X11 │ X12 │   │ U1 │    ││ 0  0  0 │ 0  0 -I ││ V1 │    │
        │ ────┼──── │ = │────┼────││─────────┼─────────││────┼────│
        │ X21 │ X22 │   │    │ U2 ││ 0  0  0 │ I  0  0 ││    │ V2 │
        └           ┘   └         ┘│ 0  S  0 │ 0  C  0 │└         ┘
                                   │ 0  0  I │ 0  0  0 │
                                   └                   ┘

    ``U1``, ``U2``, ``V1``, ``V2`` are square orthogonal/unitary matrices of
    dimensions ``(p,p)``, ``(m-p,m-p)``, ``(q,q)``, and ``(m-q,m-q)``
    respectively, and ``C`` and ``S`` are ``(r, r)`` nonnegative diagonal
    matrices satisfying ``C^2 + S^2 = I`` where ``r = min(p, m-p, q, m-q)``.

    Moreover, the rank of the identity matrices are ``min(p, q) - r``,
    ``min(p, m - q) - r``, ``min(m - p, q) - r``, and ``min(m - p, m - q) - r``
    respectively.

    X can be supplied either by itself and block specifications p, q or its
    subblocks in an iterable from which the shapes would be derived. See the
    examples below.

    Parameters
    ----------
    X : array_like, iterable
        complex unitary or real orthogonal matrix to be decomposed, or iterable
        of subblocks ``X11``, ``X12``, ``X21``, ``X22``, when ``p``, ``q`` are
        omitted.
    p : int, optional
        Number of rows of the upper left block ``X11``, used only when X is
        given as an array.
    q : int, optional
        Number of columns of the upper left block ``X11``, used only when X is
        given as an array.
    separate : bool, optional
        if ``True``, the low level components are returned instead of the
        matrix factors, i.e. ``(u1,u2)``, ``theta``, ``(v1h,v2h)`` instead of
        ``u``, ``cs``, ``vh``.
    swap_sign : bool, optional
        if ``True``, the ``-S``, ``-I`` block will be the bottom left,
        otherwise (by default) they will be in the upper right block.
    compute_u : bool, optional
        if ``False``, ``u`` won't be computed and an empty array is returned.
    compute_vh : bool, optional
        if ``False``, ``vh`` won't be computed and an empty array is returned.

    Returns
    -------
    u : ndarray
        When ``compute_u=True``, contains the block diagonal orthogonal/unitary
        matrix consisting of the blocks ``U1`` (``p`` x ``p``) and ``U2``
        (``m-p`` x ``m-p``) orthogonal/unitary matrices. If ``separate=True``,
        this contains the tuple of ``(U1, U2)``.
    cs : ndarray
        The cosine-sine factor with the structure described above.
         If ``separate=True``, this contains the ``theta`` array containing the
         angles in radians.
    vh : ndarray
        When ``compute_vh=True`, contains the block diagonal orthogonal/unitary
        matrix consisting of the blocks ``V1H`` (``q`` x ``q``) and ``V2H``
        (``m-q`` x ``m-q``) orthogonal/unitary matrices. If ``separate=True``,
        this contains the tuple of ``(V1H, V2H)``.

    References
    ----------
    .. [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
           Algorithms, 50(1):33-65, 2009.

    Examples
    --------
    >>> import numpy as np
    >>> from scipy.linalg import cossin
    >>> from scipy.stats import unitary_group
    >>> x = unitary_group.rvs(4)
    >>> u, cs, vdh = cossin(x, p=2, q=2)
    >>> np.allclose(x, u @ cs @ vdh)
    True

    Same can be entered via subblocks without the need of ``p`` and ``q``. Also
    let's skip the computation of ``u``

    >>> ue, cs, vdh = cossin((x[:2, :2], x[:2, 2:], x[2:, :2], x[2:, 2:]),
    ...                      compute_u=False)
    >>> print(ue)
    []
    >>> np.allclose(x, u @ cs @ vdh)
    True

    Nr   T)check_finitez=Cosine Sine decomposition only supports square matrices, got r   z
invalid p=z, 0<p<z
 must holdz
invalid q=z, 0<q<zJWhen p and q are None, X must be an Iterable containing the subblocks of X   z?When p and q are None, exactly four arrays should be in X, got c                 s   s    | ]}t |V  qd S )N)np
atleast_2d.0x r   [/home/air/sanwanet/gpt-api/venv/lib/python3.10/site-packages/scipy/linalg/_decomp_cossin.py	<genexpr>   s    zcossin.<locals>.<genexpr>)x11x12x21x22z can't be emptyz Invalid x12 dimensions: desired z, got z Invalid x21 dimensions: desired zWThe subblocks have compatible sizes but don't form a square array (instead they form a r   z5 array). This might be due to missing p, q arguments.c                 S   s   g | ]}t |qS r   )r   iscomplexobjr   r   r   r   
<listcomp>   s    zcossin.<locals>.<listcomp>uncsdorcsd_lwork)mpq)lworklrworkr    F)
r   r   r   r   
compute_u1
compute_u2compute_v1tcompute_v2ttranssignszillegal value in argument z of internal z did not converge: )dtype   r   )intr   r   equalshape
ValueError
isinstancer   lenzipanyr   r   typecoder   r   diagcossinmineyemaxr(   zeros)-Xr   r   separate	swap_sign	compute_u
compute_vhr   r   r   r   r   nameblockmmpmmqcplxdrivercsd	csd_lworkr    
lwork_args_thetau1u2v1hv2hinfomethod_nameUVDHcsrn11n12n21n22IdCSxsxeysyer   r   r   r	      s   c
V










 $@@,< 0
)NNFFTT)collections.abcr   numpyr   scipy._lib._utilr   scipy.linalgr   r   lapackr   r   __all__r	   r   r   r   r   <module>   s    