public class HybridSolveTiming
extends java.lang.Object
V0 is used as a preconditioner for an
iterative solve with nearby values V1, as done by DirectSolver.iterativeSolve(double[], double[], double[]). The perturbed values are
V1[k] = V0[k] (1 + eps r[k])where
r[k] is uniformly distributed in [-1,1]. The time of each
iterative solve is compared with that of a direct factor and solve.
Test matrices are: slab, an n x n x n/4 hex grid, and
slabC, the same with constraints added at a ratio of 0.1.
Usage:
java maspack.solvers.HybridSolveTiming -out hybrid.csv
[-solvers Mumps,Pardiso] [-cases slab,slabC] [-symmetric]
[-res 32,48] [-threads 8] [-eps 1e-4,1e-3,1e-2,1e-1]
[-tolExp 10] [-maxSolves 100] [-restart 20] [-reps 3]
[-mumpsMethods GMRES,CGS] [-pardisoMethods CG,CGS,GMRES,HCGS]
[-criticalArrays] [-noCriticalArrays]
| Constructor and Description |
|---|
HybridSolveTiming() |
| Modifier and Type | Method and Description |
|---|---|
static void |
main(java.lang.String[] args) |