Skip to main content
SpringerLink
Log in

Binary cascades iterative refinement in doubled-mantissa arithmetics

  • Scientific Notes
  • Published:
BIT Numerical Mathematics 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

References

  1. Å. Björck,Iterative refinement of linear least squares solutions, BIT 7 (1967), 257–278.

    Google Scholar 

  2. A. Kiełbasiński,Iterative refinement for linear systems in variable precision arithmetic. BIT 21 (1981), 97–103.

    Google Scholar 

  3. A. Smoktunowicz and J. Sokolnicka,Solving linear least squares problems with very high relative accuracy (in progress).

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, 00-901, Warsaw, Poland

    Alicja Smoktunowicz & Jolanta Sokolnicka

Authors
  1. Alicja Smoktunowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jolanta Sokolnicka
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smoktunowicz, A., Sokolnicka, J. Binary cascades iterative refinement in doubled-mantissa arithmetics. BIT 24, 123–127 (1984). https://doi.org/10.1007/BF01934524

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation