Inner algorithm to test for positive definiteness of arbitrary binary forms

Inner algorithm to test for positive definiteness of arbitrary binary forms

It is shown how the test for positive definiteness of an arbitrary binary form can be expressed in terms of an inner algorithm. An example is used to illustrate the computational aspects of the procedure.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control 1975-02, Vol.20 (1), p.169-170
Hauptverfasser: Bose, N., Jury, E.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Automatic control
Polynomials
Roundoff errors
Sparse matrices
Stability
Testing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is shown how the test for positive definiteness of an arbitrary binary form can be expressed in terms of an inner algorithm. An example is used to illustrate the computational aspects of the procedure.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.1975.1100875