Paul O. Frederickson

1.8k total citations · 1 hit paper
20 papers, 1.2k citations indexed

About

Paul O. Frederickson is a scholar working on Computational Mechanics, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Paul O. Frederickson has authored 20 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Mechanics, 7 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Paul O. Frederickson's work include Advanced Numerical Methods in Computational Mathematics (7 papers), Matrix Theory and Algorithms (5 papers) and Parallel Computing and Optimization Techniques (4 papers). Paul O. Frederickson is often cited by papers focused on Advanced Numerical Methods in Computational Mathematics (7 papers), Matrix Theory and Algorithms (5 papers) and Parallel Computing and Optimization Techniques (4 papers). Paul O. Frederickson collaborates with scholars based in United States, Germany and Canada. Paul O. Frederickson's co-authors include Timothy J. Barth, Ellen Yorke, James A. Yorke, James L. Kaplan, John R. Baumgardner, Oliver A. McBryan, Robert E. Hiromoto, A. C. Lazer, Karl Solchenbach and Burton Smith and has published in prestigious journals such as SIAM Journal on Numerical Analysis, Journal of Mathematical Analysis and Applications and Journal of Differential Equations.

In The Last Decade

Paul O. Frederickson

19 papers receiving 1.1k citations

Hit Papers

Higher order solution of ... 1990 2026 2002 2014 1990 100 200 300 400

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Paul O. Frederickson United States 10 548 360 239 162 87 20 1.2k
James H. Curry United States 12 219 0.4× 291 0.8× 231 1.0× 21 0.1× 98 1.1× 23 802
Harley Flanders United States 18 187 0.3× 231 0.6× 133 0.6× 310 1.9× 78 0.9× 98 1.7k
Olof Runborg Sweden 16 586 1.1× 343 1.0× 73 0.3× 115 0.7× 52 0.6× 51 1.5k
Oliver Junge Germany 20 199 0.4× 613 1.7× 208 0.9× 35 0.2× 78 0.9× 52 1.5k
Iliya V. Karlin Switzerland 29 2.2k 3.9× 522 1.4× 123 0.5× 405 2.5× 79 0.9× 72 2.8k
R. V. Churchill United States 6 170 0.3× 124 0.3× 53 0.2× 176 1.1× 53 0.6× 13 1.3k
E. J. Ding China 17 830 1.5× 598 1.7× 457 1.9× 67 0.4× 65 0.7× 72 1.7k
Valentin F. Zaitsev Russia 9 216 0.4× 654 1.8× 85 0.4× 184 1.1× 14 0.2× 13 1.8k
Steve Abbott United States 10 240 0.4× 132 0.4× 56 0.2× 371 2.3× 53 0.6× 49 1.3k
R. H. Hardin United States 11 151 0.3× 107 0.3× 260 1.1× 102 0.6× 115 1.3× 18 1.5k

Countries citing papers authored by Paul O. Frederickson

Since Specialization
Citations

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

Fields of papers citing papers by Paul O. Frederickson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paul O. Frederickson

This figure shows the co-authorship network connecting the top 25 collaborators of Paul O. Frederickson. A scholar is included among the top collaborators of Paul O. Frederickson 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 Paul O. Frederickson. Paul O. Frederickson 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.
Fehl, D. L., G. A. Chandler, W. A. Stygar, et al.. (2010). Characterization and error analysis of anN×Nunfolding procedure applied to filtered, photoelectric x-ray detector arrays. II. Error analysis and generalization. Physical Review Special Topics - Accelerators and Beams. 13(12). 3 indexed citations
2.
Fehl, D. L., G. A. Chandler, W. A. Stygar, et al.. (2010). Characterization and error analysis of anN×Nunfolding procedure applied to filtered, photoelectric x-ray detector arrays. I. Formulation and testing. Physical Review Special Topics - Accelerators and Beams. 13(12). 7 indexed citations
3.
Frederickson, Paul O.. (1996). High Performance Parallel Multigrid Algorithms for Unstructured Grids. NASA Technical Reports Server (NASA). 1 indexed citations
4.
Frederickson, Paul O. & Oliver A. McBryan. (1991). Normalized Convergence Rates for the PSMG Method. SIAM Journal on Scientific and Statistical Computing. 12(1). 221–229. 14 indexed citations
5.
McBryan, Oliver A., et al.. (1991). Multigrid methods on parallel computers—A survey of recent developments. Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft). 3(1). 1–75. 54 indexed citations
6.
Bailey, David A. & Paul O. Frederickson. (1991). Performance results for two of the NAS parallel benchmarks. 166–173. 8 indexed citations
7.
Barth, Timothy J. & Paul O. Frederickson. (1990). Higher order solution of the Euler equations on unstructured grids using quadratic reconstruction. 28th Aerospace Sciences Meeting. 427 indexed citations breakdown →
8.
Frederickson, Paul O.. (1989). Totally parallel multilevel algorithms for sparse elliptic systems. NASA Technical Reports Server (NASA). 2 indexed citations
9.
Frederickson, Paul O.. (1989). TOTALLY PARALLEL MULTILEVEL ALGORITHMS. 1(2). 233–245. 1 indexed citations
10.
Frederickson, Paul O. & Oliver A. McBryan. (1988). Intrinsically parallel multiscale algorithms for hypercubes. 2. 1726–1734. 2 indexed citations
11.
Frederickson, Paul O., Robert E. Hiromoto, & John L. Larson. (1987). A parallel Monte Carlo transport algorithm using a pseudo-random tree to guarantee reproducibility. Parallel Computing. 4(3). 281–290. 19 indexed citations
12.
Baumgardner, John R. & Paul O. Frederickson. (1985). Icosahedral Discretization of the Two-Sphere. SIAM Journal on Numerical Analysis. 22(6). 1107–1115. 193 indexed citations
13.
Frederickson, Paul O., et al.. (1985). Synchronization and control of parallel algorithms. Parallel Computing. 2(3). 255–264. 8 indexed citations
14.
Frederickson, Paul O., Robert E. Hiromoto, Thomas Jordan, Burton Smith, & Tony Warnock. (1984). Pseudo-random trees in Monte Carlo. Parallel Computing. 1(2). 175–180. 36 indexed citations
15.
Frederickson, Paul O., James L. Kaplan, Ellen Yorke, & James A. Yorke. (1983). The liapunov dimension of strange attractors. Journal of Differential Equations. 49(2). 185–207. 391 indexed citations
16.
Frederickson, Paul O.. (1971). Global solutions to certain nonlinear functional differential equations. Journal of Mathematical Analysis and Applications. 33(2). 355–358. 15 indexed citations
17.
Fink, A. M. & Paul O. Frederickson. (1971). Ultimate boundedness does not imply almost periodicity. Journal of Differential Equations. 9(2). 280–284. 10 indexed citations
18.
Frederickson, Paul O. & A. C. Lazer. (1969). Necessary and sufficient damping in a second-order oscillator. Journal of Differential Equations. 5(2). 262–270. 15 indexed citations
19.
Frederickson, Paul O.. (1966). Generalized series solution of an almost periodic differential equation. Journal of Differential Equations. 2(3). 243–264. 2 indexed citations
20.
Frederickson, Paul O., et al.. (1966). A density theorem for lacunary Fourier series. Bulletin of the American Mathematical Society. 72(1). 82–86.

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