Cobra: Parallel path following for computing the matrix pseudospectrum

被引:13
作者
Bekas, C [1 ]
Gallopoulos, E [1 ]
机构
[1] Univ Patras, Dept Comp Engn & Informat, GR-26500 Patras, Greece
关键词
path following; matrix pseudospectrum; parallel computing; singular value decomposition; partial SVD; shared-memory multiprocessors; NUMA; SGI origin;
D O I
10.1016/S0167-8191(01)00121-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The construction of an accurate approximation of the is an element of -pseudospectrum of a matrix by means of the standard grid method is a very demanding computational task. In this paper, we describe Cobra. a domain-based method for the computation of pseudospectra that combines predictor corrector path following with a one-dimensional grid. The algorithm offers large and medium grain parallelism and becomes particularly attractive when we seek fine resolution of the pseudospectrum boundary. We implement Cobra using standard LAPACK components and show that it is more robust than the existing path following technique and faster than it and the traditional grid method. Cobra is also combined with a partial SVD algorithm to produce an effective parallel method for computing the matrix pseudospectrum. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1879 / 1896
页数:18
相关论文
共 11 条
[1]  
Anderson E., 1995, LAPACK USERS GUIDE
[2]  
BEKAS C, COBRA PARALLEL PATH
[3]  
BRACONNIER T, 1996, 293 MANCH CTR COMP M
[4]   A curve tracing algorithm for computing the pseudospectrum [J].
Bruhl, M .
BIT NUMERICAL MATHEMATICS, 1996, 36 (03) :441-454
[5]  
DEMMEL J, 1995, SIAM PROC S, P528
[6]  
FRAYSSE V, 1996, LECT NOTES COMPUTER, V1067, P312
[7]  
Higham N.J., 1995, TEST MATRIX TOOLBOX
[8]  
Stewart G., 1990, MATRIX PERTURBATION
[9]  
Trefethen L. N., 1999, Acta Numerica, V8, P247, DOI 10.1017/S0962492900002932
[10]  
TREFETHEN LN, 1991, P 14 DUND C LONGM SC, P234