ó î&]\c @`sáddlmZmZmZddlZddlZddlmZddl m Z ddl m Z m Z mZmZmZmZddlmZdgZdddded„Zdd d ddd dded dd „ ZdS(i(tdivisiontprint_functiontabsolute_importN(t LinAlgError(txrange(tget_blas_funcstqrtsolvetsvdt qr_inserttlstsq(t make_systemtgcrotmkc " C`s|dkrd„}n|dkr0d„}ntddddg|fƒ\} } } } |g} g}d}tj}|t|ƒ}tjt|ƒ|fd|jƒ}tjdd|jƒ}tjdd|jƒ}tj|jƒj }t }x]t |ƒD]O}|r5|t|ƒkr5||\}}n|rb|t|ƒkrb||ƒ}d}nT| r ||t|ƒkr |||t|ƒ\}}n|| d ƒ}d}|dkr×|||ƒƒ}n |j ƒ}| |ƒ}xVt |ƒD]H\}}| ||ƒ}||||f<| |||jd | ƒ}qüWtj|d d|jƒ}xPt | ƒD]B\}}| ||ƒ}|||<| |||jd | ƒ}qqW| |ƒ||dCscS`s|S(N((R ((sBlib/python2.7/site-packages/scipy/sparse/linalg/isolve/_gcrotmk.pyREstaxpytdottscaltnrm2tdtypeiiiÿÿÿÿitovertignoretdivideNtordertFtwhichtcolt overwrite_qrut check_finite(ii(ii(iiÿÿÿÿ(tNoneRtnptnantlentzerosRtonestfinfotepstFalseRtcopyt enumeratetshapeterrstatetisfinitetTruetappendR tabsRR tconj("tmatvectv0tmtatoltlpsolvetrpsolvetcstouter_vtprepend_outer_vRRRRtvstzstytrestBtQtRR$t breakdowntjtztwtw_normtitctalphathcurtvtQ2tR2t_((sBlib/python2.7/site-packages/scipy/sparse/linalg/isolve/_gcrotmk.pyt_fgmress|1    *  $  !   ! !   ,$(  S gñh㈵øä>ièitoldestc C C`s t||||ƒ\}}} }}tj|ƒjƒsHtdƒ‚n| dkrjtd| fƒ‚n| dkr˜tjddtddƒ|} n|j }|j }| dkr¿g} n|dkrÔ|}nd \}}}||| ƒ}t d d d d g| |fƒ\}}}}||ƒ}| r[g| D]\}}d|f^q9| (n| rI| j d d„ƒtj |j dt| ƒfd|jddƒ}g}d}xg| r| jdƒ\}}|dkrê||ƒ}n||dd…|f<|d7}|j|ƒq´Wt|dtdddtƒ\}}}~t|jƒ}g} xÆtt|ƒƒD]²}|||}xCt|ƒD]5}!||||!||j d||!|f ƒ}qŽWt|||fƒdt|d!ƒkrõPn|d|||f|ƒ}| j|ƒqmWtt|| ƒƒddd…| (n| rÏt d d g|fƒ\}}x_| D]T\}}|||ƒ}"||| | j d|"ƒ} ||||j d|" ƒ}qtWnxSt|ƒD]E}#|dk rû|| ƒn||ƒ}$t| ||ƒ}%|$|%krW|#dks8| rW||| ƒ}||ƒ}$n|$|%krmd}#Pn|t|t| ƒdƒ}&g| D]\}}|^q‘}y\t|||$|&d|dt| ||ƒ|$d|ƒ\}}}'}(})}*}+|*|$9}*Wntk rPnX|)d|*d},xAt|)d|*dƒD](\}-}"||-|,|,j d|"ƒ},qDW|'j|*ƒ}.xFt| |.ƒD]5\}/}0|/\}}|||,|,j d|0 ƒ},qW|j|j|*ƒƒ}1|(d|1d}2xAt|(d|1dƒD](\}3}4||3|2|2j d|4ƒ}2q Wy/d||2ƒ}5tj|5ƒsdtƒ‚nWnttfk rqÜnX||5|2ƒ}2||5|,ƒ},||2|ƒ}6||2||j d|6 ƒ}||,| | j d|6ƒ} | dkrxt| ƒ|kr| r| d=q÷Wnñ| dkr t| ƒ|kr | r t|dd…dd…fj|'jƒj}7t |7ƒ\}8}9}:g};xtt!|8dd…d|d…fjƒD]I\}}<| d\}}||<d}||<d}xit| d|<dƒD]P\}=}>|=\}?}@||?||j d|>ƒ}||@||j d|>ƒ}qWx]|;D]U\}?}@||?|ƒ}5||?||j d|5 ƒ}||@||j d|5 ƒ}q_W||ƒ}5|d|5|ƒ}|d|5|ƒ}|;j||fƒq´W|;| (q n| j|2|,fƒqÜW| jd| j"ƒfƒ| rm g| D]\}A}Bd|Bf^qK | (n|| ƒ|#dfS("s` Solve a matrix equation using flexible GCROT(m,k) algorithm. Parameters ---------- A : {sparse matrix, dense matrix, LinearOperator} The real or complex N-by-N matrix of the linear system. b : {array, matrix} Right hand side of the linear system. Has shape (N,) or (N,1). x0 : {array, matrix} Starting guess for the solution. tol, atol : float, optional Tolerances for convergence, ``norm(residual) <= max(tol*norm(b), atol)``. The default for ``atol`` is `tol`. .. warning:: The default value for `atol` will be changed in a future release. For future compatibility, specify `atol` explicitly. maxiter : int, optional Maximum number of iterations. Iteration will stop after maxiter steps even if the specified tolerance has not been achieved. M : {sparse matrix, dense matrix, LinearOperator}, optional Preconditioner for A. The preconditioner should approximate the inverse of A. gcrotmk is a 'flexible' algorithm and the preconditioner can vary from iteration to iteration. Effective preconditioning dramatically improves the rate of convergence, which implies that fewer iterations are needed to reach a given error tolerance. callback : function, optional User-supplied function to call after each iteration. It is called as callback(xk), where xk is the current solution vector. m : int, optional Number of inner FGMRES iterations per each outer iteration. Default: 20 k : int, optional Number of vectors to carry between inner FGMRES iterations. According to [2]_, good values are around m. Default: m CU : list of tuples, optional List of tuples ``(c, u)`` which contain the columns of the matrices C and U in the GCROT(m,k) algorithm. For details, see [2]_. The list given and vectors contained in it are modified in-place. If not given, start from empty matrices. The ``c`` elements in the tuples can be ``None``, in which case the vectors are recomputed via ``c = A u`` on start and orthogonalized as described in [3]_. discard_C : bool, optional Discard the C-vectors at the end. Useful if recycling Krylov subspaces for different linear systems. truncate : {'oldest', 'smallest'}, optional Truncation scheme to use. Drop: oldest vectors, or vectors with smallest singular values using the scheme discussed in [1,2]. See [2]_ for detailed comparison. Default: 'oldest' Returns ------- x : array or matrix The solution found. info : int Provides convergence information: * 0 : successful exit * >0 : convergence to tolerance not achieved, number of iterations References ---------- .. [1] E. de Sturler, ''Truncation strategies for optimal Krylov subspace methods'', SIAM J. Numer. Anal. 36, 864 (1999). .. [2] J.E. Hicken and D.W. Zingg, ''A simplified and flexible variant of GCROT for solving nonsymmetric linear systems'', SIAM J. Sci. Comput. 32, 172 (2010). .. [3] M.L. Parks, E. de Sturler, G. Mackey, D.D. Johnson, S. Maiti, ''Recycling Krylov subspaces for sequences of linear systems'', SIAM J. Sci. Comput. 28, 1651 (2006). s$RHS must contain only finite numbersRMtsmallests Invalid value for 'truncate': %rsšscipy.sparse.linalg.gcrotmk called without specifying `atol`. The default value will change in the future. To preserve current behavior, set ``atol=tol``.tcategoryt stackleveliRRRRtkeycS`s|ddk S(Ni(R(tcu((sBlib/python2.7/site-packages/scipy/sparse/linalg/isolve/_gcrotmk.pyR.siRRRNit overwrite_atmodeteconomictpivotinggê-™—q=gð?iÿÿÿÿR4R2R5(RMRN(NNN(ii(#R RR*tallt ValueErrorRtwarningstwarntDeprecationWarningR/RtsorttemptyR(R RtpopR,RR+tlisttTRR-tziptmaxRLRRtFloatingPointErrortZeroDivisionErrorRRR'R&(CtAtbtx0ttoltmaxitertMtcallbackR1tktCUt discard_CttruncateR2R t postprocessR/tpsolveRRRtrRtb_normREtutCtusR@R=R>tPR5tnew_usRDtyctj_outertbetatbeta_toltmlR<R8R9R:tprestuxRAtbyRRtbycthytcxRHthycRFtgammatDtWtsigmatVtnew_CURBtcuptwptcptuptcztuz((sBlib/python2.7/site-packages/scipy/sparse/linalg/isolve/_gcrotmk.pyR ¹sþO$           - )1   '3*& $     $  !$   .6$  !  )(((t __future__RRRRYtnumpyRt numpy.linalgRtscipy._lib.sixRt scipy.linalgRRRRR R t scipy.sparse.linalg.isolve.utilsR t__all__RR%RLR (((sBlib/python2.7/site-packages/scipy/sparse/linalg/isolve/_gcrotmk.pyts  .   §