Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Parallel computations of three dimensional unsteady euler equations
Download
075644.pdf
Date
1998
Author
Ertunç, Özgür
Metadata
Show full item record
Item Usage Stats
140
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/1994
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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 linear system of equations
Seydim, A Yasemin; Kiper, Ayşe; Department of Computer Engineering (1989)
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 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 Hybrid Sparse Linear System Solvers
Manguoğlu, Murat; Sameh, Ahmed (Birkhäuser, 2020-01-01)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. Ertunç, “Parallel computations of three dimensional unsteady euler equations,” Middle East Technical University, 1998.