Yes, that's precisely the case but when we know the structure we can just choose the appropriate solver anyhow with a little bit of overhead. What I mean is that, to my knowledge, FORTRAN routines for checking for triangularness etc. are absent.
On Tue, Jan 10, 2017 at 2:29 AM, Robert Kern <robert.k...@gmail.com> wrote: > On Mon, Jan 9, 2017 at 5:09 PM, Ilhan Polat <ilhanpo...@gmail.com> wrote: > > > So every test in the polyalgorithm is cheaper than the next one. I'm not > exactly sure what might be the best strategy yet hence the question. It's > really interesting that LAPACK doesn't have this type of fast checks. > > In Fortran LAPACK, if you have a special structured matrix, you usually > explicitly use packed storage and call the appropriate function type on it. > It's only when you go to a system that only has a generic, unstructured > dense matrix data type that it makes sense to do those kinds of checks. > > -- > Robert Kern > > _______________________________________________ > NumPy-Discussion mailing list > NumPy-Discussion@scipy.org > https://mail.scipy.org/mailman/listinfo/numpy-discussion > >
_______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org https://mail.scipy.org/mailman/listinfo/numpy-discussion
