Summary
A class of methods of direct type for solving determined or underdetermined, full rank or deficient rank linear systems is presented and theoretically analyzed. The class can be considered as a generalization of the methods of Brent and Brown as restricted to linear systems and implicitly contains orthogonal,LU andLL T factorization methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abaffy, J.: A linearis egyenletrendszerek àltalànos megoldàsànak egy direkt mòdszerosztàlya. Alk. Mat. Lapok4, 233–240 (1979)
Abaffy, J., Spedicato, E. A generalization of Huang's method for solving systems of linear algebraic equations. BUMI, in press (1984)
Abaffy, J., Spedicato, E.: Computational experience with a class of direct methods for linear systems. Report SOFTMAT 1/83, University of Bergamo (1983)
Abaffy, J., Broyden, C.C., Spedicato, E.: A class of direct methods of Quasi-Newton type for general linear systems. Quaderno IAC/SOFTMAT, Rome, in press (1984)
Brent, R.P.: On maximizing the efficiency of algorithms for solving systems of nonlinear equations, Report 3725, IBM Scientific Centre, Yorktown Heights (1972)
Brown, K.M.: A quadratically convergent Newton-like method based upon gaussian elimination, Report TR 68/23, Cornell University (1968)
Broyden, C.G.: Numerical stability of conjugate gradient and similar algorithms. Communication; Mathematical Programming Conference, Bonn (1982)
Charalambous, C.: Unconstrained optimization based upon a homogeneous model. Mathem. Progr.5, 189–198 (1973)
Cosnard, M.: Sur quelques méthodes Newton-like de résolution de systèmes d' équations nonlinéaires. Report 239, Université de Grenoble (1975)
Gay, D.M.: Brown's method and some generalizations, with applications to minimization problems. Report TR 75/225, Cornell University, (1975)
Gregory R., Karnel, D.: A collection of matrices for testing computational algorithms. New York: Wiley 1969
Householder, A.: Terminating and nonterminating iterations for solving linear systems. J. Soc. Ind. Appl. Math.3, 67–72 (1955)
Huang, H.Y.: A direct method for the general solution of a system of linear equations. JOTA16, 429–445 (1975)
Martinez, J.: Generalization of the methods of Brent and Brown for solving nonlinear simultaneous equations. SIAM J. Numer. Analysis16, 434–448 (1979)
More, J.J., Cosnard, M.: Numerical comparison of three nonlinear equation solvers. Report TM 286, Argonne National Laboratory (1976)
Rosen, J.: The gradient projection method for nonlinear programming I: linear constraints. SIAM J. Appli. Math.8, 181–217 (1960)
Saad, Y.: The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems. SIAM J. Numer. Analysis19, 485–506 (1982)
Sloboda, F.: Parallel method of conjugate directions for minimization. Aplikace Matematiky20, 436–446 (1975)
Spedicato, E.: A bound on the condition number of rank-two updates and applications to variable metric methods. Calcolo12, 185–200 (1975)
Stewart, G.W.: Conjugate direction methods for solving systems of linear equations. Numer. Math.21, 285–297 (1973)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abaffy, J., Broyden, C. & Spedicato, E. A class of direct methods for linear systems. Numer. Math. 45, 361–376 (1984). https://doi.org/10.1007/BF01391414
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01391414