A two-step jacobi-type iterative method for solving linear systems

Download
093418.pdf
2000
Erdal(Tarkan), Feride
Show full item record
35
views
0
downloads
https://hdl.handle.net/11511/7609
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A Non-iterative Domain Decomposition Method for Finite Element Analysis of 3D Electromagnetic Scattering Problems
Ozgun, Ozlem; Kuzuoğlu, Mustafa (2008-07-11)
In this paper, we generalize this algorithm to 3D scattering problems, and we demonstrate that the algorithm is actually non-iterative in problems involving smooth convex geometries (such as sphere, cube, missile, cone, plate, etc.) and some special geometries (such as inlet). The most distinguished feature of the algorithm is the utilization of the locally-conformal perfectly matched layer (PML) method along the boundaries of the subdomains. In this algorithm, the original computational domain is partition...
A numerically efficient frequency domain method for analysis of non Linear multi degree of freedom systems
Özer, Mehmet Bülent (2012-08-15)
Linear structural models contain mass, stiffness and damping matrices as well as a forcing vector. Once these matrices and the forcing vector are known, the response can be calculated through the methods of linear algebra. The system matrices of the linear model do not contain any terms that depend on the system response vector, therefore the calculation of the system response do not require an iterative procedure. On the other hand, frequency domain analysis of non-linear structural models generally contai...
A Broadband Multilevel Fast Multipole Algorithm with Incomplete-Leaf Tree Structures for Multiscale Electromagnetic Problems
Takrimi, Manouchehr; Ergül, Özgür Salih; Erturk, Vakur B. (2016-04-15)
An efficient, broadband, and accurate multilevel fast multipole algorithm (MLFMA) is proposed to solve a wide range of multiscale electromagnetic problems with orders of magnitude differences in the mesh sizes. Given a maximum RWG population threshold, only overcrowded boxes are recursively bisected into smaller ones, which leads to novel incomplete-leaf tree structures. Simulations reveal that, for surface discretizations possessing highly overmeshed local regions, the proposed method presents a more effic...
A broadband multilevel fast multipole algorithm with incomplete leaf tree structures for multiscale electromagnetic problems
Takrımı, Manouchehr; Ergül, Özgür Salih; Erturk, Vakur (2016-04-15)
A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem
Cinel, Sertac; Bazlamaçcı, Cüneyt Fehmi (Institute of Electrical and Electronics Engineers (IEEE), 2008-11-01)
Rectilinear Steiner minimal tree (RSMT) problem finds a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments and by using extra points if necessary. In this paper, to speedup the RSMT construction, two recently developed successful heuristic algorithms, namely rectilinear steiner tree (RST) by Zhou and hatched greedy algorithm (BGA) by Kahng et al., have been used as the basis. Following a slight modification on RST, which led to a nonrecursive and a con...
Citation Formats
F. Erdal(Tarkan), “A two-step jacobi-type iterative method for solving linear systems,” Middle East Technical University, 2000.
METU IIS - Integrated Information Service open@metu.edu.tr