论文信息 - A class of direct methods for linear systems

A class of direct methods for linear systems

SummaryA 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 andLLT factorization methods.

E. Spedicato | J. Abaffy | C. Broyden

[1] A. Householder. Terminating and Nonterminating Iterations for Solving Linear Systems , 1955 .

[2] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[3] K. Brown. A Quadratically Convergent Newton-Like Method Based Upon Gaussian-Elimination , 1968 .

[4] Robert Todd Gregory,et al. A collection of matrices for testing computational algorithms , 1969 .

[5] Christakis Charalambous,et al. Unconstrained optimization based on homogeneous models , 1973, Math. Program..

[6] G. Stewart. Conjugate direction methods for solving systems of linear equations , 1973 .

[7] H. Y. Huang. A direct method for the general solution of a system of linear equations , 1975 .

[8] Fridrich Sloboda,et al. Parallel method of conjugate directions for minimization , 1975 .

[9] E. Spedicato. A bound to the condition number of canonical rank-two corrections and applications to the variable metric method , 1975 .

[10] J. J. More,et al. Numerical comparison of three nonlinear equation solvers. [BRENTM, in FORTRAN for IBM computers] , 1976 .

[11] José Mario Martínez,et al. Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations , 1979 .

[12] Y. Saad. The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems , 1982 .