The frontal method is a variant of Gaussian elimination that has been widely used since the mid 1970s. In the innermost loop of the computation the method exploits dense linear algebra kernels, which are straightforward to vectorize and parallelize. This makes the method attractive for modern comput
Reversing the row order for the row-by-row frontal method
✍ Scribed by J. K. Reid; J. A. Scott
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 56 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
✦ Synopsis
The e ciency of the row-by-row frontal method for the solution of unsymmetric sparse linear systems of equations is dependent on the row ordering used. Numerical experience has shown us that it can be advantageous to reverse a given row ordering. We present two results on invariances under the reversal of the ordering and use real applications to illustrate the variations that can take place upon row reversal.
📜 SIMILAR VOLUMES
## Abstract We have recently developed new nonrelativistic and scalar‐relativistic pseudopotentials for the first‐row transition metal and several main‐group elements. These improved Model Core Potentials were tested on a variety of transition metal complexes to determine their accuracy in reproduc
## Abstract Gaussian basis sets, consisting of 15 s‐type, 11 p‐type, and 6 d‐type functions, for the fourth‐row main group elements, In‐Xe, are presented. In order to compare these basis sets with larger ones, calculations have been performed in I~2~ and TeO~2~.
## Abstract New nonrelativistic and scalar‐relativistic pseudopotentials for the second‐ and third‐row transition metals have been developed. These improved Model Core Potentials were used in calculations for a variety of transition metal complexes to test their ability to reproduce experimental st
Four ionization potentials of elements from the second row of the Ž periodic table were computed with ab initio HF,