Sökning: "conjugate residual"
Hittade 5 uppsatser innehållade orden conjugate residual.
1. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection
Master-uppsats, Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)Sammanfattning : This thesis presents a comparison of a GPU implementation of the Conjugate Residual method as a sequence of generic library kernels against implementations ofthe method with custom kernels to expose the performance gains of a keyoptimization strategy, kernel fusion, for memory-bound operations which is to makeefficient reuse of the processed data. For massive MIMO the iterative solver is to be employed at the linear detection stageto overcome the computational bottleneck of the matrix inversion required in theequalization process, which is 𝒪(𝑛3) for direct solvers. LÄS MER
2. Leveraging Posits for the Conjugate Gradient Linear Solver on an Application-Level RISC-V Core
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Emerging floating-point arithmetics provide a way to optimize the execution of computationally-intensive algorithms. This is the case with scientific computational kernels such as the Conjugate Gradient (CG) linear solver. Exploring new arithmetics is of paramount importance to maximize the accuracy and timing performance of these algorithms. LÄS MER
3. Master’s Thesis Project : Fibre-based preconditioner for granular matter simulation
Master-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : Simulating granular media at large scales is hard to do because of ill-conditioning of the associated linear systems and the ineffectiveness of available iterative methods. One common way to improve iterative methods is to use a preconditioner which involves finding a good approximation of a linear system A. LÄS MER
4. Sparse-Matrix support for the SkePU library for portable CPU/GPU programming
Master-uppsats, Linköpings universitet/Institutionen för datavetenskapSammanfattning : In this thesis work we have extended the SkePU framework by designing a new container data structure for the representation of generic two dimensional sparse matrices. Computation on matrices is an integral part of many scientific and engineering problems. Sometimes it is unnecessary to perform costly operations on zero entries of the matrix. LÄS MER
5. A comparison of two multilevel Schur preconditioners for adaptive FEM
Uppsats för yrkesexamina på avancerad nivå, Avdelningen för beräkningsvetenskapSammanfattning : There are several algorithms for solving the linear system of equations that arise from the finite element method with linear or near-linear computational complexity. One way is to find an approximation of the stiffness matrix that is such that it can be used in a preconditioned conjugate residual method, that is, a preconditioner to the stiffness matrix. LÄS MER
