Examples of cc.redberry.core.math.frobenius.FrobeniusSolver

cc.redberry.core.math.frobenius.FrobeniusSolver
Solves system of Frobenius equations.

Example: This gives all solutions of the system of Frobenius equations { 12 x + 16 y + 20 z + 27 t = 123, x + 3 z = 12}:
```
 int[][] equations = {{12, 16, 20, 27, 123}, {1, 0, 3, 0, 12}}; FrobeniusSolver solver = new FrobeniusSolver(equations); int[] solution; while ((solution = solver.take()) != null) System.out.println(Arrays.toString(solution)); 
```
This class calculates solutions iteratively: method {@link #take()}calculates and returns the next solution or null, if no more solutions exist. So next solution will be calculated only on the invocation of {@link #take()}. @author Dmitry Bolotin @author Stanislav Poslavsky

        for (i = 0; i < samples.length; ++i)
            upCounts[i] = samples[i].getIndices().getFree().getUpper().length();
        upCounts[i] = totalUpCount;


        //solving Frobenius equations
        FrobeniusSolver fbSolver = new FrobeniusSolver(lowCounts, upCounts);


        //processing combinations
        int u, l;
        int[] combination;
        while ((combination = fbSolver.take()) != null) {


            List<Tensor> tCombination = new ArrayList<>();
            u = 0;
            l = 0;
            for (i = 0; i < combination.length; ++i)

View Full Code Here

        for (i = 0; i < samples.length; ++i)
            upCounts[i] = samples[i].getIndices().getUpper().length();
        upCounts[i] = totalUpCount;


        //solving Frobenius equations
        FrobeniusSolver fbSolver = new FrobeniusSolver(lowCounts, upCounts);


        //processing combinations
        int u, l;
        int[] combination;
        while((combination = fbSolver.take()) != null) {


            LinkedList<Tensor> tCombination = new LinkedList<>();
            u = 0;
            l = 0;
            for (i = 0; i < combination.length; ++i)

View Full Code Here

        for (i = 0; i < samples.length; ++i)
            upCounts[i] = samples[i].getIndices().getFree().getUpper().length();
        upCounts[i] = totalUpCount;


        //solving Frobenius equations
        FrobeniusSolver fbSolver = new FrobeniusSolver(lowCounts, upCounts);


        //processing combinations
        int u, l;
        int[] combination;
        while ((combination = fbSolver.take()) != null) {


            List<Tensor> tCombination = new ArrayList<>();
            u = 0;
            l = 0;
            for (i = 0; i < combination.length; ++i)

View Full Code Here

TOP

Related Classes of cc.redberry.core.math.frobenius.FrobeniusSolver

cc.redberry.core.tensorgenerator.TensorGenerator

cc.redberry.tensorgenerator.TensorGenerator

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.