Inner algorithm to test for positive definiteness of arbitrary binary forms
- 1 February 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 20 (1) , 169-170
- https://doi.org/10.1109/tac.1975.1100875
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On computational algorithm for innersIEEE Transactions on Automatic Control, 1974
- A computational algorithm for innersIEEE Transactions on Automatic Control, 1972
- Explicit criterion for the positive definiteness of a general quartic formIEEE Transactions on Automatic Control, 1965
- On positive definiteness of quartic forms of two variablesIEEE Transactions on Automatic Control, 1964
- Conditions for aperiodicity in linear systemsBritish Journal of Applied Physics, 1955