matrix types

Michael Meyer <[email protected]>
Newsgroups gmane.comp.lib.mtl.devel
Message-ID <[email protected]>
Many thanks for the mtl library.
The performance graphs are really impressive.

Here is my problem:
I would like to choose an upper triangular matrix type
which is a template with arbitrary element type
parameter T, something like

template<class T>
typedef matrix < T, 
                 triangle,
                 banded<>,
                 column_major >::type UTMatrix;

and then

int n=20;
UTMatrix A(n,n);

I am sorry I have to ask this question before
experimenting with the compiler but it's so basic for
my application I can't use the mtl if I cannot do this
so I have no code written up yet.

Mostly I have to allocate matrices of a size which is
not known at compile time. Can I still expect benefits
from the mtl template techniques or would I get
similar performance by hand coding straightforward
loops?

Here is another question: I am using the GNU g++
compiler which does not optimize small objects (the
mayflies). Is this going to lead to serious
performance degradation (below straightforward
handcoded loops)?

Many thanks,

Mike
                
                 




__________________________________________________
Do you Yahoo!?
Yahoo! Tax Center - forms, calculators, tips, more
http://taxes.yahoo.com/
_______________________________________________
This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.