Aneta Karaivanova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Aneta Karaivanova has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Emanouil Atanassov
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Sofia, Bulgaria
8 shared publications - Todor Gurov
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Sofia, Bulgaria
7 shared publications - Silvi-Maria Gurova
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences (IICT-BAS), Acad. G. Bonchev str., bl. 25A, 1113 Sofia, Bulgaria
4 shared publications - Jordan Iliev
National Centre for Information and Documentation, Sofia, Bulgaria
3 shared publications - Mariya Durchova
Institute of Information and Communication Technologies - Bulgarian Academy of Sciences (IICT-BAS)
3 shared publications - Peter Stanchev
Institute of Mathematics and Informatics - Bulgarian Academy of Sciences, Sofia, Bulgaria; Kettering University, Flint, USA
3 shared publications
Latest Publications
- 3 June 2026
- Published by Springer Nature
- p. 413-426
Eigenvalue Estimation in Portfolio Risk: The Role of Skipping and Leaping in Sobol and Halton Sequences
- 3 June 2026
- Published by Springer Nature
- p. 413-426
Eigenvalue Estimation in Portfolio Risk: The Role of Skipping and Leaping in Sobol and Halton Sequences
- 3 June 2026
- Published by Springer Nature
- p. 379-387
Novel Algorithm for Adaptive Circuit Construction for Quantum Kernel Methods
- 3 June 2026
- Published by Springer Nature
- p. 379-387
Novel Algorithm for Adaptive Circuit Construction for Quantum Kernel Methods
- Open Access
- 1 June 2026
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 26 (2) , 217-232
Supercomputer HEMUS: Benchmark Results and Performance Optimization
Supercomputers and advanced High-Performance Computing (HPC) systems are needed to address large scientific problems, AI models training or industrial/engineering tasks. One of the important steps during the installation, configuration and tuning stages, is to perform comprehensive benchmarking and obtain insights about the best ways of exploiting the systems capabilities. HEMUS is modern petascale heterogeneous HPC system. Benchmarking insights and optimization strategies from HEMUS are applicable to a broad class of contemporary HPC systems. In this paper we present results from general benchmarks, together with optimization strategies applied and the obtained conclusions. We also present benchmarks related to software simulation of quantum computing algorithms, as well as simulation using low-discrepancy sequences, as they cover a significant portion of the expected workload on the system. The results highlight the importance of careful tuning and optimization, demonstrating that significant performance gains can be achieved, with the proposed approaches broadly applicable across comparable HPC systems and workloads.
- 1 June 2026
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 26 (2) , 217-232
Open AccessSupercomputer HEMUS: Benchmark Results and Performance Optimization
Supercomputers and advanced High-Performance Computing (HPC) systems are needed to address large scientific problems, AI models training or industrial/engineering tasks. One of the important steps during the installation, configuration and tuning stages, is to perform comprehensive benchmarking and obtain insights about the best ways of exploiting the systems capabilities. HEMUS is modern petascale heterogeneous HPC system. Benchmarking insights and optimization strategies from HEMUS are applicable to a broad class of contemporary HPC systems. In this paper we present results from general benchmarks, together with optimization strategies applied and the obtained conclusions. We also present benchmarks related to software simulation of quantum computing algorithms, as well as simulation using low-discrepancy sequences, as they cover a significant portion of the expected workload on the system. The results highlight the importance of careful tuning and optimization, demonstrating that significant performance gains can be achieved, with the proposed approaches broadly applicable across comparable HPC systems and workloads.
- Open Access
- 29 September 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 7223-7249
On the Stochastic Power Algorithms for Estimating the Maximum Eigenvalue of Symmetric Matrices
Estimating the largest eigenvalue of large symmetric matrices is a critical problem in numerical linear algebra, with wide-ranging applications in science and engineering. Classical iterative methods, such as the Power method, are often computationally expensive or impractical for high-dimensional problems. To address this, we investigate two stochastic methods, Power Monte Carlo (PMC) and Power Quasi-Monte Carlo (PQMC), which integrate Markov chain-based simulations with classical Power iterations to estimate the maximum eigenvalue. These methods are designed to manage both systematic error (from iteration truncation) and stochastic error (from probabilistic sampling), enabling efficient eigenvalue computation even for large matrices. A main contribution of this study is the precise description of the methodology for constructing Almost Optimal PMC and PQMC algorithms, which can cover a broad class of symmetric matrices, including both sparse and dense structures. The algorithms employ a special choice of transition density matrices in constructing the Markov chain, which leads to a significantly reduced variance. Numerical experiments demonstrate that these algorithms outperform classical PMC/PQMC approaches in accuracy and computational complexity, particularly when using robust random number generators and low-discrepancy sequences. They demonstrate that it is vital to find the right balance between the number of steps in the Markov chain and the number of its simulations. Our findings provide new insights into the design of efficient stochastic algorithms for high-dimensional matrix problems and establish a foundation for further optimization and scalability.
- 29 September 2025
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 7223-7249
Open AccessOn the Stochastic Power Algorithms for Estimating the Maximum Eigenvalue of Symmetric Matrices
Estimating the largest eigenvalue of large symmetric matrices is a critical problem in numerical linear algebra, with wide-ranging applications in science and engineering. Classical iterative methods, such as the Power method, are often computationally expensive or impractical for high-dimensional problems. To address this, we investigate two stochastic methods, Power Monte Carlo (PMC) and Power Quasi-Monte Carlo (PQMC), which integrate Markov chain-based simulations with classical Power iterations to estimate the maximum eigenvalue. These methods are designed to manage both systematic error (from iteration truncation) and stochastic error (from probabilistic sampling), enabling efficient eigenvalue computation even for large matrices. A main contribution of this study is the precise description of the methodology for constructing Almost Optimal PMC and PQMC algorithms, which can cover a broad class of symmetric matrices, including both sparse and dense structures. The algorithms employ a special choice of transition density matrices in constructing the Markov chain, which leads to a significantly reduced variance. Numerical experiments demonstrate that these algorithms outperform classical PMC/PQMC approaches in accuracy and computational complexity, particularly when using robust random number generators and low-discrepancy sequences. They demonstrate that it is vital to find the right balance between the number of steps in the Markov chain and the number of its simulations. Our findings provide new insights into the design of efficient stochastic algorithms for high-dimensional matrix problems and establish a foundation for further optimization and scalability.
- Open Access
- 5 September 2025
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 15, 343-354
The 16th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
This paper gives a comprehensive overview of the current landscape and the ongoing efforts regarding open science at both national and international level, focusing on open access to scientific information, open data, and the Bulgarian Open Science Cloud.
- 5 September 2025
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 15, 343-354
Open AccessThe 16th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
This paper gives a comprehensive overview of the current landscape and the ongoing efforts regarding open science at both national and international level, focusing on open access to scientific information, open data, and the Bulgarian Open Science Cloud.
- Open Access
- 5 September 2024
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 14, 313-322
The 15th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
The paper gives an overview on the current landscape and the activities on both national and institutional level regarding Open Science, Open Access to scientific information, Open Data, and the Bulgarian Open Science Cloud.
- 5 September 2024
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 14, 313-322
Open AccessThe 15th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
The paper gives an overview on the current landscape and the activities on both national and institutional level regarding Open Science, Open Access to scientific information, Open Data, and the Bulgarian Open Science Cloud.
- 24 May 2024
- Published by Springer Nature
- p. 394-403
A Resolvent Quasi-Monte Carlo Method for Estimating the Minimum Eigenvalues Using the Error Balancing
- 24 May 2024
- Published by Springer Nature
- p. 394-403
A Resolvent Quasi-Monte Carlo Method for Estimating the Minimum Eigenvalues Using the Error Balancing
- Open Access
- 1 September 2023
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 13, 343-352
The 14th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
The paper gives an overview on the current landscape and the activities on national and institutional level regarding Open Science, Open Access to scientific information, Open Data, Bulgarian Open Science Cloud.
- 1 September 2023
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Digital Presentation and Preservation of Cultural and Scientific Heritage
- Vol. 13, 343-352
Open AccessThe 14th National Information Day: Open Science, Open Data, Open Access, Bulgarian Open Science Cloud
The paper gives an overview on the current landscape and the activities on national and institutional level regarding Open Science, Open Access to scientific information, Open Data, Bulgarian Open Science Cloud.
- 18 March 2022
- Published by Springer Nature
- p. 447-455
Monte Carlo Method for Estimating Eigenvalues Using Error Balancing
- 18 March 2022
- Published by Springer Nature
- p. 447-455
Monte Carlo Method for Estimating Eigenvalues Using Error Balancing
- 8 August 2020
- Published by Springer Nature
- p. 145-154
Optimization of the Direction Numbers of the Sobol Sequences
- 8 August 2020
- Published by Springer Nature
- p. 145-154
Optimization of the Direction Numbers of the Sobol Sequences