Static pivoting

[pothen]

From Iain Duff...
Happy Thanksgiving!
--Alex

> ++++++++++++++
> > From isd Thu Nov 16 08:26 GMT 2006
> > Date: Thu, 16 Nov 2006 08:26:29 GMT
> > From: Iain Duff <isd>
> > To: csc@...
> > Subject: Static pivoting
> > Cc: isd
> > X-Status:
> >
> > Sorry about the delay in getting back to the CSC list on the topic of
> > static pivoting but I have just been travelling first in China and now
> > (on a quite separate journey) in Australia.
> >
> > I had many responses to my earlier questions, some offline from CSC.  In
> > fact, it is not really possible to summarize them because many were
> > answering the questions from quite different perspectives.  I will
> > thus try a different track that I have already field tested on some
> > colleagues.
> >
> > I would like to define "static pivoting" as any scheme for selecting pivots
> > in an elimination method that enables a static data structure to be used.
> > For example, in the case of supernodal or multifrontal methods, this would
> > mean that the data structures (eg assembly trees) determined by the
> > analysis phase would be respected by the numerical factorization.
> >
> > Comments please.
> >
> > Best wishes
> >
> > Iain
> >

_______________________________________________
Csc mailing list
Csc@...
http://list.odu.edu/listinfo/csc

[Jason Riedy-2]

And Iain Duff writes:
> I would like to define "static pivoting" as any scheme for
> selecting pivots in an elimination method that enables a static
> data structure to be used.

Every pivot method allows for a static data structure: a dense
matrix.

Please let static pivoting remain the static selection of pivots.

We shouldn't conflate the numerical actions with the particular
implementation choices more than absolutely is necessary.

Jason
_______________________________________________
Csc mailing list
Csc@...
http://list.odu.edu/listinfo/csc