@Article{JCM-25-5,
author = {},
title = {A QR Decomposition Based Solver for the Least Squares Problems from the Minimal Residual Method for the Sylvester Equation},
journal = {Journal of Computational Mathematics},
year = {2007},
volume = {25},
number = {5},
pages = {531--542},
abstract = {<p style="text-align: justify;">Based on the generalized minimal residual (GMRES) principle, Hu and Reichel proposed a minimal residual algorithm for the Sylvester equation. The algorithm requires the solution of a structured least squares problem. They form the normal equations of the least squares problem and then solve it by a direct solver, so it is susceptible to instability. In this paper, by exploiting the special structure of the least squares problem and working on the problem directly, a numerically stable QR decomposition based algorithm is presented for the problem. The new algorithm is more stable than the normal equations algorithm of Hu and Reichel. Numerical experiments are reported to confirm the superior stability of the new algorithm.</p>},
issn = {1991-7139},
doi = {https://doi.org/2007-JCM-8711},
url = {https://global-sci.com/article/85025/a-qr-decomposition-based-solver-for-the-least-squares-problems-from-the-minimal-residual-method-for-the-sylvester-equation}
}