I think I understand, but is there an implementation of this technique that can actually perform the linear algebra on a symbolic matrix at such improved compute-time?
On Tuesday, October 9, 2018 at 1:58:04 PM UTC-6, Isuru Fernando wrote: > > First k-1 entries of the k th eigenvector for an upper triangular matrix U > is U[:k-1,:k-1]^-1 @ U[:k-1,k], which is a triangular solve since > U[:k-1,:k-1] is a triangular matrix and it can be done in O(k^2) time. > > Isuru > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/7a801808-9dde-4b56-ab8b-f2c9b98334e8%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
