 Taylor Howell
|
6a6e10d779
|
Add mju_cholFactorNNZ to compute the number of non-zeros per row for sparse Cholesky factorization.
PiperOrigin-RevId: 679553197
Change-Id: I6f92deec347dae97d2e219cfb5376f92e777da1a
|
2024-09-27 05:39:08 -07:00 |
|
|
Yuval Tassa
|
29aa5e4a41
|
Allow dot products with sparse vectors to specify that one vector uses uncompressed memory.
PiperOrigin-RevId: 561951337
Change-Id: I1310d7c09d9a85ad9b43877155844a9d0ce6edab
|
2023-09-01 07:40:16 -07:00 |
|
|
Kyle Bayes
|
ea5e00cad8
|
Move mju_combineSparseCount into engine_util_sparse.
PiperOrigin-RevId: 561025741
Change-Id: I0bdc48554928fc4545a38a8cea3bdeb593bd7ecd
|
2023-08-29 07:40:53 -07:00 |
|
|
Kyle Bayes
|
8ea690ed70
|
Remove unused parameters from mju_sqrMatTDSparseInit.
PiperOrigin-RevId: 557114227
Change-Id: Ia7d3fedfba612a68ff01d68f1b9dadb45bd76e85
|
2023-08-15 06:30:19 -07:00 |
|
|
Kyle Bayes
|
9924cce4b7
|
Add nnz per row precount method for mju_sqrMatTDSparse.
PiperOrigin-RevId: 521744893
Change-Id: Ie0fbfab552a680127f4acf9041b07916f8a2a490
|
2023-04-04 06:21:22 -07:00 |
|
|
Kyle Bayes
|
056e849273
|
Provide improved mju_sqrMatTDSparse implementation that doesn't require dense memory allocation for sparse matrices.
PiperOrigin-RevId: 516812783
Change-Id: Ieb43337831d8d3b2c7f18a7facd8e0a0f2b0eff5
|
2023-03-15 06:56:16 -07:00 |
|
|
Kyle Bayes
|
c741dfce7d
|
Implement a more performant mju_transposeSparse that doesn't require dense memory allocation.
PiperOrigin-RevId: 505044194
Change-Id: Ibe0e39e3ad711b2b5bdad45180ca4f83b5c8fc82
|
2023-01-27 00:20:01 -08:00 |
|
|
Alessio Quaglino
|
7b0fbc63f8
|
Speed improvement with no AVX. 40% on Linux Intel Xeon and 60% on ARM Mac.
PiperOrigin-RevId: 488360660
Change-Id: I423269cd362fdcc2434393b691638ac6ed778ef2
|
2022-11-14 07:31:32 -08:00 |
|