Abstract
A direct approach to the P-matrix or P0-matrix problem is to evaluate all the principal minors of matrix A using standard numerical linear algebra techniques with O(2nn3) computational time complexity. The computational time complexity of the P-matrix problem has been reduced from O(2nn3) to O(2n) by applying recursively a criterion for P-matrices based on Schur complementation. But this algorithm can be not directly applied to test the P0-matrices because the Schur complementation can be not computed when some zero diagonal elements appear.This paper proposes an asymptotic approach for testing P0-matrices with O(2n) computational time complexity. Some numerical examples show that the proposed algorithm is effective for testing P0-matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
