Convergence of the multigrid method for ill-conditioned block Toeplitz systems (Q5937106): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1021978020255 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W124312991 / rank
 
Normal rank

Latest revision as of 08:50, 30 July 2024

scientific article; zbMATH DE number 1618509
Language Label Description Also known as
English
Convergence of the multigrid method for ill-conditioned block Toeplitz systems
scientific article; zbMATH DE number 1618509

    Statements

    Convergence of the multigrid method for ill-conditioned block Toeplitz systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2002
    0 references
    The authors study the solutions of systems of equations with the so called block-Toeplitz-Toeplitz-block coefficient matrices (each block of the \(m \times m\) block-Toeplitz matrix is \(n \times n\) Toeplitz matrix). They are supposed to be generated by a nonnegative function with zeros. For a class of such matrices (the generating function is real-valued even) is shown that: (i) the convergence factor of the two-grid method is uniformly bounded below one independent of \(mn\) and (ii) the full multigrid method has convergence factor depending only on the number of the levels. In the case \(m=2^k-1\), \(n=2^l-1\) it is proved that the cost per iteration is \(O(mn \log mn)\). Results from numerical experiments with four different generating functions are presented and discussed.
    0 references
    Toeplitz matrices
    0 references
    numerical experiments
    0 references
    generating functions
    0 references
    multigrid methods
    0 references
    convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references