On Tue, Jul 12, 2022 at 08:27:33AM -0700, Sid Andal wrote:
>
> Solving the singular linear system AX = B, where the first column of the
> square matrix, A, is identically zero (if the particular solution exists)
> can be achieved with the usual method X := solve(A, B) along with the
> nontrivial nullspace.
>
> Is there a computationally more efficient method to solve the system that
> can take advantage of the fact that column one of A is identically zero?
'solve' automatically takes advantage of zero columns, no need
to do anything special.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/20220712172048.GA27943%40fricas.math.uni.wroc.pl.
