Class BlockLanczos
- java.lang.Object
-
- de.tilman_neumann.jml.factor.base.matrixSolver.BlockLanczos
-
- All Implemented Interfaces:
Serializable
public class BlockLanczos extends Object implements Serializable
Block-Lanczos matrix solver by Dario Alejandro Alpern. Extracted from Dario Alpern's Siqs package by Tilman Neumann.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description BlockLanczos()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int[]
computeBlockLanczos(int[][] matrixB, int matrixBlength)
Block-Lanczos matrix solver.
-
-
-
Method Detail
-
computeBlockLanczos
public int[] computeBlockLanczos(int[][] matrixB, int matrixBlength)
Block-Lanczos matrix solver.- Parameters:
matrixB
- The matrix holding the smooth relations. Each row = matrixB[rowIndex] represents one smooth congruence. A row contains the indices of the primes that occur in the smooth part of the relation with odd exponent. As such, the size of the sub-arrays depends on each relation. matrixB is not changed by the Block-Lanczos algorithm.matrixBlength
- number of rows- Returns:
- The solution matrix matrixV. This matrix can encode 32 different potential solutions: one in bit 0 of all ints, the next one in bit 1 of all ints, and so on.
-
-