THE MULTILEVEL FAST MULTIPOLE ALGORITHM (MLFMA) FOR SOLVING LARGE-SCALE COMPUTATIONAL ELECTROMAGNETICS PROBLEMS Preface

Date

2014-01-01

Author

Ergül, Özgür Salih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

56
views

0
downloads

URI

https://hdl.handle.net/11511/54049

Journal

MULTILEVEL FAST MULTIPOLE ALGORITHM (MLFMA) FOR SOLVING LARGE-SCALE COMPUTATIONAL ELECTROMAGNETICS PROBLEMS

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

The finite element method for MHD flow at high Hartmann numbers Nesliturk, AI; Tezer, Münevver (Elsevier BV, 2005-01-01) A stabilized finite element method using the residual-free bubble functions (RFB) is proposed for solving the governing equations of steady magnetohydrodynamic duct flow. A distinguished feature of the RFB method is the resolving capability of high gradients near the layer rep-ions without refining mesh. We show that the RFB method is stable by proving that the numerical method is coercive even not only at low values but also at moderate and high values of the Hartmann number. Numerical results confirming t...
The stretching method and its support tool for weight assignment in multiple criteria decision making Boyacı, Nuri; Oğuztüzün, Halit; Department of Computer Engineering (2000)
The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs Toroslu, İsmail Hakkı (2023-01-01) The Floyd-Warshall algorithm is the most popular algorithm for determining the shortest paths between all vertex pairs in a graph. It is a very simple and an elegant algorithm. However, for graphs without any negative weighted edges, using Dijkstra's shortest path algorithm for every vertex as a source vertex to produce all-pairs shortest paths works significantly better than the Floyd-Warshall algorithm, especially for large graphs. Furthermore, for graphs with negative weighted edges, with no negative cyc...
The Multi-objective path placement optimization of parallel kinematic machines Küçük, Ali; Söylemez, Eres; Department of Mechanical Engineering (2013) The aim of this study is to obtain optimal position and orientation of a trajectory frame with respect to the fixed frame of the manipulator. The work path which is given in the trajectory frame is also constrained in the workspace of the 3 – PRS parallel kinematic machine. In the analysis, forward and inverse kinematics solutions are derived as well as the inverse dynamics model using Lagrange’s Method. Several algorithms governing the motion of the manipulator are developed. Moreover, optimization goals a...
The stochastic transfer function-nose model for the control of the upper heat content of the city gas. Karagözoğlu, Hüsnü; Department of Industrial Engineering (1980)

Citation Formats

Ö. S. Ergül, “THE MULTILEVEL FAST MULTIPOLE ALGORITHM (MLFMA) FOR SOLVING LARGE-SCALE COMPUTATIONAL ELECTROMAGNETICS PROBLEMS Preface,” MULTILEVEL FAST MULTIPOLE ALGORITHM (MLFMA) FOR SOLVING LARGE-SCALE COMPUTATIONAL ELECTROMAGNETICS PROBLEMS, pp. 0–0, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54049.