Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Journal of Telecommunications and Information Technology

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: incomplete Cholesky factorization

Sortuj według:

Ogranicz wyniki do:

Preconditioned Conjugate Gradient Method for Solution of Large Finite Element Problems on CPU and GPU

Fialko S. Y., Zeglen F.

Journal of Telecommunications and Information Technology

2016

nr 2

26--33

In this article the preconditioned conjugate gradient (PCG) method, realized on GPU and intended to solution of large finite element problems of structural mechanics, is considered. The mathematical formulation of problem results in solution of linear equation sets with sparse symmetrical positive definite matrices. The authors use incomplete Cholesky factorization by value approach, based on technique of sparse matrices, for creation of efficient preconditioning, which ensures a stable convergence for weakly conditioned problems mentioned above. The research focuses on realization of PCG solver on GPU with using of CUBLAS and CUSPARSE libraries. Taking into account a restricted amount of GPU core memory, the efficiency and reliability of GPU PCG solver are checked and these factors are compared with data obtained with using of CPU version of this solver, working on large amount of RAM. The real-life large problems, taken from SCAD Soft collection, are considered for such a comparison.

Application of high-performance techniques for solving linear systems of algebraic equations

Grzonka D.

Journal of Telecommunications and Information Technology

2013

nr 4

85--91

Solving many problems in mechanics, engineering, medicine and other (e.g., diffusion tensor magnetic resonance imaging or finite element modeling) requires the efficient solving of algebraic equations. In many cases, such systems are very complex with a large number of linear equations, which are symmetric positive-defined (SPD). This paper is focused on improving the computational efficiency of the solvers dedicated for the linear systems based on incomplete and noisy SPD matrices by using preconditioning technique – Incomplete Cholesky Factorization, and modern set of processor instructions – Advanced Vector Extension. Application of these techniques allows to fairly reduce the computational time, number of iterations of conventional algorithms and improve the speed of calculation.