Re: strict static pivoting vs pliable static pivoting

I'm pliable enough to accept the rejection of "pliable static pivoting"

in favor of "restricted pivoting"
:-)

So we could have "static pivoting" to apply to the case

where no pivoting occurs at all once the pivots are selected during the
analysis

phase. But aren't there current uses of that phrase to include some
minor

variations on the pivot order determined during the analysis?

Then "restricted pivoting" would be (1) pivot in the analysis phase for
reducing

fill-in and for finding large pivots a priori, followed by (2) minor
modifications

to that pivot order during numerical factorization.

Now, what do you call it when a pivot fails in one frontal matrix, but
is

recovered in, say, its grandparent. We already call this "delayed
pivoting", correct?

This sounds very much like "restricted pivoting" however.

Thanks,

Tim

p.s. Speaking of the naming of pivoting schemes, what do you call a
fill-reducing

ordering followed by a call to a template sparse solver
( http://www.netlib.org/templates/ ),

when done after 6pm, and when used in the solution of a CFD problem
involving argon or

another one of the noble gases?

answer: "a noble night of the minimum degree order of the templates"

Cleve Ashcraft wrote:

On Tuesday 12 September 2006 13:33, Tim Davis wrote:

Actually, the fact that there may be row/col swaps hidden inside
a static scheme fits the word nicely.

Pivoting within a supernode could be called "restricted pivoting".
_______________________________________________
Csc mailing list
Csc-lVPF2Jp+hdv2fBVCVOL8/[email protected]
http://list.odu.edu/listinfo/csc

_______________________________________________
Csc mailing list
Csc-lVPF2Jp+hdv2fBVCVOL8/[email protected]
http://list.odu.edu/listinfo/csc