tf.linalg.qr
Stay organized with collections
Save and categorize content based on your preferences.
Computes the QR decompositions of one or more matrices.
tf.linalg.qr(
input, full_matrices=False, name=None
)
Computes the QR decomposition of each inner matrix in tensor
such that
tensor[..., :, :] = q[..., :, :] * r[..., :,:])
# a is a tensor.
# q is a tensor of orthonormal matrices.
# r is a tensor of upper triangular matrices.
q, r = qr(a)
q_full, r_full = qr(a, full_matrices=True)
Args |
input
|
A Tensor . Must be one of the following types: float64 , float32 , half , complex64 , complex128 .
A tensor of shape [..., M, N] whose inner-most 2 dimensions
form matrices of size [M, N] . Let P be the minimum of M and N .
|
full_matrices
|
An optional bool . Defaults to False .
If true, compute full-sized q and r . If false
(the default), compute only the leading P columns of q .
|
name
|
A name for the operation (optional).
|
Returns |
A tuple of Tensor objects (q, r).
|
q
|
A Tensor . Has the same type as input .
|
r
|
A Tensor . Has the same type as input .
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2020-10-01 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2020-10-01 UTC."],[],[]]