The use of profile reduction algorithms with a frontal code
From MaRDI portal
Publication:5203573
DOI10.1002/NME.1620281106zbMATH Open0725.65045OpenAlexW2157807901MaRDI QIDQ5203573FDOQ5203573
Authors: J. K. Reid, J. A. Scott, 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
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited In (19)
- Reversing the row order for the row-by-row frontal method
- Title not available (Why is that?)
- A survey of direct methods for sparse linear systems
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- Multilevel hybrid spectral element ordering algorithms
- A parallel frontal solver for finite element applications
- Title not available (Why is that?)
- Two improved algorithms for envelope and wavefront reduction
- A new row ordering strategy for frontal solver
- Title not available (Why is that?)
- A review of frontal methods for solving linear systems
- Frontal and profile methods of solving systems of linear algebraic equations in mixed finite element methods
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- A multilevel algorithm for wavefront reduction
- Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- An algorithm for frontwidth reduction
- A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
- Title not available (Why is that?)
This page was built for publication: The use of profile reduction algorithms with a frontal code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203573)
