Parallel Hybrid Sparse Linear System Solvers

Date

2020-07-01

Author

Manguoğlu, Murat
Sameh, Ahmed

Metadata

Show full item record

Item Usage Stats

235
views

0
downloads

URI

https://doi.org/10.1007/978-3-030-43736-7
https://hdl.handle.net/11511/82041

Relation

Parallel Algorithms in Computational Science and Engineering

Collections

Department of Computer Engineering, Book / Book chapter

Suggestions

OpenMETU
Core

Parallel Hybrid Sparse Linear System Solvers Manguoğlu, Murat; Sameh, Ahmed (Birkhäuser, 2020-01-01)
PARALLEL MULTILEVEL FAST MULTIPOLE ALGORITHM FOR COMPLEX PLASMONIC METAMATERIAL STRUCTURES Ergül, Özgür Salih (2013-11-09) A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast and accurate solutions of electromagnetics problems involving complex plasmonic metamaterial structures. Composite objects that consist of multiple penetrable regions, such as dielectric, lossy, and plasmonic parts, are formulated rigorously with surface integral equations and solved iteratively via MLFMA. Using the hierarchical strategy for the parallelization, the developed implementation is capable of simul...
Parallel decodable channel coding implemented on a MIMO testbed Aktaş, Tuğcan; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2007) This thesis considers the real-time implementation phases of a multiple-input multiple-output (MIMO) wireless communication system. The parts which are related to the implementation detail the blocks realized on a field programmable gate array (FPGA) board and define the connections between these blocks and typical radio frequency front-end modules assisting the wireless communication. Two sides of the implemented communication testbed are discussed separately as the transmitter and the receiver parts. In a...
Parallel solution of sparse triangular linear systems on multicore platforms Çuğu, İlke; Manguoğlu, Murat; Department of Computer Engineering (2018) Many large-scale applications in science and engineering require the solution of sparse linear systems. One well-known approach is to solve these systems by factorizing the coefficient matrix into nonsingular sparse triangular matrices and solving the resulting sparse triangular systems via backward and forward sweep (substitution) operations. This can be considered as a direct solver or it is part of the preconditioning operation in an iterative scheme if incomplete factorization is computed. Often, these ...
Parallel computations of three dimensional unsteady euler equations Ertunç, Özgür; Kavsaoğlu, Mehmet Ş.; Department of Aeronautical Engineering (1998)

Citation Formats

M. Manguoğlu and A. Sameh, Parallel Hybrid Sparse Linear System Solvers. 2020, p. 120.