Search Results - "Reordering Algorithm"

Diversity enforced Genetic Algorithm (GA) for Binary Decision Diagram (BDD) reordering by Abdalhaq, Baker, Hawash, Amjad, Awad, Ahmed

“…Binary Decision Diagrams (BDDs) have become the state-of-art data structures in numerous fields, wherein, small-sized BDDs are required to reduce the companion…”
Get full text

An Efficient and Robust ILU(k) Preconditioner for Steady-State Neutron Diffusion Problem Based on MOOSE by Wu, Yingjie, Zhang, Han, Liu, Lixun, Tang, Huanran, Dou, Qinrong, Guo, Jiong, Li, Fu

“…Jacobian-free Newton Krylov (JFNK) is an attractive method to solve nonlinear equations in the nuclear engineering community, and has been successfully applied…”
Get full text

A Genetic Algorithm (GA) and Swarm-Based Binary Decision Diagram (BDD) Reordering Optimizer Reinforced With Recent Operators by Awad, Ahmed, Hawash, Amjad, Abdalhaq, Baker

“…The use of binary decision diagrams (BDDs) has proliferated in numerous fields. When a system criterion is formulated in form of a Boolean function, its BDD is…”
Get full text

SPM-GCN: An adaptive reordering algorithm for sparse LU factorization via GCN by Tian, Min, Liu, Huazeng, Wang, Junjie, Liu, Qi, Du, Wei, Zhang, Zanjun

“…Sparse LU factorization is a critical kernel in scientific computing and engineering applications. A better nonzero pattern of sparse matrixes can accelerate…”
Get full text

An Artificial Allocations Based Solution to the Label Switching Problem in Bayesian Analysis of Mixtures of Distributions by Papastamoulis, Panagiotis, Iliopoulos, George

“…Label switching is a well-known problem occurring in MCMC outputs in Bayesian mixture modeling. In this article we propose a formal solution to this problem by…”
Get full text

Low-power data encoding/decoding for energy-efficient static random access memory design by Pasandi, Ghasem, Mehrabi, Kolsoom, Ebrahimi, Behzad, Fakhraei, Sied Mehdi, Afzali-Kusha, Ali, Pedram, Massoud

“…This study presents a new energy-efficient design for static random access memory (SRAM) using a low-power input data encoding and output data decoding stages…”
Get full text

Optimization Research on Pedestrian Re Identification and Reordering Algorithm Based on Neighborhood Similarity by Hu, Zhiying

“…Person re-identification (ReID) accurately identifies the same pedestrian from multiple camera perspectives, and has broad application prospects in fields such…”
Get full text

Smoothed Multiple Binarization -- Using PQR Tree, Smoothing, Feature Vectors and Thresholding for Matrix Reordering by Medina, Bruno F., Kawakami, Willian H., da Silva, Maressa R., da Silva, Celmar G.

“…Finding appropriate permutations of rows and columns of a matrix may help users to see hidden patterns in datasets. This paper presents a set of…”
Get full text

Sequential Scheme of Full Composition Model for CO2 Flooding in Adaptive-Mesh System by Changhao, Xiao, Min, Wang, Xiaodong, Hu, Xiaoman, Wang, Zhifeng, Liu, Anfeng, Shi, Xiaohong, Wang

“…This paper implements a novel adaptive mesh methodology to sequential fully implicit method (SFI) of composition model for CO 2 flooding. Specific mesh…”
Get full text

Vectorial dynamic optimal power flow calculation including wind farms based on step-controlled primal-dual interior point method by Zhijun Qin, Yude Yang, Jiekang Wu

“…A vectorial implementation of dynamic optimal power flow (DOPF) including wind farms was presented. The vectorization of DOPF was established by arranging the…”
Get full text

Power system state estimation based on nonlinear programming by Yang Yude, Deng Lijun

“…State estimation base on a nonlinear programming model is presented (NLSE), which is applied the vectorization mode. We choose the L2 norm estimation as…”
Get full text

An ant colony hyperheuristic approach for matrix bandwidth reduction by Gonzaga de Oliveira, S.L., Silva, L.M.

“…This paper considers the bandwidth reduction problem for large-scale matrices in serial computations. A heuristic for bandwidth reduction reorders the rows and…”
Get full text

A Novel Approach to Find Pseudo–peripheral Vertices for Snay’s Heuristic by Sanderson Gonzaga de Oliveira, Júnior A. B. Bernardes

“…The solution of linear systems represented by Ax = b is fundamental in many numerical simulations in science and engineering. Reducing the profile of A can…”
Get full text

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices by Gonzaga de Oliveira, S. L., Carvalho, C.

“…This paper considers the bandwidth reduction problem for large-scale sparse matrices in serial computations. A heuristic for bandwidth reduction reorders the…”
Get full text

Evolving reordering algorithms using an ant colony hyperheuristic approach for accelerating the convergence of the ICCG method by de Oliveira, S. L. Gonzaga, Silva, L. M.

“…This paper proposes a novel ant colony hyperheuristic approach for reordering the rows and columns of symmetric positive definite matrices. This ant colony…”
Get full text

A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems by Bu, Yiming, Carpentieri, Bruno, Shen, Zhaoli, Huang, Ting-Zhu

“…In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for…”
Get full text

Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction: A Systematic Review by Chagas, Guilherme Oliveira, Oliveira, Sanderson L. Gonzaga de

“…Computational and storage costs of resolution of large sparse linear systems Ax=b can be performed by reducing the bandwidth of A. Bandwidth reduction consists…”
Get full text

An evaluation of low-cost heuristics for matrix bandwidth and profile reductions by Gonzaga de Oliveira, Sanderson L., Bernardes, Júnior A. B., Chagas, Guilherme O.

“…Hundreds of heuristics have been proposed to resolve the problems of bandwidth and profile reductions since the 1960s. We found 132 heuristics that have been…”
Get full text

Experiments with pseudoperipheral vertex finders for heuristics for bandwidth reduction evolved by an ant colony hyperheuristic approach by Gonzaga de Oliveira, Sanderson L., Martins Silva, Liberio

“…This article compares the results of the Diagonal Dominance algorithm with the George-Liu algorithm to find pseudo-peripheral vertices for heuristics for…”
Get full text

An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method by Gonzaga de Oliveira, Sanderson L., Bernardes, J. A. B., Chagas, G. O.

“…This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using…”
Get full text