Parallel computing in statistics

Download
010529.pdf
1990
Aybaş, Adnan İhsan
Show full item record
86
views
0
downloads
https://hdl.handle.net/11511/8396
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

PARALLEL COMPUTING IN STATISTICAL METHODS
Oltulu, Orçun; Gökalp Yavuz, Fulya; Department of Statistics (2022-8-17)
Cost-efficient data collection and storage methods enable scientists, companies, and even regular computer users to reach high-dimensional data sets faster and cheaper. Even though personal computers are getting more powerful and efficient, some algorithms, tasks, and problems still require too much computational power and time to run on a personal computer. For a few decades, parallelization in statistical computing had an increasing trend, and researchers put significant effort into converting or adjustin...
Parallel computing in linear mixed models
Gökalp Yavuz, Fulya (Springer Science and Business Media LLC, 2020-09-01)
In this study, we propose a parallel programming method for linear mixed models (LMM) generated from big data. A commonly used algorithm, expectation maximization (EM), is preferred for its use of maximum likelihood estimations, as the estimations are stable and simple. However, EM has a high computation cost. In our proposed method, we use a divide and recombine to split the data into smaller subsets, running the algorithm steps in parallel on multiple local cores and combining the results. The proposed me...
Parallel processing applications of string search algorithims an a transputer based network
Tiryaki, Rüştü Murat; Bilgen, Semih; Department of Electrical and Electronics Engineering (1997)
Parallel Approximation, and Integer Programming Reformulation
Patakı, Gabor; Tural, Mustafa Kemal (null; 2008-03-14)
We show that in a knapsack feasibility problem an integral vectorp, which is short, and nearparallel to the constraint vector gives a branching direction with small integer width.We use this result to analyze two computationally efficient reformulation techniques on lowdensity knapsack problems. Both reformulations have a constraint matrix with columns reducedin the sense of Lenstra, Lenstra, and Lov ́asz. We prove an upper bound on the integer widthalong the last variable, which becomes 1,when the density ...
Parallelization of noise subspace-based doa estimation algorithms on cpu and gpu
Eray, Hamza; Temizel, Alptekin; Department of Modeling and Simulation (2021-2-11)
Direction-of-Arrival (DOA) estimation is known as an active research area, and it is studied under array signal processing. The algorithms in this area are widely used in various applications such as sonar, search-and-rescue, navigation, and geolocation. However, achieving a real-time system performance is sometimes a challenging task for these algorithms. In this thesis, four noise subspace-based DOA estimation algorithms (PHD, MUSIC, EV, and MN) were considered and implemented in MATLAB, C/C++, and CUDA. ...
Citation Formats
A. İ. Aybaş, “Parallel computing in statistics,” Middle East Technical University, 1990.
METU IIS - Integrated Information Service open@metu.edu.tr