Skip to main content
SpringerLink
Log in

A bound for tridiagonal matrices

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Literature Cited

  1. V. P. Il'in, On Iterative Methods for Approximate Factorization [in Russian], Novosibirsk (1982). (Preprint, Academy of Sciences of the USSR, Siberian Branch, Computing Center, No. 98.)

  2. P. Concus, G. H. Golub, and G. Meurant, “Block preconditioning for the conjugate gradient method,” University of California, Berkeley, 1982. (Lawrence Bewrence Berkeley Labortory, Rep. LBL-14856.) SIAM J. Sci. Stat. Comput.,6, No. 1, 220–252 (1985).

    Google Scholar 

  3. V. P. Il'in and Yu. I. Kuznetsov, Tridiagonal Matrices and Their Applications [in Russian], Nauka, Moscow (1985).

    Google Scholar 

Download references

Authors
  1. S. A. Sander
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, No. 4, pp. 171–173, July–August, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sander, S.A. A bound for tridiagonal matrices. Sib Math J 30, 635–636 (1989). https://doi.org/10.1007/BF00971763

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation