Abstract Subject and purpose of work: The aim the work is to present compare results selected procedures for assessing linear ordering methods. considerations were carried out on example taxonomic measures security cryptocurrency exchanges. Materials methods: Publicly available data published internet portals used assess Composite indicators created using standardized sum method. selection fina...

The optimal table row and column ordering can reveal useful patterns to improve reading and interpretation. Recently, genetic algorithms using standard crossover and mutation operators have been proposed to tackle this problem. In this paper, we carry out an experimental study that adds to this genetic algorithm crossover and mutation operators specially designed to deal with permutations and i...

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the bandwidth adaptively for each row of the Cholesky factor, using a novel penalty we call nested Lasso. This structure has more flexibility than regular banding, ...

Many problems in science and engineering require the solving of linear systems of equations. As the problems get larger it becomes increasingly important to exploit the sparsity inherent in many such linear systems. It is well recognized that finding a fill-reducing ordering is crucial to the success of the numerical solution of sparse linear systems. The use of hybrid ordering partitioner is e...

We develop a new algorithm for performing parallel Sn sweeps on unstructured meshes. The algorithm uses a low-complexity list ordering heuristic to determine a sweep ordering on any partitioned mesh. For typical problems and with \normal" mesh partitionings we have observed nearly linear speedups on up to 126 processors. This is an important and desirable result, since although analyses of stru...