The sub-implicit method: New multiprocessor algorithms for old implicit codes (Q1111347)

From MaRDI portal





scientific article; zbMATH DE number 4076521
Language Label Description Also known as
default for all languages
No label defined
    English
    The sub-implicit method: New multiprocessor algorithms for old implicit codes
    scientific article; zbMATH DE number 4076521

      Statements

      The sub-implicit method: New multiprocessor algorithms for old implicit codes (English)
      0 references
      0 references
      0 references
      1988
      0 references
      The paper presents a new approach to the parallel solution of an implicit system of difference equations. The region of solution is split into subregions and the difference equations solved on each subregion. The solution on the boundaries between the subregions is then found by averaging. The method is illustrated for the one-dimensional heat equation. The method is suitable for implementation on parallel computers. The question of stability is not investigated but it is noted that the fully implicit method is not unconditionally stable.
      0 references
      multiprocessor algorithm
      0 references
      diffusion equation
      0 references
      domain splitting
      0 references
      parallel solution
      0 references
      implicit system
      0 references
      heat equation
      0 references
      stability
      0 references

      Identifiers

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