Documentation of 'edu.emory.mathcs.csparsej.tdouble.Dcs_ereach' Java class
Dcs_ereach
edu.emory.mathcs.csparsej.tdouble

Class Dcs_ereach



  • public class Dcs_ereach
    extends java.lang.Object
    Nonzero pattern of kth row of Cholesky factor, L(k,1:k-1).
    • Constructor Summary

      Constructors 
      Constructor and Description
      Dcs_ereach() 
    • Method Summary

      All Methods Static Methods Concrete Methods 
      Modifier and Type Method and Description
      static int cs_ereach(Dcs_common.Dcs A, int k, int[] parent, int[] s, int s_offset, int[] w)
      Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k)).
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • Dcs_ereach

        public Dcs_ereach()
    • Method Detail

      • cs_ereach

        public static int cs_ereach(Dcs_common.Dcs A,
                                    int k,
                                    int[] parent,
                                    int[] s,
                                    int s_offset,
                                    int[] w)
        Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k)). If ok, s[top..n-1] contains pattern of L(k,:).
        Parameters:
        A - column-compressed matrix; L is the Cholesky factor of A
        k - find kth row of L
        parent - elimination tree of A
        s - size n, s[top..n-1] is nonzero pattern of L(k,1:k-1)
        s_offset - the index of the first element in array s
        w - size n, work array, w[0..n-1]>=0 on input, unchanged on output
        Returns:
        top in successful, -1 on error

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.