No label defined (Q3703183)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3930229
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3930229

      Statements

      0 references
      1985
      0 references
      monotonic tridiagonal matrices
      0 references
      diagonal dominance
      0 references
      Jacobi
      0 references
      Seidel
      0 references
      Buleev
      0 references
      incomplete factorization
      0 references
      progonka method
      0 references
      Let \(x_ k(k=1,2,...,\ell)\) be vectors (the k-th one of dimension \(m_ k)\), satisfying the system of equations \(B_ 1x_ 1-C_ 1x_ 2=f_ 1\), \(-A_ kx_{k-1}+B_ kx_ k-C_ kx_{k+1}=f_ k\), \(k=2,3,...,l- 1\), \(-A^{\ell}x_{l-1}+B_ lx_ l=f_ l\) where \(B_ k\) are square monotonic tridiagonal matrices of \(m_ k\)-th order, \(A_ k\) and \(C_ k\) matrices with nonnegative elements. Suppose that the blockwise tridiagonal matrix M of the entire system has the properties of diagonal dominance and of monotonicity (i.e. \(M^{-1}\) is a matrix with nonnegative elements). Such systems may be obtained, for example, when using a 5-point difference approximation for elliptic-type boundary-value problems. The author proposes a class of iterative algorithms to solve such systems of linear algebraic equations with monotonic blockwise-tridiagonal matrices. The class contains - as particular cases - well known blockwise methods of Jacobi and Seidel, Buleev method of incomplete factorization and also the iterationless matrix progonka method.
      0 references

      Identifiers