tfp.experimental.linalg.no_pivot_ldl
Stay organized with collections
Save and categorize content based on your preferences.
Non-pivoted batched LDL factorization.
tfp.experimental.linalg.no_pivot_ldl(
matrix, name='no_pivot_ldl'
)
Performs the LDL factorization, using the outer product algorithm from [1]. No
pivoting (or block pivoting) is done, so this should be less stable than
e.g. Bunch-Kaufman sytrf. This is implemented as a tf.foldl, so should have
gradients and be accelerator-friendly, but is not particularly performant.
If compiling with XLA, make sure any surrounding GradientTape is also
XLA-compiled (b/193584244).
References
[1]: Gene H. Golub, Charles F. Van Loan. Matrix Computations, 4th ed., 2013.
Args |
|---|
matrix
|
A batch of symmetric square matrices, with shape [..., n, n].
|
name
|
Python str name prefixed to Ops created by this function.
Default value: 'no_pivot_ldl'.
|
Returns |
|---|
triangular_factor
|
The unit lower triangular L factor of the LDL
factorization of matrix, with the same shape [..., n, n]. Callers
should check for nans and other indicators of instability.
|
diag
|
The diagonal from the LDL factorization, with shape [..., n].
|
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 2023-11-21 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 2023-11-21 UTC."],[],[]]
View source on GitHub