{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/143646894"
      "properties" : {
        "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/ns/prov#Entity" ] ,
        "http://www.w3.org/ns/prov#value" : [ " with L=U^T.Comment: the Cholesky decomposition is uniqueComment: the Cholesky decomposition is also applicable for complex hermitian positive definite matricesComment: An alternative is the LDL decomposition which can avoid extracting square roots.Applicable to: m-by-n matrix ADecomposition: A=QR where Q is an orthogonal matrix of size m-by-m, and R is an upper triangular matrix of size m-by-nCom" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "edurite.com" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/516236947"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/143646894"] } } }
