Re: [eigen] TriangularView::solve() interface |

[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]

*To*: eigen@xxxxxxxxxxxxxxxxxxx*Subject*: Re: [eigen] TriangularView::solve() interface*From*: Benoit Jacob <jacob.benoit.1@xxxxxxxxx>*Date*: Mon, 24 Aug 2009 10:47:39 -0400*Dkim-signature*: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:in-reply-to:references :date:message-id:subject:from:to:content-type :content-transfer-encoding; bh=uFABdEOeHjoWEw1BAihMb5WhhWpWE3OvTS25hZoRjmI=; b=tlLJN5DUN/PXDNHxh0V4Av52MpNldREU8O5L7pqxV8XHCoZpbEWwi+GDWmh8F6+ewP TrJRiKSxhSQxFiCxrOfnSchN+3g9PkboeyHwlf25VdXe/d0MUKM1TcFQzESxx7gj1dJr z7jnx5yCIuRCpRJauUWgvPgYAzij9epTGRAno=*Domainkey-signature*: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type:content-transfer-encoding; b=dCoPX7s6LEjlLXbMfI4PGpmIbkKZ92k72IoHl9qm6Q1ojLfuKX81heCfES7gJc2hrW ViOayi5cyL75yJ15pJzbsnkAs+UUYE1vOrtB8RieJKDrAS8z26rj7a32Lb+nCYvAGT1p c/m/0MWB+qcccKA1aPQuKn2itmX8OWfUxQFYo=

2009/8/24 Jitse Niesen <jitse@xxxxxxxxxxxxxxxxx>: > Hello, > > While rewriting part of the tutorial, I noticed that the new > TriangularView::solve() function returns the solution vector, while the > other solve functions pass the solution via one of the parameters. Compare > > x = A.triangularView<UpperTriangular>().solve(b); > > with > > A.partialLu().solve(b, &x); > > Was this done on purpose? Hm, question for Gael, but indeed this is a bit strange. we need to unify how we use a single given word thoughout eigen. > > The docs on the eigen website [1] were magically updated, Thanks to Thomas who has set a cron job on his machine! > but some of the > latex was not parsed correctly. Am I doing anything wrong? Everything works > fine on my own computer. I didn't know about the "aligned" environment, perhaps it requires a special package. The standard way to do that would be eqnarray*. Then you put & on both sides of =. This will also look better. > Something to perhaps add to the to-do list: a routine to estimate the > condition number of a matrix based on the LU decomposition. Is that possible at all? I assume that by condition number we mean the ratio between the biggest and smallest eigenvalue. I don't think that the LU decomposition sees that! The SVD, Schur, and diagonalizations are the ones that can be used here. Benoit

**Follow-Ups**:**Re: [eigen] TriangularView::solve() interface***From:*Benoit Jacob

**Re: [eigen] TriangularView::solve() interface***From:*Rhys Ulerich

**Re: [eigen] TriangularView::solve() interface***From:*Jitse Niesen

**References**:**[eigen] TriangularView::solve() interface***From:*Jitse Niesen

**Messages sorted by:**[ date | thread ]- Prev by Date:
**[eigen] TriangularView::solve() interface** - Next by Date:
**Re: [eigen] TriangularView::solve() interface** - Previous by thread:
**[eigen] TriangularView::solve() interface** - Next by thread:
**Re: [eigen] TriangularView::solve() interface**

Mail converted by MHonArc 2.6.19+ | http://listengine.tuxfamily.org/ |