Fast solution techniques for multimachine transient stability studies.

1976
Aygün, Yusuf
Show full item record
80
views
0
downloads
https://hdl.handle.net/11511/5990
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

FAST GRADIENT-BASED METHODS FOR BAYESIAN RECONSTRUCTION OF TRANSMISSION AND EMISSION PET IMAGES
Mumcuoğlu, Ünal Erkan; CHERRY, SR; ZHOU, ZHENYU (1994-12-01)
We describe conjugate gradient algorithms for reconstruction of transmission and emission PET images. The reconstructions are based on a Bayesian formulation, where the data are modeled as a collection of independent Poisson random variables and the image is modeled using a Markov random field. A conjugate gradient algorithm is used to compute a maximum a posteriori (MAP) estimate of the image by maximizing over the posterior density. To ensure nonnegativity of the solution, a penalty function is used to co...
Fast simulation and modeling of scattering from targets in MIMO imaging systems
Gül , Yunus Emre; Alatan, Lale; Department of Electrical and Electronics Engineering (2022-5-11)
The forward model analysis in a multiple input multiple output (MIMO) system requires the computation of the signals received by receiver antennas when various targets are illuminated by a transmitter antenna. The full wave analysis of such systems provides accurate results with high computational cost. Fast analysis of the system can be achieved by simple models based on several approximations which limits the accuracy. In this thesis, a modeling technique that provides better accuracy compared to simple m...
FAST CONSTRAINT GRAPH GENERATION ALGORITHMS FOR VLSI LAYOUT COMPACTION
TORUNOGLU, IH; ASKAR, M (1994-04-14)
Three new fast constraint graph generation algorithms, PPSS-1D, PPSS-1Dk and PPSS-2D, are presented for VLSI layout compaction. The algorithms are based on parallel plane sweep shadowing (PPSS). The PPSS-1D algorithm improves the time spent on searching processes from O(N/spl circ/1.5) to O(G*N) with extra O(G) memory where G is independent of N. PPSS-1Dk, the successor to PPSS-1D, eliminates the possibility of generation of unnecessary constraints using extra O(k*G) memory. PPSS-2D improves the O(NlogN) so...
Fast Algorithms for Digital Computation of Linear Canonical Transforms
Koc, Aykut; Öktem, Sevinç Figen; Ozaktas, Haldun M.; Kutay, M. Alper (2016-01-01)
Fast and accurate algorithms for digital computation of linear canonical transforms (LCTs) are discussed. Direct numerical integration takes O.N-2/time, where N is the number of samples. Designing fast and accurate algorithms that take O. N logN/time is of importance for practical utilization of LCTs. There are several approaches to designing fast algorithms. One approach is to decompose an arbitrary LCT into blocks, all of which have fast implementations, thus obtaining an overall fast algorithm. Another a...
Fast and accurate solutions of electromagnetics problems involving lossy dielectric objects with the multilevel fast multipole algorithm
Ergül, Özgür Salih (2012-03-01)
Fast and accurate solutions of electromagnetic scattering problems involving lossy dielectric objects are considered. Problems are formulated with two recently developed formulations, namely, the combined-tangential formulation (CTF) and the electric and magnetic current combined-field integral equation (JMCFIE), and solved iteratively using the multilevel fast multipole algorithm (MLFMA). Iterative solutions and accuracy of the results are investigated in detail for diverse geometries, frequencies, and con...
Citation Formats
Y. Aygün, “Fast solution techniques for multimachine transient stability studies.,” Middle East Technical University, 1976.
METU IIS - Integrated Information Service open@metu.edu.tr