Effective Nondeterministic Positive Definiteness Test for Unidiagonal Integral Matrices

For standard algorithms verifying positive definiteness of a matrix A ∈ Mn(R) based on Sylvester's criterion, the computationally pessimistic case is this when A is positive definite. We present an algorithm realizing the same task for A ∈ M n (Z), for which the case when A is positive definite...

Full description

Bibliographic Details

Published in:	Proceedings (International Symposium on Symbolic and Numeric Algorithms for Scientific Computing) pp. 65 - 71
Main Author:	Mroz, Andrzej
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2016
Subjects:	Algebra bigraph Complexity theory nondeterministic algorithm positive definite matrix Scientific computing signed graph Solids Zinc
ISSN:	2470-881X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!