The zeros of complex polynomials, matrix inequalities and non-linear programming†

DOI10.1080/00207177108931967zbMath0212.51401OpenAlexW2058594693MaRDI QIDQ5614368

James N. Hanson

Publication date: 1971

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207177108931967

Mathematics Subject Classification ID

Nonlinear programming (90C30) Miscellaneous inequalities involving matrices (15A45) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)

Cites Work

• Unnamed Item
• A Note on Quasi-Idempotent Matrices
• Characteristic Roots of Semi-Magic Square Matrices
• A Method for Computing the Real Roots of Determinantal Equations
• A Rapidly Convergent Descent Method for Minimization
• On the Zeros of Polynomials
• Gershgorin's Theorem and the Zeros of Polynomials
• Matrices with Specified Eigenvalues and Associated Eigenvectors, Proper or Generalized
• Location of the Zeros of Polynomials
• On the Characteristic Roots of a Matrix
• Location of the Zeros of a Polynomial
• On the Roots of the Derivative of a Polynomial With Real Roots
• Location of the Zeros of Infrapolynomials
• A Criterion for a Common Root of k Algebraic Equations
• Characteristic Roots of a Set of Matrices
• Zero-Free Regions of Polynomials

This page was built for publication: The zeros of complex polynomials, matrix inequalities and non-linear programming†