Skip to main content
Log in

Generalization of inequalities by carmichael and mason and by parodi

Verallgemeimerung von Ungleichungen von Carmichael und Mason und von Parodi

  • Short Communication
  • Published:
Computing Aims and scope Submit manuscript

Abstract

We find upper bounds for the latent roots of a λ-matrix. The bounds obtained are, for complex polynomials, the classical ones of Carmichael and Mason and Parodi.

Zusammenfassung

Wir leiten obere Schranken für die Eigenwerte von λ-Matrizen her. Für komplexe Polynome erhält man die klassischen Schranken von Carmichael und Mason und von Parodi.

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

Access this article

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

Instant access to the full article PDF.

References

  1. Carmichael, R. D., Mason, T. E.: Note on the roots of algebraic equations. Bull. Amer. Math. Soc.21, 14–22 (1914).

    Google Scholar 

  2. Deutsch, E.: Matricial norms. Numer. Math.16, 73–84 (1970).

    Google Scholar 

  3. Mitrinovic, D. S.: Analytic inequalities. Berlin-Heidelberg-New York: Springer 1970.

    Google Scholar 

  4. Parodi, M.: La localisation des valeurs caractéristiques des matrices et ses Applications. Paris: Gauthier-Villars 1959.

    Google Scholar 

  5. Robert, F.: Sur les normes vectorielles régulières sur un espace de dimension finie. C.R.A.S. Paris261, 5173–5176 (1965).

    Google Scholar 

  6. Vitória, J.: Normas vectoriais de vectores e de matrizes. Report, Univ. Lourenç Marques (Mozambique), 1974.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Much of the research for this note was done while the author was at the Department of mathematics, Universidade Eduardo Mondlane, Maputo, People's Republic of Mozambique.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vot'oria, J. Generalization of inequalities by carmichael and mason and by parodi. Computing 22, 363–365 (1979). https://doi.org/10.1007/BF02265316

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation