|Re: [eigen] Bug in the Cholesky/Core module?|
[ Thread Index |
| More lists.tuxfamily.org/eigen Archives
- To: eigen@xxxxxxxxxxxxxxxxxxx
- Subject: Re: [eigen] Bug in the Cholesky/Core module?
- From: "Gael Guennebaud" <gael.guennebaud@xxxxxxxxx>
- Date: Fri, 22 Aug 2008 23:58:17 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:to :subject:in-reply-to:mime-version:content-type :content-transfer-encoding:content-disposition:references; bh=N9JjC5u7yRPZeNA9Qhn21SBHV0ejIfqKNcP7uTcndG4=; b=fqGq9zqc+XzqKmXS2Bg3Fc9q0lJdE+Z6fkM6D/NuunqOHHWdjxWUnMxpGHlnqU82S5 H9hKjVnz4zrZpF0E/FZ3vkSeRx8tk+MtX/eWLJS3QA8B9gIkIGXAWzkJafwzb6eqpFkB NJI8TmR7XSsaBFLL70Et/19AEKATDTfFXpJ0U=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version :content-type:content-transfer-encoding:content-disposition :references; b=CkjlRJXEmAxY/hdiri81T5mPxYSv43pdDcpTfeJYM03hVxYqdcNUAF9cN8paWzn16s lyuUvFa9sH1yNZJbvLZQ/jPrlzneyPNaU4qVmqJuJhyB7TJsicpLbkWGgYBT1mop+QX1 PycTXZNshu4V/iO8Omqw7ZGmGDfVfYY2LeiE4=
On Fri, Aug 22, 2008 at 7:58 PM, Timothy Hunter <tjhunter@xxxxxxxxxxxx> wrote:
> You are welcome. I am amazed by the rate at which bugs are fixed!
> I am currently writing a convex optimization solver using Eigen. Do
> you have any small tutorial/style recommendation on how to write code
> for it? In my case, I want to write some matrix specializations
> (tridiagonal, bock diagonal and block tridiagonal).
that looks interesting. So far for tridiagonal matrices (used in
Tridiagonalisation and EigenDecomposition) I simply used two vectors,
one for the diagonal and one for the subdiagonal (if the matrix is not
symmetric you need a third superdiagonal vector). This scheme is
compatible with Lapack. Of course it would be cool to have a
TridiagonalMatrix class to glue those vectors together and make it
looks like a matrix... Perhaps with some additional functions to
access the coefficient efficiently such as:
For the block matrices I don't really know what would be the best to
do.... I guess all blocks have the same size, (perhaps it is even
known at compile time) ? Then maybe it would probably be cool to have
BlockMatrixBase class with some additional methods such as:
- block(i,j) where i,j represents block coordinates
and then you might have a BlockDiagonalMatrix class which would
internally store a blocksize x matrixsize matrix representing the
block diagonal and pick sub matrices in it. And same for
Another different approach would be to have a recursive approach
nesting matrices. For instance a block diagonal matrix would be:
and a block tridiagonal:
however this is currently not possible.
Also, if you want very good perf, the size of the block should be
known at compile time, and block(i,j) would returns a fixed-size Block
expression. But then the issue is how to handle boundaries ? unless it
is always guaranteed that the size of the matrix is a multiple of the
block size ?
anyways, it was just some random thoughts, perhaps not helpful at all
! Also if you come up with good Matrix classes for such use cases it
would be great to include them in the Sparse module of Eigen, though I
don't know if that's possible from your side.