Examples of Dcss

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

26
27
28
29
30
31
32
33
34
35
36
     *            size max(m,n), b (size m) on input, x(size n) on output
     * @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)
View Full Code Here

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

27
28
29
30
31
32
33
34
35
36
37
     *            right hand side, b is overwritten with solution
     * @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 */
 
View Full Code Here

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

22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
     * @return symbolic analysis for Cholesky, null on error
     */
    public static Dcss cs_schol(int order, Dcs A) {
        int n, c[], post[], P[];
        Dcs C;
        Dcss S;
        if (!Dcs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        S = new Dcss(); /* allocate result S */
        P = Dcs_amd.cs_amd(order, A); /* P = amd(A+A'), or natural */
        S.pinv = Dcs_pinv.cs_pinv(P, n); /* find inverse permutation */
        if (order != 0 && S.pinv == null)
            return null;
        C = Dcs_symperm.cs_symperm(A, S.pinv, false); /* C = spones(triu(A(P,P))) */
 
View Full Code Here

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

28
29
30
31
32
33
34
35
36
37
38
     *            partial pivoting tolerance
     * @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 */
 
View Full Code Here

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

87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
     *            analyze for QR if true or LU if false
     * @return symbolic analysis for QR or LU, null on error
     */
    public static Dcss cs_sqr(int order, Dcs A, boolean qr) {
        int n, k, post[];
        Dcss S;
        boolean ok = true;
        if (!Dcs_util.CS_CSC(A))
            return (null); /* check inputs */
        n = A.n;
        S = new Dcss(); /* allocate result S */
        S.q = Dcs_amd.cs_amd(order, A); /* fill-reducing ordering */
        if (order > 0 && S.q == null)
            return (null);
        if (qr) /* QR symbolic analysis */
        {
View Full Code Here

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

293
294
295
296
297
298
299
300
301
302
303
    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;
        if (Prob == null || Prob.sym == 0 || Prob.A.n == 0)
            return (false);
        A = Prob.A;
        C = Prob.C;
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.