L. A. Hageman
- Computational Theory and Mathematics top 5%
- Numerical Analysis top 5%
- Computational Mechanics top 10%
- Aerospace Engineering top 10%
- Electrical and Electronic Engineering
- Co-authors
- David M. YoungE.M. GelbardT. A. PorschingRichard S. VargaR. Bruce KelloggFranklin T. LukJames A. Davis
- Topics
- Matrix Theory and Algorithms (5 papers)Advanced Optimization Algorithms Research (4 papers)Iterative Methods for Nonlinear Equations (3 papers)
- Partner nations
- United StatesJapan
In The Last Decade
L. A. Hageman
14 papers receiving 272 citations
Peers
Comparison fields: 5 of 75
- Computational Theory and Mathematics 117
- Numerical Analysis 111
- Computational Mechanics 96
- Aerospace Engineering 88
- Electrical and Electronic Engineering 41
Countries citing papers authored by L. A. Hageman
This map shows the geographic impact of L. A. Hageman'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 L. A. Hageman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. A. Hageman more than expected).
Fields of papers citing papers by L. A. Hageman
This network shows the impact of papers produced by L. A. Hageman. 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 L. A. Hageman. The network helps show where L. A. Hageman may publish in the future.
Co-authorship network of co-authors of L. A. Hageman
This figure shows the co-authorship network connecting the top 25 collaborators of L. A. Hageman. A scholar is included among the top collaborators of L. A. Hageman 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 L. A. Hageman. L. A. Hageman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 26 | |
| 2 | 24 | |
| 3 | Development and comparison of practical discretization methods for the neutron diffusion equation over general quadrilateral partitions | 2 |
| 4 | 98 | |
| 5 | DUZ-2: A PROGRAM FOR SOLVING AXISYMMETRIC AND PLANE ELASTIC-PLASTIC PROBLEMS ON THE CDC-6600 (LWBR Development Program). | 1 |
| 6 | 5 | |
| 7 | 58 | |
| 8 | 35 | |
| 9 | 9 | |
| 10 | SOLUTION OF THE DISCRETE ORDINATE EQUATIONS IN ONE AND TWO DIMENSIONS. | 8 |
| 11 | 6 | |
| 12 | ESTIMATING OPTIMUM ACCELERATION PARAMETERS FOR USE IN THE SUCCESSIVE OVERRELAXATION AND THE CHEBYSHEV POLYNOMIAL METHODS OF ITERATION. | 4 |
| 13 | 51 | |
| 14 | 19 |
About L. A. Hageman
L. A. Hageman is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Statistics, Probability and Uncertainty, having authored 14 papers that have together received 346 indexed citations. Recurring topics across this work include Matrix Theory and Algorithms (5 papers), Advanced Optimization Algorithms Research (4 papers) and Iterative Methods for Nonlinear Equations (3 papers). The work is most often cited by research in Numerical Analysis (111 citations), Computational Theory and Mathematics (117 citations) and Computational Mathematics (3 citations). L. A. Hageman has collaborated with scholars based in United States and Japan. Frequent co-authors include David M. Young, E.M. Gelbard, T. A. Porsching, Richard S. Varga, R. Bruce Kellogg, Franklin T. Luk and James A. Davis. Their work appears in journals such as Mathematics of Computation, SIAM Journal on Numerical Analysis and American Mathematical Monthly.
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.