Ronald B. Morgan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ronald B. Morgan has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Walter Wilcox
Department of Physics Baylor University 76798-7316 Waco TX
15 shared publications - Travis Whyte
Department of Physics Baylor University 76798-7316 Waco TX
4 shared publications - Paul Lashomb
Department of Physics Baylor University 76798 Waco TX USA
3 shared publications - Suman Baral
Department of Physics Baylor University 76798-7316 Waco TX
3 shared publications - Abdou Abdel-Rehim
The XXVI International Symposium on Lattice Field Theory July 14 -19 2008 Williamsburg Virginia USA
2 shared publications Baojiang Zhong
School of Computer Science and Technology Soochow University 215006 Suzhou China
2 shared publications
Latest Publications
- Open Access
- 27 August 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (5)
Polynomial Preconditioning for Indefinite Matrices
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices that make polynomial preconditioning more generally applicable. The new techniques include balancing the polynomial so that it produces a definite spectrum. Then a stability approach is given that is specialized for the indefinite case. Also, very complex spectra are examined. Then convergence estimates are given for polynomial preconditioning of real, indefinite spectra. Finally, tests are performed to find interior eigenvalues.
- 27 August 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (5)
Open AccessPolynomial Preconditioning for Indefinite Matrices
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices that make polynomial preconditioning more generally applicable. The new techniques include balancing the polynomial so that it produces a definite spectrum. Then a stability approach is given that is specialized for the indefinite case. Also, very complex spectra are examined. Then convergence estimates are given for polynomial preconditioning of real, indefinite spectra. Finally, tests are performed to find interior eigenvalues.
- Open Access
- 1 January 2025
- Published by Osterreichische Akademie der Wissenschaften, Verlag in ETNA - Electronic Transactions on Numerical Analysis
- Vol. 63, 129-149
Two-grid deflated Krylov methods for linear equations
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.
- 1 January 2025
- Published by Osterreichische Akademie der Wissenschaften, Verlag in ETNA - Electronic Transactions on Numerical Analysis
- Vol. 63, 129-149
Open AccessTwo-grid deflated Krylov methods for linear equations
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.
- Open Access
Multipolynomial Monte Carlo Trace Estimation
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a multilevel system. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Matrix deflation is used in three different ways: in the Monte Carlo levels, in the main solves, and in the deflation of the highest level double polynomial. A numerical comparison with optimized Hutchinson is performed on a quenched \(24^4\) lattice. The results demonstrate that the new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues.}Open AccessMultipolynomial Monte Carlo Trace Estimation
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a multilevel system. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Matrix deflation is used in three different ways: in the Monte Carlo levels, in the main solves, and in the deflation of the highest level double polynomial. A numerical comparison with optimized Hutchinson is performed on a quenched \(24^4\) lattice. The results demonstrate that the new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues.} - Open Access
- 27 December 2023
- Published by Sissa Medialab Srl
- Vol. 453, 039
Multipolynomial Monte Carlo Trace Estimation
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a multilevel system. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Matrix deflation is used in three different ways: in the Monte Carlo levels, in the main solves, and in the deflation of the highest level double polynomial. A numerical comparison with optimized Hutchinson is performed on a quenched \(24^4\) lattice. The results demonstrate that the new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues.- 27 December 2023
- Published by Sissa Medialab Srl
- Vol. 453, 039
Open AccessMultipolynomial Monte Carlo Trace Estimation
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a multilevel system. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Matrix deflation is used in three different ways: in the Monte Carlo levels, in the main solves, and in the deflation of the highest level double polynomial. A numerical comparison with optimized Hutchinson is performed on a quenched \(24^4\) lattice. The results demonstrate that the new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues. - 30 December 2021
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 29 (4) , e2427
Toward efficient polynomial preconditioning for GMRES
We present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial (the GMRES polynomial) and is more straightforward to compute and implement than many previous polynomial preconditioners. Our current implementation of this polynomial using its roots is naturally more stable than previous methods of computing the same polynomial. We implement further stability control using added roots, and this allows for high degree polynomials. We discuss the effectiveness and challenges of root‐adding and give an additional check for stability. In this article, we study the polynomial preconditioner applied to GMRES; however it could be used with any Krylov solver. This polynomial preconditioning algorithm can dramatically improve convergence for some problems, especially for difficult problems, and can reduce dot products by an even greater margin.
- 30 December 2021
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 29 (4) , e2427
Toward efficient polynomial preconditioning for GMRES
We present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial (the GMRES polynomial) and is more straightforward to compute and implement than many previous polynomial preconditioners. Our current implementation of this polynomial using its roots is naturally more stable than previous methods of computing the same polynomial. We implement further stability control using added roots, and this allows for high degree polynomials. We discuss the effectiveness and challenges of root‐adding and give an additional check for stability. In this article, we study the polynomial preconditioner applied to GMRES; however it could be used with any Krylov solver. This polynomial preconditioning algorithm can dramatically improve convergence for some problems, especially for difficult problems, and can reduce dot products by an even greater margin.
- Open Access
Disconnected Loop Subtraction Methods in Lattice QCD
Noise subtraction methods are a set of techniques that aim to reduce the variance of signals in LQCD which are often flooded with noise. The standard approach is a pertubative subtraction. In this work, we demonstrate the abilities of our new noise subtraction methods with methods which show considerable improvement over pertubative subtraction in the reduction of the variance for the set of LQCD operators that were studied. The methods were tested at $\kappa_{crit}$ on quenched configurations, as well as on dynamical quark configurations at $\kappa = 0.1453$. A significant improvement in the reduction of operator variance was observed in both cases.Open AccessDisconnected Loop Subtraction Methods in Lattice QCD
Noise subtraction methods are a set of techniques that aim to reduce the variance of signals in LQCD which are often flooded with noise. The standard approach is a pertubative subtraction. In this work, we demonstrate the abilities of our new noise subtraction methods with methods which show considerable improvement over pertubative subtraction in the reduction of the variance for the set of LQCD operators that were studied. The methods were tested at $\kappa_{crit}$ on quenched configurations, as well as on dynamical quark configurations at $\kappa = 0.1453$. A significant improvement in the reduction of operator variance was observed in both cases. - Open Access
Deflated GMRES with Multigrid for Lattice QCD
Lattice QCD solvers encounter critical slowing down for fine lattice spacings and small quark mass. Traditional matrix eigenvalue deflation is one approach to mitigating this problem. However, to improve scaling we study the effects of deflating on the coarse grid in a hierarchy of three grids for adaptive mutigrid applications of the two dimensional Schwinger model. We compare deflation at the fine and coarse levels with other non deflated methods. We find the inclusion of a partial solve on the intermediate grid allows for a low tolerance deflated solve on the coarse grid. We find very good scaling in lattice size near critical mass when we deflate at the coarse level using the GMRES-DR and GMRES-Proj algorithms.
Open AccessDeflated GMRES with Multigrid for Lattice QCD
Lattice QCD solvers encounter critical slowing down for fine lattice spacings and small quark mass. Traditional matrix eigenvalue deflation is one approach to mitigating this problem. However, to improve scaling we study the effects of deflating on the coarse grid in a hierarchy of three grids for adaptive mutigrid applications of the two dimensional Schwinger model. We compare deflation at the fine and coarse levels with other non deflated methods. We find the inclusion of a partial solve on the intermediate grid allows for a low tolerance deflated solve on the coarse grid. We find very good scaling in lattice size near critical mass when we deflate at the coarse level using the GMRES-DR and GMRES-Proj algorithms.
- 27 March 2019
- Published by Elsevier in Computer Physics Communications
- Vol. 241, 64-79
Disconnected loop subtraction methods in lattice QCD
- 27 March 2019
- Published by Elsevier in Computer Physics Communications
- Vol. 241, 64-79
Disconnected loop subtraction methods in lattice QCD
- Open Access
Disconnected Loop Subtraction Methods in Lattice QCD
Lattice QCD calculations of disconnected quark loop operators are extremely computer time-consuming to evaluate. To compute these diagrams using lattice techniques, one generally uses stochastic noise methods. These employ a randomly generated set of noise vectors to project out physical signals. In order to strengthen the signal in these calculations, various noise subtraction techniques may be employed. In addition to the standard method of perturbative subtraction, one may also employ matrix deflation techniques using the GMRES-DR and MINRES-DR algorithms as well as polynomial subtraction techniques to reduce statistical uncertainty. Our matrix deflation methods play two roles: they both speed up the solution of the linear equations as well as decrease numerical noise. We show how to combine deflation with either perturbative and polynomial methods to produce extremely powerful noise suppression algorithms. We use a variety of lattices to study the effects. In order to set a benchmark, we first use the Wilson matrix in the quenched approximation. We see strong low eigenmode dominance at kappa critical ($\kappa_{crit}$) in the variance of the vector and scalar operators. We also use MILC dynamic lattices, where we observe deflation subtraction results consistent with the effectiveness seen in the quenched data.
Open AccessDisconnected Loop Subtraction Methods in Lattice QCD
Lattice QCD calculations of disconnected quark loop operators are extremely computer time-consuming to evaluate. To compute these diagrams using lattice techniques, one generally uses stochastic noise methods. These employ a randomly generated set of noise vectors to project out physical signals. In order to strengthen the signal in these calculations, various noise subtraction techniques may be employed. In addition to the standard method of perturbative subtraction, one may also employ matrix deflation techniques using the GMRES-DR and MINRES-DR algorithms as well as polynomial subtraction techniques to reduce statistical uncertainty. Our matrix deflation methods play two roles: they both speed up the solution of the linear equations as well as decrease numerical noise. We show how to combine deflation with either perturbative and polynomial methods to produce extremely powerful noise suppression algorithms. We use a variety of lattices to study the effects. In order to set a benchmark, we first use the Wilson matrix in the quenched approximation. We see strong low eigenmode dominance at kappa critical ($\kappa_{crit}$) in the variance of the vector and scalar operators. We also use MILC dynamic lattices, where we observe deflation subtraction results consistent with the effectiveness seen in the quenched data.
- Open Access
- 30 January 2017
- Published by Sissa Medialab Srl
- Vol. 256, 355
New Noise Subtraction Methods in Lattice QCD
Noise subtraction techniques can help reduce the statistical uncertainty in the extraction of hard to detect signals. We describe new noise subtraction methods in Lattice QCD which apply to disconnected diagram evaluations. Some of the noise suppression techniques include polynomial quark matrix methods, eigenspectrum deflation methods, and combination methods. Our most promising technique combines polynomial and Hermitian deflation subtraction methods. The overall goal is to improve the efficiency of Lattice QCD noise method algorithms.
- 30 January 2017
- Published by Sissa Medialab Srl
- Vol. 256, 355
Open AccessNew Noise Subtraction Methods in Lattice QCD
Noise subtraction techniques can help reduce the statistical uncertainty in the extraction of hard to detect signals. We describe new noise subtraction methods in Lattice QCD which apply to disconnected diagram evaluations. Some of the noise suppression techniques include polynomial quark matrix methods, eigenspectrum deflation methods, and combination methods. Our most promising technique combines polynomial and Hermitian deflation subtraction methods. The overall goal is to improve the efficiency of Lattice QCD noise method algorithms.