Analysis and comparison of two general sparse solvers for distributed memory computers
ACM Transactions on Mathematical Software (TOMS)
Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
ACM Transactions on Mathematical Software (TOMS)
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Impact of reordering on the memory of a multifrontal solver
Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
An improved direct boundary element method for substrate coupling resistance extraction
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Distributed block independent set algorithms and parallel multilevel ILU preconditioners
Journal of Parallel and Distributed Computing
Parallel sparse LU factorization on second-class message passing platforms
Proceedings of the 19th annual international conference on Supercomputing
Constructing memory-minimizing schedules for multifrontal methods
ACM Transactions on Mathematical Software (TOMS)
Parallel sparse LU factorization on different message passing platforms
Journal of Parallel and Distributed Computing
Neural Networks for Predicting the Behavior of Preconditioned Iterative Solvers
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
On Using Reinforcement Learning to Solve Sparse Linear Systems
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
ACM Transactions on Mathematical Software (TOMS)
Evaluation of Sparse LU Factorization and Triangular Solution on Multicore Platforms
High Performance Computing for Computational Science - VECPAR 2008
A Parallel Matrix Scaling Algorithm
High Performance Computing for Computational Science - VECPAR 2008
Towards auction algorithms for large dense assignment problems
Computational Optimization and Applications
A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
Computers & Mathematics with Applications
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
Scaling and pivoting in an out-of-core sparse direct solver
ACM Transactions on Mathematical Software (TOMS)
Preconditioning Helmholtz linear systems
Applied Numerical Mathematics
A parallel approximation algorithm for the weighted maximum matching problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Heuristics for a matrix symmetrization problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Fast algorithms for placing large entries along the diagonal of a sparse matrix
Journal of Computational and Applied Mathematics
A robust ILU preconditioner using constraints diagonal Markowitz
Proceedings of the 48th Annual Southeast Regional Conference
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
SIAM Journal on Scientific Computing
Matching samples of multiple views
Data Mining and Knowledge Discovery
Partial factorization of a dense symmetric indefinite matrix
ACM Transactions on Mathematical Software (TOMS)
Improved Balanced Incomplete Factorization
SIAM Journal on Matrix Analysis and Applications
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
SIAM Journal on Scientific Computing
Improved Scaling for Quantum Monte Carlo on Insulators
SIAM Journal on Scientific Computing
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
A shared- and distributed-memory parallel sparse direct solver
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Maximum-weighted matching strategies and the application to symmetric indefinite systems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Using performance profiles to evaluate preconditioners for iterative methods
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Pivoting strategies for tough sparse indefinite systems
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.01 |
We consider bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various strategies for this and consider their implementation as computer codes. We also consider scaling techniques to further increase the relative values of the diagonal entries. Numerical experiments show the effect of the reorderings and the scaling on the solution of sparse equations by a direct method and by preconditioned iterative techniques.