Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems (Q2375537)

From MaRDI portal
Revision as of 09:18, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
scientific article

    Statements

    Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references
    Summary: The biconjugate \(A\)-orthogonal residual (BiCOR) method carried out in finite precision arithmetic by means of the biconjugate \(A\)-orthonormalization procedure may possibly tend to suffer from two sources of numerical instability, known as two kinds of breakdowns, similarly to those of the biconjugate gradient (BCG) method. This paper naturally exploits the composite step strategy employed in the development of the composite step BCG (CSBCG) method into the BiCOR method to cure one of the breakdowns called as pivot breakdown. Analogously to the CSBCG method, the resulting interesting variant, with only a minor modification to the usual implementation of the BiCOR method, is able to avoid near pivot breakdowns and compute all the well-defined BiCOR iterates stably on the assumption that the underlying biconjugate \(A\)-orthonormalization procedure does not break down. Another benefit acquired is that it seems to be a viable algorithm providing some further practically desired smoothing of the convergence history of the norm of the residuals, which is justified by numerical experiments. In addition, the exhibited method inherits the promising advantages of the empirically observed stability and fast convergence rate of the BiCOR method over the BCG method so that it outperforms the CSBCG method to some extent.
    0 references
    0 references
    biconjugate \(A\)-orthogonal residual method
    0 references
    biconjugate \(A\)-orthonormalization
    0 references
    biconjugate gradient method
    0 references
    pivot breakdown
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references