Implement complex QR decomposition in HLO (TPU)
See original GitHub issueThe following code raises RuntimeError: Unimplemented: complex comparison 'LT'
import jax
jax.np.linalg.qr((np.random.rand(3, 3) + 1j * np.random.rand(3, 3)))
Noticed this because one of our test cases fails (https://github.com/google/TensorNetwork/issues/221)
Issue Analytics
- State:
- Created 4 years ago
- Comments:8 (4 by maintainers)
Top Results From Across the Web
6. QR factorization
in the following lectures, we will use the QR factorization to solve. • linear equations. • least squares problems ... QR factorization of...
Read more >Change log - JAX documentation
The implementation of singular value decomposition (SVD) and symmetric/Hermitian ... jax.numpy.linalg.cond() on TPUs now accepts complex input.
Read more >High Accuracy Low Precision QR Factorization and Least ...
In this paper we present effective use of NVIDIA TensorCore units to QR factorize matrix and solve linear least square problem (LLS). QR...
Read more >Implement Hardware-Efficient Complex Partial-Systolic QR ...
This example shows how to implement a hardware-efficient QR decomposition using the Complex Partial-Systolic QR Decomposition block.
Read more >tf.linalg.qr | TensorFlow v2.11.0
Currently, the gradient for the QR decomposition is well-defined only when the first P columns of the inner matrix are linearly independent, ...
Read more >
Top Related Medium Post
No results found
Top Related StackOverflow Question
No results found
Troubleshoot Live Code
Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free
Top Related Reddit Thread
No results found
Top Related Hackernoon Post
No results found
Top Related Tweet
No results found
Top Related Dev.to Post
No results found
Top Related Hashnode Post
No results found
Hi! We’d be interested in all three. The ranking is CPU, GPU and TPU, with TPU the least important right now. Thanks for the quick reply!
We’ve already fixed this at head!