Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
matrix reordering
Description:
A data-analysis technique that permutes matrix rows and columns to reveal structure or optimize a specified ordering criterion.
Primary topic:
Matrix Theory and Algorithms (61%)
Related topics:
Matrix Theory and Algorithms (61%),
Parallel Computing and Optimization Techniques (7%)
OpenAlex ID:
keywords/matrix-reordering
Direct Methods for Sparse Matrices
2017
·
I. S. Duff
, A. M. Erisman
, et al.
·
1,665
Preconditioning Techniques for Large Linear Systems: A Survey
2002
·
Michele Benzi
·
Journal of Computational Physics
·
1,478
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
1976
·
Norman E. Gibbs
, William G. Poole, Jr.
, et al.
·
SIAM Journal on Numerical Analysis
·
669
The Role of Elimination Trees in Sparse Factorization
1990
·
Joseph W.H. Liu
·
SIAM Journal on Matrix Analysis and Applications
·
585
Towards Better Analysis of Deep Convolutional Neural Networks
2016
·
Mengchen Liu
, Jiaxin Shi
, et al.
·
IEEE Transactions on Visualization and Computer Graphics
·
559
PDF
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
1992
·
Joseph W. H. Liu
·
SIAM Review
·
466
A new algorithm to calculate the nestedness temperature of presence–absence matrices
2006
·
Miguel A. Rodríguez‐Gironés
, Luis Santamaría
·
Journal of Biogeography
·
452
Computing the block triangular form of a sparse matrix
1990
·
Alex Pothen
, Chin-Ju Fan
·
ACM Transactions on Mathematical Software
·
430
PDF
The vec-permutation matrix, the vec operator and Kronecker products: a review
1981
·
Harold V. Henderson
, S. R. Searle
·
Linear and Multilinear Algebra
·
426
VAT: a tool for visual assessment of (cluster) tendency
2003
·
J.C. Bezdek
, R.J. Hathaway
·
International Joint Conference on Neural Networks (IJCNN)
·
390
Algorithm 837: AMD, an approximate minimum degree ordering algorithm
2004
·
Patrick R. Amestoy
, Timothy A. Davis
, et al.
·
ACM Transactions on Mathematical Software
·
385
Algorithm 230: Matrix Permutation
1964
·
J. Boothroyd
·
Communications of the ACM
·
377
Krylov Subspace Methods on Supercomputers
1989
·
Youcef Saad
·
SIAM Journal on Scientific and Statistical Computing
·
303
PDF
A Heuristic for Reducing Fill-In in Sparse Matrix Factorization.
1993
·
Thang Nguyen Bui
, Curt Jones
·
PPSC
·
298
Improving performance of sparse matrix-vector multiplication
1999
·
Ali Pinar
, Michael T. Heath
·
ACM/IEEE Conference on Supercomputing (SC)
·
295
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
1999
·
Iain S. Duff
, Jacko Koster
·
SIAM Journal on Matrix Analysis and Applications
·
276
Parallel Algorithms for Sparse Linear Systems
1991
·
Michael T. Heath
, Esmond Ng
, et al.
·
SIAM Review
·
272
Experimental study of ILU preconditioners for indefinite matrices
1997
·
Edmond Chow
, Yousef Saad
·
Journal of Computational and Applied Mathematics
·
264
PDF
Matrix Reordering Methods for Table and Network Visualization
2016
·
Michael Behrisch
, Benjamin Bach
, et al.
·
Computer Graphics Forum
·
254
PDF
Seriation and matrix reordering methods: An historical overview
2010
·
Innar Liiv
·
Statistical Analysis and Data Mining The ASA Data Science Journal
·
240
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
1978
·
I. S. Duff
, J. K. Reid
·
ACM Transactions on Mathematical Software
·
234
PDF
Improving the memory-system performance of sparse-matrix vector multiplication
1997
·
S. Toledo
·
IBM Journal of Research and Development
·
229
ggcorrplot: Visualization of a Correlation Matrix using 'ggplot2'
2016
·
Alboukadel Kassambara
·
197
PDF
Bandwidth reduction by automatic renumbering
1973
·
R. J. Collins
·
International Journal for Numerical Methods in Engineering
·
190
Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
1999
·
Michele Benzi
, Daniel B. Szyld
, et al.
·
SIAM Journal on Scientific Computing
·
164
Show more works
View as search
Works count:
822
Citation count:
19,330
Year
Topic
Type