commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: [MATH] Re: Pivoting QR Decomposition: Take Two!
Date Thu, 06 Oct 2011 16:08:14 GMT
Actually, you can easily get all the information at least in degenerate
form.

The two cases are:

    - getPivot() ... the identity permutation can be returned

    - getRank() ... it is reasonable to throw an exception stating that rank
is not available (UnsupportedOperationException, in particular).  This is
*exactly* analogous to the way that many iterators do not allow remove() to
be called.

On Thu, Oct 6, 2011 at 3:21 AM, Gilles Sadowski <
gilles@harfang.homelinux.org> wrote:

> IIUC, there are things you can query from a "PivotingQRDecomposition" that
> you cannot from the "FastQRDecomposition", then when you get the interface
> "QRDecomposition", you've lost these additional features. And if you impose
> that the interface contains them, then if you request the "fast"
> implementation, and then query the "pivoting" features, what happens?
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message