<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01631022</id>
  <dt>j</dt>
  <an>01631022</an>
  <augroup>
    <au>Liu, Jinzhao</au>
    <au>Liang, Guoping</au>
    <au>Hu, Qiya</au>
  </augroup>
  <ti>The explicit scheme of Lagrangian multiplier domain decomposition method dependent on time.</ti>
  <so>Chin. J. Numer. Math. Appl. 23, No.2, 85-98 (2001); translation from Math. Numer. Sin. 23, No.1, 95-105 (2001).</so>
  <py>2001</py>
  <pu>Allerton Press, New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>non-matching grids</ut>
    <ut>Lagrange multiplier</ut>
    <ut>domain decomposition</ut>
    <ut>explicit scheme</ut>
    <ut>Uzawa algorithm</ut>
    <ut>condition number</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: We introduce and study an explicit scheme of the Lagrangian multiplier domain decomposition method dependent on time. The Uzawa algorithm is introduced to solve the interior displacement variables and the boundary multiplier variables. It is shown shown that the condition number of the stiffness matrix of the Lagrangian multiplier has a constant bound, i.e. $O(1)$. Numerical experiments indicate that the method is very efficient.</ab>
    <rv></rv>
  </abgroup>
</item>