Re: Solving a large sparse system with a single dense row/column?


"Alois Steindl" <Alois.Steindl@xxxxxxxxxxxx> wrote in message
news:m3tzh87sp8.fsf@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
"Anony" <no-email@xxxxxxxxxxxx> writes:

There is no way to agree with the opinion "renumbering .... save you
only
half the full bandwidth".

Basically, you need a good renumbering scheme or tool. The following is
a
link for renumbering
http://www.equation.com/servlet/equation.cmd?call=jcl
(or http://www.Equation.com)
Hello,
assume an "arrow matrix" with fill in in the diagonal and the last row
and column.
What's the most efficient numbering?
What's the corresponding band width?

Alois


Hi, Alois,

Renumbering is not limited to produce constant bandwidth. As stated in my
origianl response, if the upper triangular part
is as:

/ \
| x x |
| x x |
| x x |
| x x |
| x x |
| x x |
| x |
\ /

variable bandwidth solver (i.e., skyline solver) is a choice.



.