Skip to main content
SpringerLink
Log in

Incomplete Block Triangular Decompositions of Order l

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper, we present a special technique for improving the robustness of block triangular decompositions, for example those described in [1], that have proved their efficiency as preconditioners for the conjugate gradient method in a wide class of problems. The thorough theoretical analysis of this technique is carried out for the model problem, and the practical efficiency in the case of more complex problems is illustrated by numerical examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics Kaliningrad State University Al. Nevsky 14, Kaliningrad 236041 Russia e-mail: buzdin@mathc.albertina.ru, , , , , , RU

    A. A. Buzdin

  2. Department of Mathematics Kaliningrad State University Al. Nevsky 14, Kaliningrad 236041 Russia e-mail: dimitriy.logashenko@iwr.uni-heidelberg.de, , , , , , RU

    D. L. Logashenko

Authors
  1. A. A. Buzdin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. L. Logashenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received August 2, 1999; revised September 21, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buzdin, A., Logashenko, D. Incomplete Block Triangular Decompositions of Order l . Computing 64, 69–95 (2000). https://doi.org/10.1007/s006070050004

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070050004

Search

Navigation