A new approach to minimising the frontwidth in finite element calculations

DOI10.1016/0045-7825(94)90137-6zbMath0846.73061OpenAlexW1968221614MaRDI QIDQ1912069

O. Zone, Laurence A. Wolsey, Roland Keunings, Cid Carvalho De Souza

Publication date: 23 September 1996

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(94)90137-6

zbMATH Keywords

element orderinggraph partitioning subproblemsgraph theoretic conceptsKernighan-Lin deterministic techniquenon-deterministic simulated annealing algorithmstochastic evolution algorithm

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items

Graph bisection revisited ⋮ A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion ⋮ An exact algorithm for graph partitioning ⋮ An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem ⋮ A survey of direct methods for sparse linear systems ⋮ The node capacitated graph partitioning problem: A computational study ⋮ Speeding up a memetic algorithm for the max-bisection problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• An Efficient Heuristic Procedure for Partitioning Graphs
• A two‐step approach to finite element ordering
• A frontal solution program for finite element analysis