Conceptually this seems related to sparse matrices so I wonder if there is some helpful terminology there.  Your 1D option would return “column indices” for the non-zero entries in each row of the 2D option.

Best,
Todd

On 21 May 2023, at 16:08, Ilhan Polat <ilhanpolat@gmail.com> wrote:

[snip] 

when

P, L, U = scipy.linalg.lu(A)

is run, currently, P is returning a full 2D array. If A is a tall array say, (25, 5) then P is necessarily (25, 25). And it is just a permutaiton matrix, a row shuffled np.eye(25). Instead, you can ask with this new keyword to return that shuffle pattern. as a 1D array and hence P becomes (25, ) array. 
[snip]
Could you please offer some alternatives even just for inspiration?

Best,
ilhan



On Tue, Apr 25, 2023 at 9:34 AM Jake Bowhay <jb9.bowhay@gmail.com> wrote:
It would be nice to add a quick note to the docs explaining when/which you should use. Currently both state "Compute pivoted LU decomposition of a matrix." which while true isn't very helpful for a user trying to decide which function to pick!
_______________________________________________
SciPy-Dev mailing list -- scipy-dev@python.org
To unsubscribe send an email to scipy-dev-leave@python.org
https://mail.python.org/mailman3/lists/scipy-dev.python.org/
Member address: ilhanpolat@gmail.com
_______________________________________________
SciPy-Dev mailing list -- scipy-dev@python.org
To unsubscribe send an email to scipy-dev-leave@python.org
https://mail.python.org/mailman3/lists/scipy-dev.python.org/
Member address: shoppert@baileywick.plus.com