The arithmetic mean method for solving essentially positive systems on a vector computer
暂无分享,去创建一个
This paper is concerned with a generalization of the arithmetic mean method developed in [3] for solving large “essentially positive” dynamic systems which are asymptotically stable. This method is well suitable for parallel implementation on a multiprocessor system that can execute concurrently different tasks on a few vector processors with shared central memory, such as the CRAY X-MP. A high-level parallelism among independent tasks is obtained using the Cray multitasking. The consistency and the stability of the method are analysed.
[1] J. Gillis,et al. Matrix Iterative Analysis , 1961 .
[2] L. Kaufman,et al. Squeezing the most out of eigenvalue solvers on high-performance computers , 1986 .
[3] Valeria Ruggiero,et al. Solving large systems of linear ordinary differential equations on a vector computer , 1989, Parallel Comput..
[4] Garry J. Tee,et al. Integration of Equations of Parabolic Type by the Method of Nets , 1964 .