An iterative substructuring algorithm for equilibrium equations

From MaRDI portal





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.











This page was built for publication: An iterative substructuring algorithm for equilibrium equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920575)