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 T-MP. A high-level parallelism among independent tasks is obtained using the Cray multitasking. The consistency and the stability of the method are analysed. © 1990 Gordon and Breach, Science Publishers, Inc.
THE ARITHMETIC MEAN METHOD FOR SOLVING ESSENTIALLY POSITIVE SYSTEMS ON A VECTOR COMPUTER
RUGGIERO, Valeria
1990
Abstract
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 T-MP. A high-level parallelism among independent tasks is obtained using the Cray multitasking. The consistency and the stability of the method are analysed. © 1990 Gordon and Breach, Science Publishers, Inc.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
