NDLI: Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix

Content Provider	Springer Nature Link
Author	Reif, J. H.
Copyright Year	2001
Abstract	{This paper is concerned with the problem of computing the characteristic polynomial of a matrix. In a large number of applications, the matrices are symmetric and sparse : with O(n) non-zero entries. The problem has an efficient sequential solution in this case, requiring O(n 2 ) work by use of the sparse Lanczos method. A major remaining open question is: to find a polylog time parallel algorithm with matching work bounds. Unfortunately, the sparse Lanczos method cannot be parallelized to faster than time Ω (n) using n processors. Let M(n) be the processor bound to multiply two n \times n matrices in O(log n) parallel time. Giesbrecht [G2] gave the best previous polylog time parallel algorithms for the characteristic polynomial of a dense matrix with O (M(n)) processors. There is no known improvement to this processor bound in the case where the matrix is sparse. Often, in addition to being symmetric and sparse, the matrix has a sparsity graph (which has edges between indices of the matrix with non-zero entries) that has small separators. This paper gives a new algorithm for computing the characteristic polynomial of a sparse symmetric matrix, assuming that the sparsity graph is s(n) -separable and has a separator of size s(n)=O(n γ ) , for some γ , 0 < γ < 1 , that when deleted results in connected components of ≤α n vertices, for some 0 < α < 1 , with the same property. We derive an interesting algebraic version of Nested Dissection, which constructs a sparse factorization of the matrix A-λ I n where A is the input matrix and I n is the n \times n identity matrix. While Nested Dissection is commonly used to minimize the fill-in in the solution of sparse linear systems, our innovation is to use the separator structure to bound also the work for manipulation of rational functions in the recursively factored matrices. The matrix elements are assumed to be over an arbitrary field. We compute the characteristic polynomial of a sparse symmetric matrix in polylog time using P(n)(n+M(s(n))) ≤ P(n)(n+ s(n) 2.376 ) processors, where P(n) is the processor bound to multiply two degree n polynomials in O(log n) parallel time using a PRAM (P(n) = O(n) if the field supports an FFT of size n but is otherwise O(nlog log n) [CK]. Our method requires only that a matrix be symmetric and non-singular (it need not be positive definite as usual for Nested Dissection techniques). For the frequently occurring case where the matrix has small separator size, our polylog parallel algorithm has work bounds competitive with the best known sequential algorithms (i.e., the Ω(n 2 ) work of sparse Lanczos methods), for example, when the sparsity graph is a planar graph, s(n) ≤ O( \sqrt n ) , and we require polylog time with only P(n)n 1.188 processors.}
Starting Page	487
Ending Page	510
Page Count	24
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	29
Issue Number	3
e-ISSN	14320541
Language	English
Publisher	Springer-Verlag
Publisher Date	2001-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Algorithm Analysis and Problem Complexity Theory of Computation Mathematics of Computing Algorithms Computer Systems Organization and Communication Networks Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

Computing Sparse Multiples of Polynomials

Matrix Sparsification and the Sparse Null Space Problem

Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms

Better Size Estimation for Sparse Matrix Products

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP

Communication Complexity of Quasirandom Rumor Spreading

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

Sparse Normalized Local Alignment

Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix

Similar Documents

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

Computing Sparse Multiples of Polynomials

Matrix Sparsification and the Sparse Null Space Problem

Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms

Better Size Estimation for Sparse Matrix Products

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP

Communication Complexity of Quasirandom Rumor Spreading

A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

Sparse Normalized Local Alignment

Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix