A partitioning algorithm for block-diagonal matrices with overlap

Guy Antoine Atenekeng Kahou; Laura Grigori; Masha Sosonkina

doi:10.1016/j.parco.2008.01.004

ScienceGate Book Chapters

JOURNAL ARTICLE

A partitioning algorithm for block-diagonal matrices with overlap

Guy Antoine Atenekeng Kahou Laura Grigori Masha Sosonkina

Year: 2008 Journal: Parallel Computing Vol: 34 (6-8)Pages: 332-344 Publisher: Elsevier BV

DOI: 10.1016/j.parco.2008.01.004

Get Full-Text PDF Get Analytical Report

Keywords:

Preconditioner Multiplicative function Diagonal Block matrix Mathematics Matrix (chemical analysis) Partition (number theory) Diagonal matrix Algorithm Sparse matrix Combinatorics Band matrix Matrix splitting Iterative method Square matrix Symmetric matrix Geometry Mathematical analysis Eigenvalues and eigenvectors

Metrics

Cited By

0.68

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

VLSI and FPGA Design Techniques

Physical Sciences → Engineering → Electrical and Electronic Engineering

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

A partitioning algorithm for block-diagonal matrices with overlap

Metrics

Citation History

Topics

Related Documents

Permuting Sparse Square Matrices Into Block Diagonal Form With Overlap

Permuting Sparse Square Matrices Into Block Diagonal Form With Overlap

A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

Block Diagonal Matrices

A look-ahead block schur algorithm for diagonal plus semiseparable matrices