P. J. Eberlein

490 total citations
20 papers, 354 citations indexed

About

P. J. Eberlein is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computer Networks and Communications. According to data from OpenAlex, P. J. Eberlein has authored 20 papers receiving a total of 354 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 8 papers in Numerical Analysis and 4 papers in Computer Networks and Communications. Recurrent topics in P. J. Eberlein's work include Matrix Theory and Algorithms (18 papers), Advanced Optimization Algorithms Research (5 papers) and Interconnection Networks and Systems (4 papers). P. J. Eberlein is often cited by papers focused on Matrix Theory and Algorithms (18 papers), Advanced Optimization Algorithms Research (5 papers) and Interconnection Networks and Systems (4 papers). P. J. Eberlein collaborates with scholars based in United States and Australia. P. J. Eberlein's co-authors include John C. Boothroyd, Haesun Park, Govind S. Mudholkar and Bruce D. Shriver and has published in prestigious journals such as Communications of the ACM, Mathematics of Computation and SIAM Journal on Numerical Analysis.

In The Last Decade

P. J. Eberlein

19 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
P. J. Eberlein United States	11	248	118	60	58	53	20	354
Milvio Capovani Italy	7	251 1.0×	69 0.6×	47 0.8×	30 0.5×	44 0.8×	13	341
George Poole United States	9	134 0.5×	80 0.7×	51 0.8×	37 0.6×	18 0.3×	27	300
Hans J. Maehly United States	7	172 0.7×	139 1.2×	49 0.8×	18 0.3×	31 0.6×	8	427
C. T. Fike United States	6	181 0.7×	95 0.8×	68 1.1×	14 0.2×	41 0.8×	11	365
G. Lotti Italy	9	225 0.9×	68 0.6×	35 0.6×	42 0.7×	45 0.8×	54	392
William F. Moss United States	8	220 0.9×	73 0.6×	45 0.8×	24 0.4×	80 1.5×	24	495
Merrell L. Patrick United States	9	189 0.8×	243 2.1×	16 0.3×	30 0.5×	23 0.4×	29	414
V. N. Kublanovskaya Russia	9	327 1.3×	171 1.4×	33 0.6×	11 0.2×	41 0.8×	59	412
D. Noutsos Greece	11	355 1.4×	184 1.6×	56 0.9×	39 0.7×	114 2.2×	46	481
Warren E. Ferguson United States	9	138 0.6×	46 0.4×	80 1.3×	19 0.3×	108 2.0×	21	317

Countries citing papers authored by P. J. Eberlein

Since Specialization

Citations

This map shows the geographic impact of P. J. Eberlein'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 P. J. Eberlein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P. J. Eberlein more than expected).

Fields of papers citing papers by P. J. Eberlein

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by P. J. Eberlein. 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 P. J. Eberlein. The network helps show where P. J. Eberlein may publish in the future.

Co-authorship network of co-authors of P. J. Eberlein

This figure shows the co-authorship network connecting the top 25 collaborators of P. J. Eberlein. A scholar is included among the top collaborators of P. J. Eberlein 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 P. J. Eberlein. P. J. Eberlein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Eberlein, P. J., et al.. (1995). The real two-zero algorithm: a parallel algorithm to reduce a real matrix to a real Schur form. IEEE Transactions on Parallel and Distributed Systems. 6(1). 48–62. 2 indexed citations

Eberlein, P. J., et al.. (1993). Block recursive algorithm to generate Jacobi-sets. Parallel Computing. 19(5). 481–496. 8 indexed citations

Eberlein, P. J., et al.. (1993). New Jacobi-sets for parallel computations. Parallel Computing. 19(4). 437–454. 3 indexed citations

Eberlein, P. J. & Haesun Park. (1990). Efficient implementation of Jacobi algorithms and Jacobi sets on distributed memory architectures. Journal of Parallel and Distributed Computing. 8(4). 358–366. 36 indexed citations

Eberlein, P. J., et al.. (1989). Jacobi Sets for the Eigenproblem and Their Effect On Convergence Studied by Graphic Representations. 15–22. 3 indexed citations

Eberlein, P. J.. (1988). The Parallel Solution Of Eigenproblems On Multiprocessor Systems. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 826. 146–146. 2 indexed citations

Eberlein, P. J.. (1987). On One-Sided Jacobi Methods for Parallel Computation. SIAM Journal on Algebraic and Discrete Methods. 8(4). 790–796. 30 indexed citations

Eberlein, P. J.. (1985). On The Schur Decomposition of a Matrix for Parallel Computation. eCommons (Cornell University).

Eberlein, P. J., et al.. (1975). Global Convergence of the $QR$ Algorithm for Unitary Matrices with Some Results for Normal Matrices. SIAM Journal on Numerical Analysis. 12(1). 97–104. 16 indexed citations

10.

Eberlein, P. J.. (1971). A Note on the Matrices Denoted $B_n $. SIAM Journal on Applied Mathematics. 20(1). 87–92. 6 indexed citations

11.

Eberlein, P. J.. (1971). On the Diagonalization of Complex Symmetric Matrices. IMA Journal of Applied Mathematics. 7(3). 377–383. 10 indexed citations

12.

Eberlein, P. J.. (1970). Solution to the complex eigenproblem by a norm reducing Jacobi type method. Numerische Mathematik. 14(3). 232–245. 32 indexed citations

13.

Eberlein, P. J.. (1969). Remarks on the van der Waerden conjecture, II. Linear Algebra and its Applications. 2(3). 311–320. 16 indexed citations

14.

Shriver, Bruce D., et al.. (1969). Algorithm 361: permanent function of a square matrix I and II [G6]. Communications of the ACM. 12(11). 634–634. 3 indexed citations

15.

Eberlein, P. J. & Govind S. Mudholkar. (1968). Some remarks on the van der Waerden conjecture. Journal of Combinatorial Theory. 5(4). 386–396. 16 indexed citations

16.

Eberlein, P. J. & John C. Boothroyd. (1968). Solution to the Eigenproblem by a norm reducing Jacobi type method. Numerische Mathematik. 11(1). 1–12. 39 indexed citations

17.

Eberlein, P. J.. (1965). On Measures of Non-Normality for Matrices. American Mathematical Monthly. 72(9). 995–995. 23 indexed citations

18.

Eberlein, P. J.. (1964). A two parameter test matrix. Mathematics of Computation. 18(86). 296–298. 12 indexed citations

19.

Eberlein, P. J.. (1962). Errata: A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors. Journal of the Society for Industrial and Applied Mathematics. 10(2). 393–393. 12 indexed citations

20.

Eberlein, P. J.. (1962). A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix. Journal of the Society for Industrial and Applied Mathematics. 10(1). 74–88. 85 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