Package edu.emory.mathcs.csparsej.tfloat.Scs_common

Examples of edu.emory.mathcs.csparsej.tfloat.Scs_common.Scs

21
22
23
24
25
26
27
28
29
30
31
     *            column-compressed matrix
     * @return symbolic analysis for Cholesky, null on error
     */
    public static Scss cs_schol(int order, Scs A) {
        int n, c[], post[], P[];
        Scs C;
        Scss S;
        if (!Scs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        S = new Scss(); /* allocate result S */
 
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
     * @return numeric Cholesky factorization, null on error
     */
    public static Scsn cs_chol(Scs A, Scss S) {
        float d, lki, Lx[], x[], Cx[];
        int top, i, p, k, n, Li[], Lp[], cp[], pinv[], s[], c[], parent[], Cp[], Ci[];
        Scs L, C;
        Scsn N;
        if (!Scs_util.CS_CSC(A) || S == null || S.cp == null || S.parent == null)
            return (null);
        n = A.n;
        N = new Scsn(); /* allocate result */
 
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 Scsd cs_scc(Scs A) {
        int n, i, k, b, nb = 0, top, xi[], pstack[], p[], r[], Ap[], ATp[], rcopy[], Blk[];
        Scs AT;
        Scsd S;
        if (!Scs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        Ap = A.p;
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        S.q = Scs_amd.cs_amd(order, A); /* fill-reducing ordering */
        if (order > 0 && S.q == null)
            return (null);
        if (qr) /* QR symbolic analysis */
        {
            Scs C = order > 0 ? Scs_permute.cs_permute(A, null, S.q, false) : A;
            S.parent = Scs_etree.cs_etree(C, true); /* etree of C'*C, where C=A(:,q) */
            post = Scs_post.cs_post(S.parent, n);
            S.cp = Scs_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
85
86
87
88
89
90
91
92
93
94
95
     * @return row and column matching, size m+n
     */
    public static int[] cs_maxtrans(Scs A, int seed) /*[jmatch [0.f.m-1]; imatch [0.f.n-1]]*/
    {
        int i, j, k, n, m, p, n2 = 0, m2 = 0, Ap[], jimatch[], w[], cheap[], js[], is[], ps[], Ai[], Cp[], jmatch[], imatch[], q[];
        Scs C;
        if (!Scs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        m = A.m;
        Ap = A.p;
View Full Code Here
TOP

Related Classes of edu.emory.mathcs.csparsej.tfloat.Scs_common.Scs

  • edu.emory.mathcs.csparsej.tfloat.demo.Scs_demo
  • edu.emory.mathcs.csparsej.tfloat.demo.Scs_demo1
  • edu.emory.mathcs.csparsej.tfloat.Scs_add
  • edu.emory.mathcs.csparsej.tfloat.Scs_amd
  • edu.emory.mathcs.csparsej.tfloat.Scs_chol
  • edu.emory.mathcs.csparsej.tfloat.Scs_compress
  • edu.emory.mathcs.csparsej.tfloat.Scs_counts
  • edu.emory.mathcs.csparsej.tfloat.Scs_dmperm
  • edu.emory.mathcs.csparsej.tfloat.Scs_load
  • edu.emory.mathcs.csparsej.tfloat.Scs_lu
    • 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.