Package edu.emory.mathcs.csparsej.tdouble.Dcs_common

Examples of edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcs

24
25
26
27
28
29
30
31
32
33
34
            System.out.println("Matrix not in compressed column form");
            return null;
        }
           
        // allocate a triplet matrix
        Dcs tripletDcs = Dcs_util.cs_spalloc(m, n, nzmax, false, true);
       
        for (j = 0; j < n; j++) {  // for all columns
                for (int row = Ap[j]; row < Ap[j + 1]; row++) {
                // triplet is: row, j, Ax[row]
                double value = Ax[row];
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
     *            column-compressed matrix (A.p modified then restored)
     * @return strongly connected components, null on error
     */
    public static Dcsd cs_scc(Dcs A) {
        int n, i, k, b, nb = 0, top, xi[], pstack[], p[], r[], Ap[], ATp[], rcopy[], Blk[];
        Dcs AT;
        Dcsd D;
        if (!Dcs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        Ap = A.p;
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
     * @return C if successful, null on error
     */
    public static Dcs cs_compress(Dcs T) {
        int m, n, nz, p, k, Cp[], Ci[], w[], Ti[], Tj[];
        double Cx[], Tx[];
        Dcs C;
        if (!Dcs_util.CS_TRIPLET(T))
            return (null); /* check inputs */
        m = T.m;
        n = T.n;
        Ti = T.i;
View Full Code Here
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
public class Dcs_negate {

    public static Dcs  cs_negate(Dcs A) {
        int p, j,  anz;
        int   m, n;
        Dcs C;
        if (!Dcs_util.CS_CSC(A) )
            return null; /* check inputs */
       
        m = A.m;             // number of rows
        n = A.n;  // number of columns
        anz = A.p[A.n];  // non-zero elements of matrix A
       
        C = new Dcs();
        C.m = m;
        C.n = n;
        C.p = new int[n+1];   // column pointers
        C.i = new int[anz]; // row pointers
        C.x = new double[anz]; // values
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
        S.q = Dcs_amd.cs_amd(order, A); /* fill-reducing ordering */
        if (order > 0 && S.q == null)
            return (null);
        if (qr) /* QR symbolic analysis */
        {
            Dcs C = order > 0 ? Dcs_permute.cs_permute(A, null, S.q, false) : A;
            S.parent = Dcs_etree.cs_etree(C, true); /* etree of C'*C, where C=A(:,q) */
            post = Dcs_post.cs_post(S.parent, n);
            S.cp = Dcs_counts.cs_counts(C, S.parent, post, true); /* col counts chol(C'*C) */
            ok = C != null && S.parent != null && S.cp != null && cs_vcount(C, S);
            if (ok)
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
    }

    /* C = A + triu(A,1)' */
    private static Dcs make_sym(Dcs A) {
        Dcs AT, C;
        AT = Dcs_transpose.cs_transpose(A, true); /* AT = A' */
        Dcs_fkeep.cs_fkeep(AT, new Dropdiag(), null); /* drop diagonal entries from AT */
        C = Dcs_add.cs_add(A, AT, 1, 1); /* C = A+AT */
        return (C);
    }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
     * @param tol
     *            drop tolerance
     * @return problem
     */
    public static Dproblem get_problem(String fileName, double tol) {
        Dcs T, A, C;
        int sym, m, n, mn, nz1, nz2;
        Dproblem Prob;
        Prob = new Dproblem();
        T = Dcs_load.cs_load(fileName); /* load triplet matrix T from a file */
        Prob.A = A = Dcs_compress.cs_compress(T); /* A = compressed-column form of T */
 
View Full Code Here
208
209
210
211
212
213
214
215
216
217
218
     * @param Prob
     *            problem
     * @return true if successful, false on error
     */
    public static boolean demo2(Dproblem Prob) {
        Dcs A, C;
        double b[], x[], resid[], t, tol;
        int k, m, n, order, nb, ns, r[], s[], rr[], sprank;
        boolean ok;
        Dcsd D;
        if (Prob == null)
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
     * @param Prob
     *            problem
     * @return true if successful, false on error
     */
    public static boolean demo3(Dproblem Prob) {
        Dcs A, C, W = null, WW, WT, E = null, W2;
        int n, k, Li[], Lp[], Wi[], Wp[], p1, p2, p[] = null;
        boolean ok;
        double b[], x[], resid[], y[] = null, Lx[], Wx[], s, t, t1;
        Dcss S = null;
        Dcsn N = null;
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
* @author Piotr Wendykier (piotr.wendykier@gmail.com)
*
*/
public class Dcs_demo1 {
    public static void main(String[] args) {
        Dcs T = null, A, Eye, AT, C, D;
        int i, m;
        if (args.length == 0) {
            throw new IllegalArgumentException("Usage: java edu.emory.mathcs.csparsej.tdouble.demo.Dcs_demo1 fileName");
        }
        T = Dcs_load.cs_load(args[0]); /* load triplet matrix T from file */
 
View Full Code Here
TOP

Related Classes of edu.emory.mathcs.csparsej.tdouble.Dcs_common.Dcs

  • edu.emory.mathcs.csparsej.tdouble.Dcs_add
  • edu.emory.mathcs.csparsej.tdouble.Dcs_addScalar
  • edu.emory.mathcs.csparsej.tdouble.Dcs_amd
  • edu.emory.mathcs.csparsej.tdouble.Dcs_chol
  • edu.emory.mathcs.csparsej.tdouble.Dcs_clone
  • edu.emory.mathcs.csparsej.tdouble.Dcs_compress
  • edu.emory.mathcs.csparsej.tdouble.Dcs_counts
  • edu.emory.mathcs.csparsej.tdouble.Dcs_CSToTriplet
  • edu.emory.mathcs.csparsej.tdouble.Dcs_dmperm
  • edu.emory.mathcs.csparsej.tdouble.Dcs_fromDoubleArray
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.