Abstract
The implicit LU algorithm of the (basic) ABS class corresponds to the parameter choices H 1=I, z i =w i =e i . The algorithm can be considered as the ABS version of the classic LU factorization algorithm. In this paper we consider the generalization where the initial matrix H1 is arbitrary except for a certain condition. We prove that every algorithm in the ABS class is equivalent, in the sense of generating the same set of search directions, to a generalized implicit LU algorithm, with suitable initial matrix, that can be interpreted as a right preconditioning matrix. We discuss some consequences of this result, including a straightforward derivation of Bienaymé's (1853) classical result on the equivalence of the Gram–Schmidt orthogonalization procedure with Gaussian elimination on the normal equations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Abaffy, C.G. Broyden and E. Spedicato, A class of direct methods for linear systems, Numer. Math. 45 (1984) 361–376.
J. Abaffy and E. Spedicato, ABS Projection Algorithms: Mathematical Techniques for Linear and Nonlinear Equations (Ellis Horwood, Chichester, UK, 1989).
M. Benzi, A direct row projection method for sparse linear systems, Ph.D. dissertation, North Carolina State University (1993).
I.J. Bienaymé, Remarques sur les différences qui distinguent l'interpolation de M. Cauchy de la méthode des moindres carrées, et qui assurent la supériorité de cette méthode, C. R. Acad. Sci. Paris 37 (1853) 5–13.
E. Bodon, Numerical results on the ABS algorithms for linear systems of equations, Report DMSIA 9/93, University of Bergamo (1993).
Z. Chen and N. Deng, A general algorithm for underdetermined linear systems, in: Proc. of the 1st Internat. ABS Conf., Luoyang (September 1991), ed. E. Spedicato (University of Bergamo, 1992) pp. 1–13.
A. Galantai, ABS methods for the solution of linear and nonlinear systems of algebraic equations, Habilitation dissertation, University of Miskolc (1994).
F. Meng, X. Wang and Z. He, A theorem on W m being K i admissible, in: Proc. of the 2nd Internat. Conf. on ABS Methods, Beijing (June 1995), Report DMSIA 19/97, eds. E. Spedicato, Z. Li and L. Luksan (1997).
F. Sloboda, A parallel projection method for linear algebraic systems, Appl. Math. 23 (1978) 185–198.
H. Späth, Modified Gram–Schmidt for solving linear least squares problems is equivalent to Gaussian elimination for the normal equations, Aplicationes Mathematicae 20 (1990) 587–589.
E. Spedicato, Z. Xia and L. Zhang, The implicit LX method of the ABS class, Optim. Methods Software 8 (1997) 99–110.
E. Spedicato and M. Zhu, On the generalized implicit LU algorithm of the ABS class for linear systems, Report DMSIA 3/94, University of Bergamo (1994).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Spedicato, E., Zhu, M. A generalization of the implicit LU algorithm to an arbitrary initial matrix. Numerical Algorithms 20, 343–351 (1999). https://doi.org/10.1023/A:1019120304866
Issue Date:
DOI: https://doi.org/10.1023/A:1019120304866