๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On ordering elements for a frontal solver

โœ Scribed by Scott, Jennifer A.

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
144 KB
Volume
15
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

โœฆ Synopsis

The eciency of the frontal method for the solution of ยฎnite-element problems depends on the order in which the elements are assembled. This paper looks at using variants of Sloan's algorithm to reorder the elements. Both direct and indirect reordering algorithms are considered and are used in combination with spectral orderings. Numerical experiments are performed on a range of practical problems and, on the basis of the results, a hybrid Sloan element resequencing algorithm is proposed for use with a frontal algorithm.

๐Ÿ“œ SIMILAR VOLUMES

A new row ordering strategy for frontal
A new row ordering strategy for frontal solvers
โœ Jennifer A. Scott ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 99 KB ๐Ÿ‘ 1 views

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

A frontal solver for the 21st century
A frontal solver for the 21st century
โœ Scott, Jennifer A. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB

In recent years there have been a number of important developments in frontal algorithms for solving the large sparse linear systems of equations that arise from รฟnite-element problems. We report on the design of a new fully portable and e cient frontal solver for large-scale real and complex unsymm