Analysis approximate factorization in iteration methods (Q1294522)

From MaRDI portal





scientific article; zbMATH DE number 1311276
Language Label Description Also known as
default for all languages
No label defined
    English
    Analysis approximate factorization in iteration methods
    scientific article; zbMATH DE number 1311276

      Statements

      Analysis approximate factorization in iteration methods (English)
      0 references
      0 references
      0 references
      0 references
      28 February 2000
      0 references
      The article is concerned with stiff systems of ordinary differential equations arising from spiritual discretization of time- and space-dependent partial differential equations. Since numerical solvers for corresponding initial value problems must necessarily be implicit for stability reasons, a large system of equations has to be solved in each time step. For the solution of the linear systems occurring in a corresponding Newton iteration, the authors propose a parallel iterative solver based on an approximate factorization of the matrix. In particular, convergence and stability regions are derived.
      0 references
      iterative methods
      0 references
      parallel computation
      0 references
      stiff systems
      0 references
      Newton iteration
      0 references
      factorization
      0 references
      convergence
      0 references
      stability regions
      0 references
      0 references

      Identifiers

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