Examples of Dcsn

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

27
28
29
30
31
32
33
34
35
36
37
     * @return true if successful, false on error
     */
    public static boolean cs_qrsol(int order, Dcs A, double[] b) {
        double x[];
        Dcss S;
        Dcsn N;
        Dcs AT = null;
        int k, m, n;
        boolean ok;
        if (!Dcs_util.CS_CSC(A) || b == null)
            return (false); /* check inputs */
 
View Full Code Here

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

28
29
30
31
32
33
34
35
36
37
38
     * @return true if successful, false on error
     */
    public static boolean cs_cholsol(int order, Dcs A, double[] b) {
        double x[];
        Dcss S;
        Dcsn N;
        int n;
        boolean ok;
        if (!Dcs_util.CS_CSC(A) || b == null)
            return (false); /* check inputs */
        n = A.n;
View Full Code Here

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

25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
     */
    public static Dcsn cs_qr(Dcs A, Dcss S) {
        double Rx[], Vx[], Ax[], x[], Beta[];
        int i, k, p, n, vnz, p1, top, m2, len, col, rnz, s[], leftmost[], Ap[], Ai[], parent[], Rp[], Ri[], Vp[], Vi[], w[], pinv[], q[];
        Dcs R, V;
        Dcsn N;
        if (!Dcs_util.CS_CSC(A) || S == null)
            return (null);
        n = A.n;
        Ap = A.p;
        Ai = A.i;
        Ax = A.x;
        q = S.q;
        parent = S.parent;
        pinv = S.pinv;
        m2 = S.m2;
        vnz = S.lnz;
        rnz = S.unz;
        leftmost = S.leftmost;
        w = new int[m2 + n]; /* get int workspace */
        x = new double[m2]; /* get double workspace */
        N = new Dcsn(); /* allocate result */
        s = w;
        int s_offset = m2; /* s is size n */
        for (k = 0; k < m2; k++)
            x[k] = 0; /* clear workspace x */
        N.L = V = Dcs_util.cs_spalloc(m2, n, vnz, true, false); /* allocate result V */
 
View Full Code Here

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

29
30
31
32
33
34
35
36
37
38
39
     * @return true if successful, false on error
     */
    public static boolean cs_lusol(int order, Dcs A, double[] b, double tol) {
        double[] x;
        Dcss S;
        Dcsn N;
        int n;
        boolean ok;
        if (!Dcs_util.CS_CSC(A) || b == null)
            return (false); /* check inputs */
        n = A.n;
View Full Code Here

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

24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
     */
    public static Dcsn cs_chol(Dcs A, Dcss S) {
        double d, lki, Lx[], x[], Cx[];
        int top, i, p, k, n, Li[], Lp[], cp[], pinv[], s[], c[], parent[], Cp[], Ci[];
        Dcs L, C;
        Dcsn N;
        if (!Dcs_util.CS_CSC(A) || S == null || S.cp == null || S.parent == null)
            return (null);
        n = A.n;
        N = new Dcsn(); /* allocate result */
        c = new int[2 * n]; /* get int workspace */
        x = new double[n]; /* get double workspace */
        cp = S.cp;
        pinv = S.pinv;
        parent = S.parent;
View Full Code Here

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

25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
     *            partial pivoting threshold (1 for partial pivoting)
     * @return numeric LU factorization, null on error
     */
    public static Dcsn cs_lu(Dcs A, Dcss S, double tol) {
        Dcs L, U;
        Dcsn N;
        double pivot, Lx[], Ux[], x[], a, t;
        int Lp[], Li[], Up[], Ui[], pinv[], xi[], q[], n, ipiv, k, top, p, i, col, lnz, unz;
        if (!Dcs_util.CS_CSC(A) || S == null)
            return (null); /* check inputs */
        n = A.n;
        q = S.q;
        lnz = S.lnz;
        unz = S.unz;
        x = new double[n]; /* get double workspace */
        xi = new int[2 * n]; /* get int workspace */
        N = new Dcsn(); /* allocate result */
        N.L = L = Dcs_util.cs_spalloc(n, n, lnz, true, false); /* allocate result L */
        N.U = U = Dcs_util.cs_spalloc(n, n, unz, true, false); /* allocate result U */
        N.pinv = pinv = new int[n]; /* allocate result pinv */
        Lp = L.p;
        Up = U.p;
View Full Code Here

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

294
295
296
297
298
299
300
301
302
303
304
        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;
        if (Prob == null || Prob.sym == 0 || Prob.A.n == 0)
            return (false);
        A = Prob.A;
        C = Prob.C;
        b = Prob.b;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.