The use of profile reduction algorithms with a frontal code

DOI10.1002/nme.1620281106zbMath0725.65045OpenAlexW2157807901MaRDI QIDQ5203573

Jennifer Scott, John K. Reid, Iain S. Duff

Publication date: 1989

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620281106

zbMATH Keywords

finite elementsGaussian eliminationsparse matrixreorderingfrontal codeprofile reduction algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (11)

Unnamed Item ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Unnamed Item ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ A survey of direct methods for sparse linear systems ⋮ Multilevel hybrid spectral element ordering algorithms ⋮ A review of frontal methods for solving linear systems ⋮ Simple heuristic algorithm for profile reduction of arbitrary sparse matrix ⋮ Unnamed Item ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system

This page was built for publication: The use of profile reduction algorithms with a frontal code