A new approach to minimising the frontwidth in finite element calculations (Q1912069): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A frontal solution program for finite element analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A two‐step approach to finite element ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3785827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank | |||
Normal rank |
Latest revision as of 11:56, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new approach to minimising the frontwidth in finite element calculations |
scientific article |
Statements
A new approach to minimising the frontwidth in finite element calculations (English)
0 references
23 September 1996
0 references
We propose a new approach to determine the element ordering that minimises the frontwidth in finite element computations. The optimisation problem is formulated using graph theoretic concepts. We develop a divide-and-conquer strategy which defines a series of graph partitioning subproblems. The latter are tackled by means of three different heuristics, namely the Kernighan-Lin deterministic technique, and the non-deterministic simulated annealing and stochastic evolution algorithms. Results obtained for various two-dimensional and three-dimensional finite element meshes, whether structured or non-structured, reveal the superiority of the proposed approach relative to the standard algorithms.
0 references
non-deterministic simulated annealing algorithm
0 references
stochastic evolution algorithm
0 references
element ordering
0 references
graph theoretic concepts
0 references
graph partitioning subproblems
0 references
Kernighan-Lin deterministic technique
0 references
0 references