The use of profile reduction algorithms with a frontal code
From MaRDI portal
Publication:5203573
Recommendations
Cited in
(19)- Reversing the row order for the row-by-row frontal method
- scientific article; zbMATH DE number 4005436 (Why is no real title available?)
- 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
- A parallel frontal solver for finite element applications
- Multilevel hybrid spectral element ordering algorithms
- Two improved algorithms for envelope and wavefront reduction
- scientific article; zbMATH DE number 1062852 (Why is no real title available?)
- A new row ordering strategy for frontal solver
- scientific article; zbMATH DE number 1213968 (Why is no real title available?)
- 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
- A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
- An algorithm for frontwidth reduction
- scientific article; zbMATH DE number 3994910 (Why is no real title available?)
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)