Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
type: Item
instance of: scholarly article
title: Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
zbMATH Open document ID: 1383.65030
author: Peng Zhang
published in: Cybernetics and Systems Analysis
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 6842766
zbMATH Keywords: algebraic eigenvalue problem
zbMATH Keywords: computer of hybrid architecture
zbMATH Keywords: hybrid algorithm
zbMATH Keywords: subspace iteration method
zbMATH Keywords: conjugate gradient methods
zbMATH Keywords: efficiency of parallel algorithms
zbMATH Keywords: numerical example
zbMATH Keywords: sparse matrices
describes a project that uses: SLEPc
describes a project that uses: SuiteSparse
describes a project that uses: Matlab
describes a project that uses: MAGMA
describes a project that uses: Netlib
describes a project that uses: Lis
describes a project that uses: MKL
describes a project that uses: CUDA
MaRDI profile type: Publication
full work available at URL: s10559-017-9996-5
OpenAlex ID: W2770746547
cites work: Q3321331
cites work: Q3886736
cites work: Q3666139
cites work: Q4348515
cites work: MATLAB Guide, Third Edition
DOI: 10.1007/S10559-017-9996-5
description: scientific article; zbMATH DE number 6842766