File: dbm_order_N.inp

package info (click to toggle)
cp2k 2023.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 371,760 kB
  • sloc: fortran: 950,945; python: 24,503; f90: 24,350; ansic: 21,636; sh: 12,577; cpp: 2,408; xml: 2,173; makefile: 1,444; lisp: 952; pascal: 845; perl: 492; javascript: 258; csh: 16
file content (28 lines) | stat: -rw-r--r-- 570 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
&GLOBAL
  PRINT_LEVEL MEDIUM
  PROGRAM_NAME TEST
  RUN_TYPE NONE
  &TIMINGS
     THRESHOLD 0.00000000001
  &END
&END GLOBAL
&TEST
  ! check we can do a really large, really sparse matrix in short time.
  ! good to catch non-O(N) behavior in dbcsr.
  ! matrix size and sparsity are such that the test is fast for O(N)
  ! but slow for O(N**foo)
  &DBM
     K 400000
     M 400000
     N 400000
     TRANSA FALSE
     TRANSB TRUE
     N_LOOP 3
     ASPARSITY 0.99999
     BSPARSITY 0.99999
     CSPARSITY 0.99999
     bs_m 1 4
     bs_n 1 4
     bs_k 1 4
  &END
&END TEST