Skip to main content
SpringerLink
Log in

Algorithms for lambda-matrices

  • Published:
Numerische Mathematik 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. Lancaster, P.: Some applications of the Newton-Raphson method to non-linear matrix problems. Proc. Roy. Soc. A271, 324–331 (1963).

    Google Scholar 

  2. Brook-Taylor, D.: An attempt towards the improvement of the method of approximating in the extraction of the roots of equations in numbers. Phil. Trans. Roy. Soc. (London)30, 610–622 (1717).

    Google Scholar 

  3. Davidenko, D. F.: The evaluation of determinants by the method of variation of parameters. Soviet Math. Dokl.1, 316–319 (1960).

    Google Scholar 

  4. Schröder, E.: Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann.2, 317–365 (1870).

    Google Scholar 

  5. Lancaster, P.: A generalised Rayleigh-quotient iteration for lambda-matrices. Arch. Rat. Mech. Anal.8, 309–322 (1961).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Alberta, Calgary, Canada

    P. Lancaster

Authors
  1. P. Lancaster
    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

Lancaster, P. Algorithms for lambda-matrices. Numer. Math. 6, 388–394 (1964). https://doi.org/10.1007/BF01386088

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation