ePubs
The open archive for STFC research publications
Home
About ePubs
Content Policies
News
Help
Privacy/Cookies
Contact ePubs
Full Record Details
Persistent URL
http://purl.org/net/epubs/work/12167941
Record Status
Checked
Record Id
12167941
Title
Element resequencing for use with a multiple front algorithm
Contributors
JA Scott (CCLRC Rutherford Appleton Lab.)
Abstract
The multiple front algorithm is an extension of the frontal method to allow parallelism to be exploited in the solution process. The finite-element domain is partitioned into a number of subdomains and a frontal decomposition is performed on each subdomain separately. For a given partitioning of the domain, the efficiency of the multiple front aigorithm depends on the ordering of the elements within each subdomain. We look at the limitations of existing element reordering algorithms when applied to a subdomain and consider how these limitations may be overcome. Extensive numerical experiments are performed on a range of practical problems and, on the basis of the results, we propose a new element resequencing algorithm for use with a multiple front algorithm.
Organisation
CCLRC
,
CSE
,
CSE-NAG
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language
English (EN)
Type
Details
URI(s)
Local file(s)
Year
Report
RAL Technical Reports
RAL-95-029. 1995.
RAL-95-029.pdf
1995
Showing record 1 of 1
Recent Additions
Browse Organisations
Browse Journals/Series
Login to add & manage publications and access information for OA publishing
Username:
Password:
Useful Links
Chadwick & RAL Libraries
SHERPA FACT
SHERPA RoMEO
SHERPA JULIET
Journal Checker Tool
Google Scholar