Designing and building algorithm for parallel solution of triangular systems based on server
Xing Fang
Abstract
Xing Fang
Abstract
A parallel algorithm is proposed,in which it’s A matrix is divided into several adjustable smaller matrix files to solve the problem that the matrix’s scale is larger than the memory’s capacity.Theoretically,this algorithm may solve the random scale matrix under the small condition of memory as long as it does not surpass the hard disk’s capacity.Finally,numerical experiments about the algorithm based on ABEEM model on Altix3700 are carried on,and it obtains the correct results and confirms the algorithms’ validity.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A parallel algorithm is proposed,in which it’s A matrix is divided into several adjustable smaller matrix files to solve the problem that the matrix’s scale is larger than the memory’s capacity.Theoretically,this algorithm may solve the random scale matrix under the small condition of memory as long as it does not surpass the hard disk’s capacity.Finally,numerical experiments about the algorithm based on ABEEM model on Altix3700 are carried on,and it obtains the correct results and confirms the algorithms’ validity.
Key concepts: Computer science, Algorithm, Matrix (chemical analysis), Scale (ratio), Parallel algorithm, Parallel computing, Quantum mechanics, Composite material