@incollection{fdi:40894,
  title = {{P}arallel {K}rylov subspace basis computation},
  author = {{S}idje, {R}.{B}. and {P}hilippe, {B}.},
  editor = {},
  language = {{ENG}},
  abstract = {{N}umerical methods related on {K}rylov subspaces are widely used in large sparse numerical linear algebra. {V}ectors in these subspaces are manipulated through their representation onto orthonormal bases. {N}owadays, on serial computers, the method of {A}rnoldi is considered as a reliable technique for constructing such bases. {U}nfortunately, this technique is rather inflexible to be efficiently implemented on parallel computers. {I}n this report we examine several parallel and stable algorithms based on the idea of {R}eichel et al. which retrieve at their completion the same information as the sequential {A}rnoldi's method. {W}e present timing results obtained from their implementations on the {I}ntel {P}aragon distributed-memory multiprocessor machine. ({R}{\'e}sum{\'e} d'auteur)},
  keywords = {{INFORMATIQUE} {SCIENTIFIQUE} ; {PROGRAMMATION} ; {METHODOLOGIE} ; {MEMOIRE} {INFORMATIQUE}},
  booktitle = {{A}ctes du deuxi{\`e}me colloque africain sur la recherche en informatique = {P}roceedings of the second {A}frican {C}onference on research in computer science},
  numero = {},
  pages = {421--439},
  address = {{P}aris},
  publisher = {{ORSTOM}},
  series = {{C}olloques et {S}{\'e}minaires},
  year = {1994},
  ISBN = {2-7099-1224-4},
  ISSN = {0767-2896},
  URL = {https://www.documentation.ird.fr/hor/fdi:40894},
}