Temat: Conjugate - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Preconditioned Conjugate Gradient Method for Solution of Large Finite Element Problems on CPU and GPU
Autorzy:: Fialko, S. Y.
Zeglen, F.
Powiązania:: https://bibliotekanauki.pl/articles/307602.pdf
Data publikacji:: 2016
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: conjugate gradient
incomplete Cholesky factorization
iterative solvers
NVIDIA CUDA
preconditioned conjugate gradient
Opis:: 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.
Źródło:: Journal of Telecommunications and Information Technology; 2016, 2; 26-33
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Efficient Iterative Detection Based on Conjugate Gradient and Successive Over-Relaxation Methods for Uplink Massive MIMO Systems
Autorzy:: Labed, Smail
Aounallah, Naceur
Powiązania:: https://bibliotekanauki.pl/articles/24200730.pdf
Data publikacji:: 2023
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: computational complexity
conjugate gradient
massive MIMO
relaxation parameter
signal detection
Opis:: Being a crucial aspect of ﬁfth-generation (5G) mobile communications systems, massively multiple-input multipleoutput (mMIMO) architectures are expected to help achieve the highest key performance indicators. However, the huge numbers of antennas used in such systems make it diﬃcult to determine the inversion of the signal channel matrix relied upon by several detection methods, hence posing a problem with accurate estimation of the symbols sent. In this paper, conjugate gradient (CG) and successive over-relaxation (SOR) methods are selected to construct a new iterative approach that avoids the matrix inversion computation issue. This suggested approach for uplink mMIMO detection is based on a joint cascade structure of both iterative methods. The CG method is ﬁrst applied and adjusted for the initial solution, followed by the SOR method in the ﬁnal iterations for terminal computations, resulting in an algorithm with robust performance and low computational complexity. Furthermore, the new hybrid scheme operates based on the relaxation parameter, whose value has a great impact on error performance and, whose optimal determination is necessary. Numerical simulations reveal that the proposed scheme is capable of signiﬁcantly improving signal detection accuracy with minimum complexity. The simulation results indicated that the proposed detector outperforms CG and SOR detectors, achieves close to optimal performance, requires fewer iterations, and reduces complexity.
Źródło:: Journal of Telecommunications and Information Technology; 2023, 2; 1--9
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Application of high-performance techniques for solving linear systems of algebraic equations
Autorzy:: Grzonka, D.
Powiązania:: https://bibliotekanauki.pl/articles/307729.pdf
Data publikacji:: 2013
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: Advanced Vector Extension
conjugate gradient method
incomplete Cholesky factorization
preconditioning
vector registers
Opis:: 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.
Źródło:: Journal of Telecommunications and Information Technology; 2013, 4; 85-91
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Conjugate" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język