Parallel solution of linear system of equations

Download
006836.pdf
1989
Seydim, A Yasemin
Show full item record
102
views
0
downloads
https://hdl.handle.net/11511/8381
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

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)
Parallel Computation of 3-D Viscous Flows on Hybrid Grids
Ilgaz, Murat; Tuncer, İsmail Hakkı (2009-10-12)
In this study, a newly developed parallel finite-volume solver for 3-D viscous flows on hybrid grids is presented. The boundary layers in wall bounded viscous flows are discretized with hexahedral cells for improved accuracy and efficiency, while the rest of the domain is discretized by tetrahedral and pyramidal cells. The computations are performed in parallel in a computer cluster. The parallel solution algorithm with hybrid grids is based on domain decomposition which is obtained using the graph partitio...
Parallel solution of sparse linear systems to find the shortest path in large scale graphs
Arslan, Hilal; Manguoğlu, Murat (2018-06-29)
Solving the shortest path problem on large scale networks is crucial for many applications. As parallelism became more common with the advent of multi-core architectures as well as large and complex networks have begun to emerge in many settings, it is inevitable to come up with algorithms that take advantage of the current architectures. One alternative to solve the shortest path problem is to use one of the classical or improved parallel variations of the Dijkstra’s algorithm. However, when the size of th...
Parallel solution of soil-structure interaction problems on pc clusters
Bahçecioğlu, Tunç; Çetin, Kemal Önder; Department of Civil Engineering (2011)
Numerical assessment of soil structure interaction problems require heavy computational efforts because of the dynamic and iterative (nonlinear) nature of the problems. Furthermore, modeling soil-structure interaction may require finer meshes in order to get reliable results. Latest computing technologies must be utilized to achieve results in reasonable run times. This study focuses on development and implantation of a parallel dynamic finite element analysis method for numerical solution of soil-structure i...
Citation Formats
A. Y. Seydim, “Parallel solution of linear system of equations,” Middle East Technical University, 1989.
METU IIS - Integrated Information Service open@metu.edu.tr