X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Fldlt.py;fp=mjo%2Fldlt.py;h=0000000000000000000000000000000000000000;hb=27a81f4f5f8159dbfba508ef82a419c4f7686cc4;hp=1c2663ea3d574360059b07d22f9af8163ebdc2e7;hpb=fe85934cbfb26ff0dc7e5ef81411fe73eed739ff;p=sage.d.git

diff --git a/mjo/ldlt.py b/mjo/ldlt.py
deleted file mode 100644
index 1c2663e..0000000
--- a/mjo/ldlt.py
+++ /dev/null
@@ -1,73 +0,0 @@
-from sage.all import *
-
-def is_positive_semidefinite_naive(A):
-    r"""
-    A naive positive-semidefinite check that tests the eigenvalues for
-    nonnegativity.  We follow the sage convention that positive
-    (semi)definite matrices must be symmetric or Hermitian.
-
-    SETUP::
-
-        sage: from mjo.ldlt import is_positive_semidefinite_naive
-
-    TESTS:
-
-    The trivial matrix is vaciously positive-semidefinite::
-
-        sage: A = matrix(QQ, 0)
-        sage: A
-        []
-        sage: is_positive_semidefinite_naive(A)
-        True
-
-    """
-    if A.nrows() == 0:
-        return True # vacuously
-    return A.is_hermitian() and all( v >= 0 for v in A.eigenvalues() )
-
-
-def is_positive_semidefinite(A):
-    r"""
-    A fast positive-semidefinite check based on the block-LDLT
-    factorization.
-
-    SETUP::
-
-        sage: from mjo.ldlt import (is_positive_semidefinite,
-        ....:                       is_positive_semidefinite_naive)
-
-    TESTS:
-
-    Check that the naive and fast answers are the same, in general::
-
-        sage: set_random_seed()
-        sage: F = NumberField(x^2 + 1, 'I')
-        sage: from sage.misc.prandom import choice
-        sage: ring = choice([ZZ,QQ,F])
-        sage: A = matrix.random(ring, 10)
-        sage: is_positive_semidefinite(A) == is_positive_semidefinite_naive(A)
-        True
-
-    Check that the naive and fast answers are the same for a Hermitian
-    matrix::
-
-        sage: set_random_seed()
-        sage: F = NumberField(x^2 + 1, 'I')
-        sage: from sage.misc.prandom import choice
-        sage: ring = choice([ZZ,QQ,F])
-        sage: A = matrix.random(ring, 10); A = A + A.conjugate_transpose()
-        sage: is_positive_semidefinite(A) == is_positive_semidefinite_naive(A)
-        True
-
-    """
-    if not A.is_hermitian():
-        return False
-    _,_,d = A._block_ldlt()
-    for d_i in d:
-        if d_i.nrows() == 1:
-            if d_i < 0:
-                return False
-        else:
-            # A 2x2 block indicates that it's indefinite
-            return False
-    return True