A. H. Sameh
D. J. Kuck
- 1 BANK, R E, AND ROSE, D J. Extrapolated fast d~rect algorithms for elhptlc boundary value problems In Algoruhms and Complextty, J F Traub, Ed, Academtc Press, New York, 1976Google Scholar
- 2 CSANKY, L Fast parallel matrix inversion algorithms SIAM J Comptng 5 (1976), 618-623Google Scholar
- 3 GILL, P E, Ex AL Methods for mo&fymg matrix factonzatlons Math Comput. 28 (1974), 505-535.Google Scholar
- 4 HAMM~RLIN6, S A note on modifications to the Givens plane rotaUon J ln~ Math. Appl 13 (1974), 215-218.Google Scholar
- 5 SAMEH, A , AND BRENT, R Solving triangular systems on a parallel computer To appear m SIAM J Numer AnalGoogle Scholar
- 6 SAMEIJ, A , AND Kucr, D Linear system solvers for parallel computers Rep No UIUCDCS-R-75- 701, Dept of Comptr So , U of llhnols at Urbana-Champalgn, Urbana, IU , Dec 1974Google Scholar
- 7 SAMFH, A , AND KtrcK, D A parallel QR algorithm for symmetric tndmgonal matrices. IEEE Trans Comptrs C-26 (1977), 147-153Google Scholar
- 8 SCnWARZ, H R, RUTISHAUSER, H., AND STIE~EL, E Numerical Analysts of Symmetric Matrices Transl by P. Hertelendy, Prentice-Hail, Englewood Chffs, N J , 1973Google Scholar
- 9 STONE, H S An efficient parallel algorithm for the solution of a tndiagonal hnear system of equations J ACM 20, 1 (1973), 27-38. Google Scholar
- 10 WILKINSON, J H The Algebrmc Etgenvalue Problem Oxford, New York, 1965 Google Scholar
Index Terms
- On Stable Parallel Linear System Solvers
Recommendations
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
FroCoS 2015: Proceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 9322SAT solvers are highly efficient programs that decide the satisfiability problem for propositional formulas in conjunctive normal form. Contemporary SAT solvers combine many advanced techniques such as clause sharing and inprocessing. Clause sharing is ...
Approximation algorithms for parallel machine scheduling with linear deterioration
This paper deals with a parallel machine scheduling problem. Different from fixed processing time assumption in the classical scheduling, a job's processing time is a simple linear increasing function of its starting time. The aim is makespan ...
Positive stable realizations of fractional continuous-time linear systems
Positive stable realizations of fractional continuous-time linear systemsConditions for the existence of positive stable realizations with system Metzler matrices for fractional continuous-time linear systems are established. A procedure based on the ...
Comments