No label defined (Q3740127)

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 3974169
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3974169

      Statements

      0 references
      1986
      0 references
      iterative methods
      0 references
      decomposition in subspaces
      0 references
      minimal eigenvalue
      0 references
      bisection method
      0 references
      Lanczos method
      0 references
      cyclic matrix
      0 references
      block-relaxation methods
      0 references
      fictitious component method
      0 references
      [For the entire collection see Zbl 0589.00015.] Some iterative methods based on decomposition in subspaces are used to compute the minimal eigenvalue of the generalized eigenvalue problem (1) \(Au=\lambda Su\) where A, S are symmetric positive definite matrices. On an example of a matrix A which is the finite difference discretization of the Laplace operator on \(\Omega \subset {\mathbb{R}}^ 2\) the domain decomposition method is investigated using the bisection method for outer iterations and e.g. the Lanczos method as inner iterative process. In case A is an M-matrix or \(A_{\lambda}=A-\lambda S\) is a 2-cyclic matrix, the block-relaxation methods are implemented. Finally the fictitious component method is suggested to solve the problem (1). Some theoretical estimates of the number of arithmetic operations are included.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references