A new row ordering strategy for frontal solver (Q2760352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1684510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new row ordering strategy for frontal solver |
scientific article; zbMATH DE number 1684510 |
Statements
19 December 2001
0 references
ordering rows
0 references
frontal method
0 references
row graphs
0 references
sparse unsymmetric matrices
0 references
Sloan's profile reduction algorithm
0 references
spectral method
0 references
numerical experiments
0 references
A new row ordering strategy for frontal solver (English)
0 references
The problem of reordering the rows of a general unsymmetric matrix \(A\) for use with a frontal solver is studied. A variant of Sloan's profile reduction algorithm and spectral method are applied to a row graph of an unsymmetric matrix \(A\) to reorder the rows. The author illustrates the effectiveness of her algorithms on several numerical experiments based on industrial and engineering applications.
0 references
0.8239457011222839
0 references
0.7906454205513
0 references
0.7859112620353699
0 references
