numpy.linalg.qr(a,mode='reduced')[source]¶Compute the qr factorization of a matrix.
Factor the matrixa asqr, whereq is orthonormal andr isupper-triangular.
| Parameters: |
|
|---|---|
| Returns: |
|
| Raises: |
|
Notes
This is an interface to the LAPACK routines dgeqrf, zgeqrf,dorgqr, and zungqr.
For more information on the qr factorization, see for example:http://en.wikipedia.org/wiki/QR_factorization
Subclasses ofndarray are preserved except for the ‘raw’ mode. So ifa is of typematrix, all the return values will be matrices too.
New ‘reduced’, ‘complete’, and ‘raw’ options for mode were added inNumPy 1.8.0 and the old option ‘full’ was made an alias of ‘reduced’. Inaddition the options ‘full’ and ‘economic’ were deprecated. Because‘full’ was the previous default and ‘reduced’ is the new default,backward compatibility can be maintained by lettingmode default.The ‘raw’ option was added so that LAPACK routines that can multiplyarrays by q using the Householder reflectors can be used. Note that inthis case the returned arrays are of type np.double or np.cdouble andthe h array is transposed to be FORTRAN compatible. No routines usingthe ‘raw’ return are currently exposed by numpy, but some are availablein lapack_lite and just await the necessary work.
Examples
>>>a=np.random.randn(9,6)>>>q,r=np.linalg.qr(a)>>>np.allclose(a,np.dot(q,r))# a does equal qrTrue>>>r2=np.linalg.qr(a,mode='r')>>>r3=np.linalg.qr(a,mode='economic')>>>np.allclose(r,r2)# mode='r' returns the same r as mode='full'True>>># But only triu parts are guaranteed equal when mode='economic'>>>np.allclose(r,np.triu(r3[:6,:6],k=0))True
Example illustrating a common use ofqr: solving of least squaresproblems
What are the least-squares-bestm andy0 iny=y0+mx forthe following data: {(0,1), (1,0), (1,2), (2,1)}. (Graph the pointsand you’ll see that it should be y0 = 0, m = 1.) The answer is providedby solving the over-determined matrix equationAx=b, where:
A=array([[0,1],[1,1],[1,1],[2,1]])x=array([[y0],[m]])b=array([[1],[0],[2],[1]])
If A = qr such that q is orthonormal (which is always possible viaGram-Schmidt), thenx=inv(r)*(q.T)*b. (In numpy practice,however, we simply uselstsq.)
>>>A=np.array([[0,1],[1,1],[1,1],[2,1]])>>>Aarray([[0, 1], [1, 1], [1, 1], [2, 1]])>>>b=np.array([1,0,2,1])>>>q,r=LA.qr(A)>>>p=np.dot(q.T,b)>>>np.dot(LA.inv(r),p)array([ 1.1e-16, 1.0e+00])