Ë
    ü�Dj%  ã                   ó*   — d Z ddlZddlmZ dgZdd„Zy)z+
Solve the orthogonal Procrustes problem.

é    Né   )ÚsvdÚorthogonal_procrustesc                 ó*  — |r+t        j                  | «      } t        j                  |«      }n*t        j                  | «      } t        j                  |«      }| j                  dk7  rt	        d| j                  z  «      ‚| j
                  |j
                  k7  r&t	        d| j
                  › d|j
                  › d�«      ‚t        |j                  j                  | «      j                  «      \  }}}|j                  |«      }|j                  «       }||fS )aô  
    Compute the matrix solution of the orthogonal Procrustes problem.

    Given matrices A and B of equal shape, find an orthogonal matrix R
    that most closely maps A to B using the algorithm given in [1]_.

    Parameters
    ----------
    A : (M, N) array_like
        Matrix to be mapped.
    B : (M, N) array_like
        Target matrix.
    check_finite : bool, optional
        Whether to check that the input matrices contain only finite numbers.
        Disabling may give a performance gain, but may result in problems
        (crashes, non-termination) if the inputs do contain infinities or NaNs.

    Returns
    -------
    R : (N, N) ndarray
        The matrix solution of the orthogonal Procrustes problem.
        Minimizes the Frobenius norm of ``(A @ R) - B``, subject to
        ``R.T @ R = I``.
    scale : float
        Sum of the singular values of ``A.T @ B``.

    Raises
    ------
    ValueError
        If the input array shapes don't match or if check_finite is True and
        the arrays contain Inf or NaN.

    Notes
    -----
    Note that unlike higher level Procrustes analyses of spatial data, this
    function only uses orthogonal transformations like rotations and
    reflections, and it does not use scaling or translation.

    .. versionadded:: 0.15.0

    References
    ----------
    .. [1] Peter H. Schonemann, "A generalized solution of the orthogonal
           Procrustes problem", Psychometrica -- Vol. 31, No. 1, March, 1966.
           :doi:`10.1007/BF02289451`

    Examples
    --------
    >>> import numpy as np
    >>> from scipy.linalg import orthogonal_procrustes
    >>> A = np.array([[ 2,  0,  1], [-2,  0,  0]])

    Flip the order of columns and check for the anti-diagonal mapping

    >>> R, sca = orthogonal_procrustes(A, np.fliplr(A))
    >>> R
    array([[-5.34384992e-17,  0.00000000e+00,  1.00000000e+00],
           [ 0.00000000e+00,  1.00000000e+00,  0.00000000e+00],
           [ 1.00000000e+00,  0.00000000e+00, -7.85941422e-17]])
    >>> sca
    9.0

    é   z&expected ndim to be 2, but observed %szthe shapes of A and B differ (z vs ú))
ÚnpÚasarray_chkfiniteÚ
asanyarrayÚndimÚ
ValueErrorÚshaper   ÚTÚdotÚsum)ÚAÚBÚcheck_finiteÚuÚwÚvtÚRÚscales           ú\C:\Crop_Prediction\Backend\crop-ai-system\venv\Lib\site-packages\scipy/linalg/_procrustes.pyr   r      sØ   € ñ@ Ü× Ñ  Ó#ˆÜ× Ñ  Ó#‰ä�M‰M˜!ÓˆÜ�M‰M˜!ÓˆØ‡v�v�‚{ÜÐAÀAÇFÁFÑJÓKÐKØ‡w�w�!—'‘'ÒÜÐ9¸!¿'¹'¸À$ÀqÇwÁwÀiÈqÐQÓRÐRä�1—3‘3—7‘7˜1“:—<‘<Ó �H€A€qˆ"Ø	�‰ˆb‹	€AØ�E‰E‹G€EØˆeˆ8€Oó    )T)Ú__doc__Únumpyr	   Ú_decomp_svdr   Ú__all__r   © r   r   ú<module>r!      s"   ðñó Ý ð #Ð
#€ôNr   