Aurél Galántai

775 total citations
39 papers, 476 citations indexed

About

Aurél Galántai is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Applied Mathematics. According to data from OpenAlex, Aurél Galántai has authored 39 papers receiving a total of 476 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 23 papers in Numerical Analysis and 5 papers in Applied Mathematics. Recurrent topics in Aurél Galántai's work include Matrix Theory and Algorithms (20 papers), Advanced Optimization Algorithms Research (18 papers) and Iterative Methods for Nonlinear Equations (11 papers). Aurél Galántai is often cited by papers focused on Matrix Theory and Algorithms (20 papers), Advanced Optimization Algorithms Research (18 papers) and Iterative Methods for Nonlinear Equations (11 papers). Aurél Galántai collaborates with scholars based in Hungary, Romania and Pakistan. Aurél Galántai's co-authors include Tibor K. Pogány, József K. Tar, Emilio Spedicato, Tibor Csendes and László Szeidl and has published in prestigious journals such as Mathematics of Computation, Journal of Mathematical Analysis and Applications and Computers & Mathematics with Applications.

In The Last Decade

Aurél Galántai

37 papers receiving 446 citations

Peers

Aurél Galántai
Aurél Galántai
Citations per year, relative to Aurél Galántai Aurél Galántai (= 1×) peers Ivan Slapničar

Countries citing papers authored by Aurél Galántai

Since Specialization
Citations

This map shows the geographic impact of Aurél Galántai's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aurél Galántai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aurél Galántai more than expected).

Fields of papers citing papers by Aurél Galántai

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aurél Galántai. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aurél Galántai. The network helps show where Aurél Galántai may publish in the future.

Co-authorship network of co-authors of Aurél Galántai

This figure shows the co-authorship network connecting the top 25 collaborators of Aurél Galántai. A scholar is included among the top collaborators of Aurél Galántai based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Aurél Galántai. Aurél Galántai is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Galántai, Aurél. (2024). Convergence of the Nelder-Mead Method for Convex Functions. Acta Polytechnica Hungarica. 21(10). 185–203. 1 indexed citations
2.
Galántai, Aurél. (2023). A Stochastic Convergence Result for the Nelder–Mead Simplex Method. Mathematics. 11(9). 1998–1998. 8 indexed citations
3.
Galántai, Aurél. (2021). A convergence analysis of the Nelder-Mead simplex method. Acta Polytechnica Hungarica. 18(5). 93–105. 16 indexed citations
4.
Galántai, Aurél, et al.. (2011). A globally convergent branch and bound algorithm for global minimization. 8. 205–208. 1 indexed citations
5.
Galántai, Aurél. (2009). The rank reduction procedure of Egerváry. Central European Journal of Operations Research. 18(1). 5–24. 5 indexed citations
6.
Galántai, Aurél, et al.. (2009). A study of accelerated Newton methods for multiple polynomial roots. Numerical Algorithms. 54(2). 219–243. 11 indexed citations
7.
Galántai, Aurél, et al.. (2008). Hyman’s method revisited. Journal of Computational and Applied Mathematics. 226(2). 246–258. 2 indexed citations
8.
Galántai, Aurél. (2007). A note on the generalized rank reduction. Acta Mathematica Academiae Scientiarum Hungaricae. 116(3). 239–246. 5 indexed citations
9.
Galántai, Aurél & Emilio Spedicato. (2007). ABS methods for nonlinear systems of algebraic equations. Aisberg (University of Bergamo). 1(1). 50–73. 2 indexed citations
10.
Galántai, Aurél, et al.. (2006). Jordan's principal angles in complex vector spaces. Numerical Linear Algebra with Applications. 13(7). 589–598. 38 indexed citations
11.
Galántai, Aurél. (2006). Subspaces, angles and pairs of orthogonal projections. Linear and Multilinear Algebra. 56(3). 227–260. 32 indexed citations
12.
Galántai, Aurél. (2005). Perturbation bounds for triangular and full rank factorizations. Computers & Mathematics with Applications. 50(7). 1061–1068. 2 indexed citations
13.
Galántai, Aurél. (2005). On the rate of convergence of the alternating projection method in finite dimensional spaces. Journal of Mathematical Analysis and Applications. 310(1). 30–44. 18 indexed citations
14.
Galántai, Aurél. (2004). Projectors and Projection Methods. CERN Document Server (European Organization for Nuclear Research). 87 indexed citations
15.
Galántai, Aurél. (2003). Perturbations of Triangular Matrix Factorizations. Linear and Multilinear Algebra. 51(2). 175–198. 4 indexed citations
16.
Galántai, Aurél. (2001). Rank reduction, factorization and conjugation. Linear and Multilinear Algebra. 49(3). 195–207. 8 indexed citations
17.
Galántai, Aurél. (2001). A study of Auchmuty's error estimate. Computers & Mathematics with Applications. 42(8-9). 1093–1102. 7 indexed citations
18.
Galántai, Aurél. (2000). The theory of Newton's method. Journal of Computational and Applied Mathematics. 124(1-2). 25–44. 123 indexed citations
19.
Galántai, Aurél. (2000). Rank reduction and conjugation. Miskolc mathematical notes/Mathematical notes. 1(1). 11–11. 4 indexed citations
20.
Galántai, Aurél. (1999). Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure. Computers & Mathematics with Applications. 38(9-10). 11–17. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026