An iterative substructuring algorithm for equilibrium equations (Q920575)

From MaRDI portal





scientific article; zbMATH DE number 4164027
Language Label Description Also known as
default for all languages
No label defined
    English
    An iterative substructuring algorithm for equilibrium equations
    scientific article; zbMATH DE number 4164027

      Statements

      An iterative substructuring algorithm for equilibrium equations (English)
      0 references
      0 references
      0 references
      1990
      0 references
      The authors investigate an order reducing, preconditioned conjugate gradient method proposed by \textit{J. Barlow}, \textit{N. Nichols} and the second author [SIAM J. Sci. Stat. Comput. 9, 892-906 (1988; Zbl 0659.65040)] for solving the least squares problem with equality constraints formulation and relate the corresponding algorithm to another order reducing scheme known as the nullspace method. Convergence properties and the relation to the p-cyclic SOR theory of \textit{R. S. Varga} [Pac. J. Math. 9, 617-628 (1959; Zbl 0088.094)] are discussed. The authors suggest a mixed approach for solving equilibrium, consisting of both direct reduction in the substructures and the conjugate gradient iterative algorithm to complete the computations.
      0 references
      iterative substructuring algorithm
      0 references
      p-cyclic successive overrelaxation
      0 references
      equilibrium matrix
      0 references
      order reducing, preconditioned conjugate gradient method
      0 references
      least squares problem
      0 references
      nullspace method
      0 references
      direct reduction
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references