Skip to main content
SpringerLink
Log in

A hybrid laguerre method

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Conclusions

A method combining iterations of the Laguerre and modified Laguerre root-finding methods was developed to correct a problem of the modified Laguerre method with “paired approximations”. Experimental results indicate that this hybrid Laguerre method successfully separates approximation pairs which inhibit convergence in the modified Laguerre method.

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

References

  1. E. Hansen, M. Patrick and J. Rusnak,Some modifications of Laguerre's method, BIT 17 (1977), 409–417.

    Google Scholar 

  2. M. Leuze,Memory access patterns in vector machines with applications to problems in linear algebra, Ph.D. dissertation, Duke University, 1981.

Download references

Author information

Author notes

  1. Michael R. Leuze

    Present address: Department of Computer Science, Vanderbilt University, 37235, Nashville, Tennessee, USA

Authors and Affiliations

  1. Department of Computer Science, Duke University, 27706, Durham, N.C., USA

    Michael R. Leuze

Authors
  1. Michael R. Leuze
    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

Leuze, M.R. A hybrid laguerre method. BIT 23, 132–138 (1983). https://doi.org/10.1007/BF01937332

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation