An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

@article{Li2018AnEH,
  title={An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures},
  author={Shengguo Li and François-Henry Rouet and Jie Liu and Chun Huang and Xingyu Gao and Xuebin Chi},
  journal={J. Comput. Appl. Math.},
  year={2018},
  volume={344},
  pages={512-520}
}
Abstract In this paper, we propose an efficient divide-and-conquer (DC) algorithm for symmetric tridiagonal matrices based on ScaLAPACK and the hierarchically semiseparable (HSS) matrices. HSS is an important type of rank-structured matrices. The most computationally intensive part of the DC algorithm is computing the eigenvectors via matrix–matrixmultiplications (MMM). In our parallel hybrid DC (PHDC) algorithm, MMM is accelerated by using HSS matrix techniques when the intermediate matrix is… Expand
Identifying influential spreaders in complex networks based on improved k-shell method
TLDR
An improved algorithm based on the k-shell and node information entropy named IKS to identify influential spreaders from the higher shell as well as the lower shell is proposed and can be extended to large-scale networks. Expand
Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks
TLDR
This article comprehensively summarizes GT use in the SNs and explains the GT uses with sufficient concepts and examples to demonstrate the significance of graphs in SN modeling and analysis. Expand
Novel method for spreading information with fewer resources in scale-free networks
TLDR
A novel method for spreading information with fewer resources to request at most 80% participants to spread the information instead of requesting all participants in scale-free networks is proposed. Expand
An efficient algorithm for mining a set of influential spreaders in complex networks
TLDR
The experimental results in six real networks indicate that the spreaders identified by the method are more influential than several benchmark algorithms, including the discount degree method, VoteRank, LIR, k-shell and degree centrality. Expand
Efficient method for identifying influential vertices in dynamic networks using the strategy of local detection and updating
TLDR
The proposed local detection and updating method can be employed to efficiently identify the influential vertices and predict the changes in influence of specified sets of vertices in dynamic networks. Expand
Avalanche dynamics of a generalized earthquake model
Abstract Avalanche dynamics of the Olami–Feder–Christensen (OFC) models have been extensively studied using various topology of networks. Existing works generally assume that the seismic energy isExpand
Central attacks in complex networks: A revisit with new fallback strategy
TLDR
This work proposes a fallback strategy (a plan B) to attack a network in such a protected environment and shows that this strategy is the best approach when the prominent nodes are protected. Expand
Synchronization properties of interconnected network based on the vital node
TLDR
This paper strictly derive the eigenvalues of Laplacian matrix and the synchronizability of interconnected network and its simplest and equivalent network through utilizing the master stability function approach and finds the synchronIZability of connected network is identical to its simplestand equivalent network. Expand
Identification of nodes influence based on global structure model in complex networks
TLDR
This work proposes Global Structure Model (GSM) for influential nodes identification that considers self-influence as well as emphasizes on global influence of the node in the network and indicates that GSM outperformed the baseline algorithms in identification of influential node(s). Expand
A novel measure for influence nodes across complex networks based on node attraction
TLDR
This paper proposes a new method to identify influential nodes, namely Attraction based on Node and Community (ANC), and shows that the ANC algorithm is superior to the representative algorithms in terms of the accuracy and has lower time complexity. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem
TLDR
Comparing the ADCs with highly optimized multithreaded libraries such as Intel MKL, it is found that ADCs could be more than 6x times faster for some large matrices with few deflations. Expand
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
TLDR
A distributed-memory library for computations with dense structured matrices using Hierarchically Semi-Separable (HSS) representations and the compression algorithm that computes the HSS form of an input dense matrix relies on randomized sampling with a novel adaptive sampling mechanism. Expand
An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
TLDR
It is found that the singular vector matrices of a broken arrow matrix are Cauchy-like matrices and have an off-diagonal low-rank property, so they can be approximated efficiently by hierarchically semiseparable (HSS) matrices, so the complexity of computing singular vectors can be reduced significantly. Expand
A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
TLDR
This algorithm yields the first scalable, portable, and numerically stable parallel divide and conquer eigensolver and is compared with that of the QR algorithm and of bisection followed by inverse iteration on an IBM SP2 and a cluster of Pentium PIIs. Expand
An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
TLDR
A novel divide-and-conquer (DC) algorithm to compute the SVD of banded matrices is proposed, and further accelerate it by using rank-structured matrix techniques, especially the hierarchically semiseparable (HSS) matrix. Expand
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
  • P. Martinsson
  • Computer Science, Mathematics
  • SIAM J. Matrix Anal. Appl.
  • 2011
TLDR
The present paper demonstrates that if an $N\times N$ matrix can be applied to a vector in O(N) time, and if individual entries of the Matrix can be computed rapidly, then provided that an HSS representation of the matrix exists, it can be constructed in $O(N\,k^{2})$ operations. Expand
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
TLDR
A sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices, resulting in speedups up to sevenfold for problems in the test suite. Expand
Fast algorithms for hierarchically semiseparable matrices
TLDR
This paper generalizes the hierarchically semiseparable (HSS) matrix representations and proposes some fast algorithms for HSS matrices that are useful in developing fast-structured numerical methods for large discretized PDEs, integral equations, eigenvalue problems, etc. Expand
Parallel solution of partial symmetric eigenvalue problems from electronic structure calculations
The computation of selected eigenvalues and eigenvectors of a symmetric (Hermitian) matrix is an important subtask in many contexts, for example in electronic structure calculations. If a significantExpand
Fast algorithms with applications to pdes
In the first part of this thesis we describe the rebus representation of a linear operator and present algorithms for working with linear systems in this form. The main contributions in the area ofExpand
...
1
2
3
4
5
...