CALCOLO

, Volume 24, Issue 3–4, pp 241–246 | Cite as

Variationally derived algorithms in the ABS class for linear systems

  • E. Spedicato
Article

Abstract

Algorithms in the ABS class of direct methods for linear systems are considered where the correction to the projection matrix minimizes a weighted Frobenius norm. These algorithms define implicit factorizations of the coefficient matrix which do not require pivoting. The implicit Gram-Schmidt algorithm is obtained when using the unweighted norm.

AMS Subject Classification

65F05 

Key words

Linear algebra ABS class 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Abaffy, C. G. Broyden, E. Spedicato,A class of direct methods for linear systems, Numer. Math.45, (1984) 361–376.MATHCrossRefGoogle Scholar
  2. [2]
    H. Y. Huang,A direct method for the general solution of a system of linear equations, JOTA16, (1975) 429–446.MATHCrossRefGoogle Scholar
  3. [3]
    J. Greenstadt,Variations on variable metric methods, Math. Comp.24, (1970) 1–22.MATHCrossRefGoogle Scholar
  4. [4]
    J. Greenstadt, E. Spedicato,On some classes of variationally derived Quasi-Newton methods for systems of nonlinear algebraic equations, Numer. Math.29, (1978) 363–380.MATHCrossRefGoogle Scholar
  5. [5]
    R. P. Tewarson,On the use of generalized inverses in function minimization, Computing6, (1970) 241–248.MATHCrossRefGoogle Scholar
  6. [6]
    J. E. Dennis, R. E. Schnabel,Least change secant updates for Quasi-Newton methods, SIAM Rev.21, (1979) 443–459.MATHCrossRefGoogle Scholar
  7. [7]
    J. Flachs,On the generation of updates for Quasi-Newton methods, Report NRIMS/W/76/6, Pretoria (1982).Google Scholar
  8. [8]
    E. Spedicato,A subclass of variationally derived algorithms in the ABS class for linear systems, Report 202, Institut fur Angewandte Mathematik, University of Wurzburg (1987).Google Scholar
  9. [9]
    S. Oren, E. Spedicato,Optimal conditioning of self-scaling variable metric algorithms, Math. Programming 10, (1976) 70–90.MATHCrossRefGoogle Scholar
  10. [10]
    S. W. Thomas,Sequential estimation techniques for Quasi-Newton algorithms, Report TR 75/227, Cornell University (1975).Google Scholar

Copyright information

© Instituto di Elaborazione della Informazione del CNR 1987

Authors and Affiliations

  • E. Spedicato
    • 1
  1. 1.Istituto Universitario di BergamoBergamoItaly

Personalised recommendations