tfp.experimental.fastgp.preconditioners.tfp_math.fill_triangular_inverse
Stay organized with collections
Save and categorize content based on your preferences.
Creates a vector from a (batch of) triangular matrix.
tfp.experimental.fastgp.preconditioners.tfp_math.fill_triangular_inverse(
x, upper=False, name=None
)
The vector is created from the lower-triangular or upper-triangular portion
depending on the value of the parameter upper.
If x.shape is [b1, b2, ..., bB, n, n] then the output shape is
[b1, b2, ..., bB, d] where d = n (n + 1) / 2.
Example:
fill_triangular_inverse(
[[4, 0, 0],
[6, 5, 0],
[3, 2, 1]])
# ==> [1, 2, 3, 4, 5, 6]
fill_triangular_inverse(
[[1, 2, 3],
[0, 5, 6],
[0, 0, 4]], upper=True)
# ==> [1, 2, 3, 4, 5, 6]
Args |
x
|
Tensor representing lower (or upper) triangular elements.
|
upper
|
Python bool representing whether output matrix should be upper
triangular (True) or lower triangular (False, default).
|
name
|
Python str. The name to give this op.
|
Returns |
flat_tril
|
(Batch of) vector-shaped Tensor representing vectorized lower
(or upper) triangular elements from x.
|
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 2026-11-06 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 2026-11-06 UTC."],[],[]]