# How to improve efficiency of my linear algebra code (matrix equivalency)

**URL:** <https://discourse.julialang.org/t/how-to-improve-efficiency-of-my-linear-algebra-code-matrix-equivalency/110572>\
**Category:** Performance\
**Tags:** linearalgebra, memory-allocation\
**Created:** [February 22, 2024, 11:43am UTC](https://discourse.julialang.org/t/how-to-improve-efficiency-of-my-linear-algebra-code-matrix-equivalency/110572 "2024-02-22T11:43:09Z")\
**Posts on this page:** 1\
**Showing post:** 31

<div class="post-metadata">

**Author:** ![Leo\_I](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/leo_i/32/27262_2.png) [@Leo\_I](https://discourse.julialang.org/u/Leo_I)\
**Post date:** [July 28, 2024, 12:01pm UTC](https://discourse.julialang.org/t/how-to-improve-efficiency-of-my-linear-algebra-code-matrix-equivalency/110572/31 "2024-07-28T12:01:13Z")

</div>

The answer to my original question (2) can be found here: [https://discourse.julialang.org/t/parallel-matrix-col-row-operations-give-incorrect-results/](https://discourse.julialang.org/t/parallel-matrix-col-row-operations-give-incorrect-results/)

There are also benchmarks for `lu` over finite fields.

---

_[View the full topic](https://discourse.julialang.org/t/how-to-improve-efficiency-of-my-linear-algebra-code-matrix-equivalency/110572)._