Timeline for Implementing PLU Decomposition in Rust
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2023 at 7:26 | comment | added | Rainb | the problem of mantaining references in rust then turns into ownership which is headache inducing, and sure I could use slices for rows but not for columns, and I didn't want to handle them differently, thats why they have the same input/output, but maybe I am missing a simpler way of doing this. | |
| Jun 11, 2023 at 20:41 | comment | added | Davislor | If you want to copy the elements of a column into a packed array for efficient SIMD code, you probably want to do that in chunks equal to the native vector size of your target (32 bytes/256 bits on an x86 with AVX2). | |
| Jun 11, 2023 at 20:17 | comment | added | Davislor |
Not a full review right now, but the first thing that jumps out at me is that you’re getting rows and columns by cloning them. You instead want to take views of them. If the matrix is implemented as a flat array, you could call iter().advance(i).step_by(n) to iterate over the elements of column i in each row. Operations on corresponding elements of two rows or columns could then be implemented with row_iter.zip(column_iter).map(function_on_tuple).
|
|
| Jun 11, 2023 at 7:24 | history | edited | Rainb | CC BY-SA 4.0 |
added 3 characters in body
|
| Jun 10, 2023 at 18:27 | history | edited | Rainb | CC BY-SA 4.0 |
added 193 characters in body
|
| S Jun 10, 2023 at 17:57 | review | First questions | |||
| Jun 10, 2023 at 20:38 | |||||
| S Jun 10, 2023 at 17:57 | history | asked | Rainb | CC BY-SA 4.0 |