Parallel numerical determination of the eigenvalues for symmetric tridiagonal matrices

Download
003575.pdf
1988
Yörük, Özant
Show full item record
46
views
0
downloads
https://hdl.handle.net/11511/8367
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Parallel computation of the diagonal of the inverse of a sparse matrix
Fasllija, Edona; Manguoğlu, Murat; Department of Computer Engineering (2017)
We consider the parallel computation of the diagonal of the inverse of a large sparse matrix. This problem is critical in many applications such as quantum mechanics and uncertainty quantification, where a subset of the entries of the inverse matrix, usually the diagonal, is required. A straightforward approach involves inverting the matrix explicitly and extracting the diagonal of the computed inverse. This approach, however, almost always is too costly for large sparse matrices since the inverse is often ...
Parallel computation of forward radiated noise of ducted fans with acoustic treatment
Özyörük, Yusuf (2002-03-01)
Forward radiated noise of ducted fans is computed numerically on parallel processors solving the three-dimensional, time-dependent Euler equations in body-conformed coordinates with a fourth-order-accurate, finite-difference, Runge-Kutta time-integration scheme. Sound attenuation effects of inlet wall acoustic treatment are included in computations employing a time-discrete form of the standard impedance condition. A distributed computing approach with domain decomposition is used for integrating the equati...
Parallel computation of flows around flapping airfoils in biplane configuration
Tuncer, İsmail Hakkı; Kaya, Muhammed Çağrı (2002-05-22)
Unsteady, laminar flows over flapping airfoils in biplane configuration are computed on overset grids. The overset grid solutions are obtained in parallel in a cluster environment. It is shown that airfoils in biplane configuration and oscillating in pitch and plunge with a proper phase shift between them enhance the thrust production significantly.
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 processing of two-dimensional euler equations for compressible flows
Doğru, Kazım; Aksel, M. Haluk; Tuncer, İsmail H.; Department of Mechanical Engineering (2000)
Citation Formats
Ö. Yörük, “Parallel numerical determination of the eigenvalues for symmetric tridiagonal matrices,” Middle East Technical University, 1988.
METU IIS - Integrated Information Service open@metu.edu.tr