Package evaluation of MUMPS on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T07:09:42.917 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.78s ################################################################################ # Installation # Installing MUMPS... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [55d2b088] + MUMPS v1.5.0 Updating `~/.julia/environments/v1.10/Manifest.toml` [ffbed154] + DocStringExtensions v0.9.3 [692b3bcd] + JLLWrappers v1.7.0 [da04e1cc] + MPI v0.20.22 [3da0fdf6] + MPIPreferences v0.1.11 [55d2b088] + MUMPS v1.5.0 [eebad327] + PkgVersion v0.3.3 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [ae029012] + Requires v1.3.0 [6e34b625] + Bzip2_jll v1.0.9+0 [e33a78d0] + Hwloc_jll v2.12.0+0 [d00139f3] + METIS_jll v5.1.3+0 [7cb0a576] + MPICH_jll v4.3.0+0 [f1f71cc9] + MPItrampoline_jll v5.5.2+0 [ca64183c] + MUMPS_jll v5.7.3+0 [9237b28f] + MicrosoftMPI_jll v10.1.4+3 ⌅ [656ef2d0] + OpenBLAS32_jll v0.3.24+0 [fe0851c0] + OpenMPI_jll v5.0.7+0 [b247a4be] + PARMETIS_jll v4.0.6+2 [b3ec0f5a] + PTSCOTCH_jll v7.0.4+0 [aabda75e] + SCALAPACK32_jll v2.2.1+1 ⌅ [a8d0f55d] + SCOTCH_jll v7.0.4+3 [ffd25f8a] + XZ_jll v5.6.4+1 [0dad84c5] + ArgTools v1.1.1 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [8ba89e20] + Distributed [f43a241f] + Downloads v1.6.0 [7b1f6079] + FileWatching [b77e0a4c] + InteractiveUtils [4af54fe1] + LazyArtifacts [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [ca575930] + NetworkOptions v1.2.0 [44cfe95a] + Pkg v1.10.0 [de0858da] + Printf [3fa0cd96] + REPL [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] + LibCURL_jll v8.4.0+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [14a3606d] + MozillaCACerts_jll v2023.1.10 [4536629a] + OpenBLAS_jll v0.3.23+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 [8e850ede] + nghttp2_jll v1.52.0+1 [3f19e933] + p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 12.03s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 27.22s ################################################################################ # Testing # Testing MUMPS Status `/tmp/jl_mElgtg/Project.toml` [da04e1cc] MPI v0.20.22 [55d2b088] MUMPS v1.5.0 [ca64183c] MUMPS_jll v5.7.3+0 [8f399da3] Libdl [37e2e46d] LinearAlgebra [9a3f8284] Random [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_mElgtg/Manifest.toml` [ffbed154] DocStringExtensions v0.9.3 [692b3bcd] JLLWrappers v1.7.0 [da04e1cc] MPI v0.20.22 [3da0fdf6] MPIPreferences v0.1.11 [55d2b088] MUMPS v1.5.0 [eebad327] PkgVersion v0.3.3 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [ae029012] Requires v1.3.0 [6e34b625] Bzip2_jll v1.0.9+0 [e33a78d0] Hwloc_jll v2.12.0+0 [d00139f3] METIS_jll v5.1.3+0 [7cb0a576] MPICH_jll v4.3.0+0 [f1f71cc9] MPItrampoline_jll v5.5.2+0 [ca64183c] MUMPS_jll v5.7.3+0 [9237b28f] MicrosoftMPI_jll v10.1.4+3 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [fe0851c0] OpenMPI_jll v5.0.7+0 [b247a4be] PARMETIS_jll v4.0.6+2 [b3ec0f5a] PTSCOTCH_jll v7.0.4+0 [aabda75e] SCALAPACK32_jll v2.2.1+1 ⌅ [a8d0f55d] SCOTCH_jll v7.0.4+3 [ffd25f8a] XZ_jll v5.6.4+1 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... [ Info: MUMPS_INSTALLATION: YGGDRASIL Test single rhs Entering DMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0017 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0001 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0001 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0020 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0025 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 1 Leaving solve with ... Time to build/scatter RHS = 0.000121 Time in solution step (fwd/bwd) = 0.000364 .. Time in forward (fwd) step = 0.000187 .. Time in backward (bwd) step = 0.000172 Time to gather solution(cent.sol)= 0.000012 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0006 Test multiple rhs Entering DMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0021 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0002 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0002 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0026 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0033 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 5 Blocking factor for multiple rhs = 5 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 1 Leaving solve with ... Time to build/scatter RHS = 0.000116 Time in solution step (fwd/bwd) = 0.000760 .. Time in forward (fwd) step = 0.000370 .. Time in backward (bwd) step = 0.000385 Time to gather solution(cent.sol)= 0.000013 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0010 Test Summary: | Pass Total Time float: | 11 11 19.7s Test single rhs on div_grad matrix Entering DMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 3700 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L D L^T Solver for symmetric positive definite matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 Average density of rows/columns = 5 Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 52941 -- (3) Real space for factors (estimated) = 64451 -- (4) Integer space for factors (estimated) = 6774 -- (5) Maximum frontal size (estimated) = 147 -- (6) Number of nodes in the tree = 65 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 5 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.728D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0019 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 5 INFOG(3) Real space for factors (estimated)= 64451 INFOG(4) Integer space for factors (estim.)= 6774 Maximum frontal size (estimated) = 147 Number of nodes in the tree = 65 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Effective size of S (based on INFO(39))= 82554 Elapsed time to reformat/distribute matrix = 0.0001 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 110000 Size of async. emission buffer (bytes).. = 110012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0028 Leaving factorization with ... RINFOG (2) Operations in node assembly = 3.770D+04 ------ (3) Operations in node elimination = 3.728D+06 ICNTL (8) Scaling effectively used = 0 INFOG (9) Real space for factors = 64451 INFOG (10) Integer space for factors = 6774 INFOG (11) Maximum front size = 147 INFOG (29) Number of entries in factors = 52941 INFOG (12) Number of negative pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 2.233D+00 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 2.233D+00 RINFOG(21) Largest pivot in absolute value = 6.000D+00 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0031 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000084 Time in solution step (fwd/bwd) = 0.000414 .. Time in forward (fwd) step = 0.000210 .. Time in backward (bwd) step = 0.000200 Time to gather solution(cent.sol)= 0.000007 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0006 Test multiple rhs on div_grad matrix Entering DMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 3700 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L D L^T Solver for symmetric positive definite matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 Average density of rows/columns = 5 Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 52941 -- (3) Real space for factors (estimated) = 64451 -- (4) Integer space for factors (estimated) = 6774 -- (5) Maximum frontal size (estimated) = 147 -- (6) Number of nodes in the tree = 65 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 5 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.728D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0019 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 5 INFOG(3) Real space for factors (estimated)= 64451 INFOG(4) Integer space for factors (estim.)= 6774 Maximum frontal size (estimated) = 147 Number of nodes in the tree = 65 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Effective size of S (based on INFO(39))= 82554 Elapsed time to reformat/distribute matrix = 0.0001 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 110000 Size of async. emission buffer (bytes).. = 110012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0020 Leaving factorization with ... RINFOG (2) Operations in node assembly = 3.770D+04 ------ (3) Operations in node elimination = 3.728D+06 ICNTL (8) Scaling effectively used = 0 INFOG (9) Real space for factors = 64451 INFOG (10) Integer space for factors = 6774 INFOG (11) Maximum front size = 147 INFOG (29) Number of entries in factors = 52941 INFOG (12) Number of negative pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 2.233D+00 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 2.233D+00 RINFOG(21) Largest pivot in absolute value = 6.000D+00 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0024 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 5 Blocking factor for multiple rhs = 5 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 1 Leaving solve with ... Time to build/scatter RHS = 0.000070 Time in solution step (fwd/bwd) = 0.000617 .. Time in forward (fwd) step = 0.000334 .. Time in backward (bwd) step = 0.000278 Time to gather solution(cent.sol)= 0.000013 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0008 Test Summary: | Pass Total Time test: | 11 11 4.8s ┌ Warning: matrix with element type Float64: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix with element type Float64: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 Test single rhs on div_grad matrix Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0020 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0003 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0002 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0051 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0060 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 1 Leaving solve with ... Time to build/scatter RHS = 0.000129 Time in solution step (fwd/bwd) = 0.000630 .. Time in forward (fwd) step = 0.000320 .. Time in backward (bwd) step = 0.000304 Time to gather solution(cent.sol)= 0.000022 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0009 Test multiple rhs on div_grad matrix Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 1 Total space in MBytes, OOC factorization (INFOG(27)): 1 Elapsed time in analysis driver= 0.0021 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0004 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0002 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 1 ** Memory effectively used, total in Mbytes (INFOG(22)): 1 Elapsed time for factorization = 0.0041 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0050 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 5 Blocking factor for multiple rhs = 5 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 1 Leaving solve with ... Time to build/scatter RHS = 0.000047 Time in solution step (fwd/bwd) = 0.000903 .. Time in forward (fwd) step = 0.000443 .. Time in backward (bwd) step = 0.000455 Time to gather solution(cent.sol)= 0.000019 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0011 Test Summary: | Pass Total Time float complex: | 11 11 19.1s ┌ Warning: matrix with element type Float64: will attempt conversion to Mumps type ComplexF64 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix with element type Float64: will attempt conversion to Mumps type ComplexF64 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 Test single rhs on div_grad matrix Entering ZMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 3 Total space in MBytes, OOC factorization (INFOG(27)): 2 Elapsed time in analysis driver= 0.0015 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0002 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0001 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 3 ** Memory effectively used, total in Mbytes (INFOG(22)): 2 Elapsed time for factorization = 0.0032 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0037 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 2 Leaving solve with ... Time to build/scatter RHS = 0.000071 Time in solution step (fwd/bwd) = 0.000475 .. Time in forward (fwd) step = 0.000241 .. Time in backward (bwd) step = 0.000228 Time to gather solution(cent.sol)= 0.000013 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0006 Test multiple rhs on div_grad matrix Entering ZMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 1000 6400 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 1000 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 5 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 95884 -- (3) Real space for factors (estimated) = 95884 -- (4) Integer space for factors (estimated) = 8208 -- (5) Maximum frontal size (estimated) = 141 -- (6) Number of nodes in the tree = 112 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 6.352D+06 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 3 Total space in MBytes, OOC factorization (INFOG(27)): 2 Elapsed time in analysis driver= 0.0019 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 95884 INFOG(4) Integer space for factors (estim.)= 8208 Maximum frontal size (estimated) = 141 Number of nodes in the tree = 112 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0003 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.40D-02 Effective size of S (based on INFO(39))= 129628 Elapsed time to reformat/distribute matrix = 0.0002 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 3 ** Memory effectively used, total in Mbytes (INFOG(22)): 2 Elapsed time for factorization = 0.0043 Leaving factorization with ... RINFOG (2) Operations in node assembly = 7.258D+04 ------ (3) Operations in node elimination = 6.352D+06 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 95884 INFOG (10) Integer space for factors = 8208 INFOG (11) Maximum front size = 141 INFOG (29) Number of entries in factors = 95884 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 3.067D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 3.067D-01 RINFOG(21) Largest pivot in absolute value = 6.383D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0051 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 5 Blocking factor for multiple rhs = 5 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 3 Leaving solve with ... Time to build/scatter RHS = 0.000124 Time in solution step (fwd/bwd) = 0.001029 .. Time in forward (fwd) step = 0.000502 .. Time in backward (bwd) step = 0.000521 Time to gather solution(cent.sol)= 0.000021 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0013 Test Summary: | Pass Total Time complex: | 11 11 13.9s ┌ Warning: matrix with element type Float16: will attempt conversion to Mumps type Float32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix is dense, but ICNTL[5]=0 indicates assembled. attempting to convert matrix to sparse └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:164 Entering SMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.87D-01 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.763D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.763D-01 RINFOG(21) Largest pivot in absolute value = 9.189D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000006 Time in solution step (fwd/bwd) = 0.000034 .. Time in forward (fwd) step = 0.000018 .. Time in backward (bwd) step = 0.000011 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0001 ┌ Warning: matrix with element type Float16: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix is dense, but ICNTL[5]=0 indicates assembled. attempting to convert matrix to sparse └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:164 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 4 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.87D-01 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.763D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.763D-01 RINFOG(21) Largest pivot in absolute value = 9.189D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 3 4 16 executing #MPI = 1 and #OMP = 1 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000006 Time in solution step (fwd/bwd) = 0.000027 .. Time in forward (fwd) step = 0.000012 .. Time in backward (bwd) step = 0.000010 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0001 ┌ Warning: matrix with element type Float16: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 4 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.87D-01 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.763D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.763D-01 RINFOG(21) Largest pivot in absolute value = 9.189D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 3 4 16 executing #MPI = 1 and #OMP = 1 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000005 Time in solution step (fwd/bwd) = 0.000026 .. Time in forward (fwd) step = 0.000012 .. Time in backward (bwd) step = 0.000009 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0001 ┌ Warning: matrix with element type Float16: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix is dense, but ICNTL[5]=0 indicates assembled. attempting to convert matrix to sparse └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:164 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 4 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.87D-01 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.763D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.763D-01 RINFOG(21) Largest pivot in absolute value = 9.189D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 3 4 16 executing #MPI = 1 and #OMP = 1 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000009 Time in solution step (fwd/bwd) = 0.000036 .. Time in forward (fwd) step = 0.000022 .. Time in backward (bwd) step = 0.000010 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0002 ┌ Warning: matrix with element type Float16: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 4 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.0000D+00 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.87D-01 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.763D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.763D-01 RINFOG(21) Largest pivot in absolute value = 9.189D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 3 4 16 executing #MPI = 1 and #OMP = 1 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000006 Time in solution step (fwd/bwd) = 0.000027 .. Time in forward (fwd) step = 0.000013 .. Time in backward (bwd) step = 0.000009 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0001 ┌ Warning: matrix with element type ComplexF16: will attempt conversion to Mumps type ComplexF32 └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:161 ┌ Warning: matrix is dense, but ICNTL[5]=0 indicates assembled. attempting to convert matrix to sparse └ @ MUMPS ~/.julia/packages/MUMPS/U3MoD/src/interface.jl:164 Entering CMUMPS 5.7.3 from C interface with JOB, N, NNZ = 6 4 16 executing #MPI = 1 and #OMP = 1 ================================================= MUMPS compiled with option -Dmetis MUMPS compiled with option -Dparmetis MUMPS compiled with option -Dpord MUMPS compiled with option -Dptscotch MUMPS compiled with option -Dscotch ================================================= L U Solver for unsymmetric matrices Type of parallelism: Working host ****** ANALYSIS STEP ******** Processing a graph of size: 4 ... Structural symmetry (in percent)= 100 Average density of rows/columns = 3 ... No column permutation Ordering based on AMF Leaving analysis phase with ... INFOG(1) = 0 INFOG(2) = 0 -- (20) Number of entries in factors (estim.) = 16 -- (3) Real space for factors (estimated) = 16 -- (4) Integer space for factors (estimated) = 28 -- (5) Maximum frontal size (estimated) = 4 -- (6) Number of nodes in the tree = 1 -- (32) Type of analysis effectively used = 1 -- (7) Ordering option effectively used = 2 ICNTL (6) Maximum transversal option = 0 ICNTL (7) Pivot order option = 7 ICNTL(12) Ordering symmetric indef. matrices = 1 ICNTL(13) Parallelism/splitting of root node = 0 ICNTL(14) Percentage of memory relaxation = 20 ICNTL(15) Analysis by block effectively used = 0 ICNTL(18) Distributed input matrix (on if >0) = 0 ICNTL(32) Forward elimination during facto. = 0 ICNTL(35) BLR activation = 0 ICNTL(48) Tree based multithreading (effective)= 0 ICNTL(58) Symbolic factorization option = 2 Number of level 2 nodes = 0 Number of split nodes = 0 RINFOG(1) Operations during elimination (estim)= 3.400D+01 MEMORY ESTIMATIONS ... Estimations with standard Full-Rank (FR) factorization: Total space in MBytes, IC factorization (INFOG(17)): 0 Total space in MBytes, OOC factorization (INFOG(27)): 0 Elapsed time in analysis driver= 0.0002 ****** FACTORIZATION STEP ******** GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... Number of working processes = 1 ICNTL(22) Out-of-core option = 0 ICNTL(35) BLR activation (eff. choice) = 0 ICNTL(37) BLR CB compression (eff. choice) = 0 ICNTL(49) Compact workarray S (end facto.) = 0 ICNTL(14) Memory relaxation = 20 INFOG(3) Real space for factors (estimated)= 16 INFOG(4) Integer space for factors (estim.)= 28 Maximum frontal size (estimated) = 4 Number of nodes in the tree = 1 ICNTL(23) Memory allowed (value on host) = 0 Sum over all procs = 0 Memory provided by user, sum of LWK_USER = 0 Effective threshold for pivoting, CNTL(1) = 0.1000D-01 Statistics on the scaling phase Elapsed time for scaling = 0.0000 Max difference from 1 after scaling the entries for ONE-NORM (option 7/8) = 0.11D+00 Effective size of S (based on INFO(39))= 2436 Elapsed time to reformat/distribute matrix = 0.0000 Allocated buffers ------------------ Size of reception buffer in bytes ...... = 140000 Size of async. emission buffer (bytes).. = 140012 Small emission buffer (bytes) .......... = 20 ** Memory allocated, total in Mbytes (INFOG(19)): 0 ** Memory effectively used, total in Mbytes (INFOG(22)): 0 Elapsed time for factorization = 0.0001 Leaving factorization with ... RINFOG (2) Operations in node assembly = 0.000D+00 ------ (3) Operations in node elimination = 3.400D+01 ICNTL (8) Scaling effectively used = 7 INFOG (9) Real space for factors = 16 INFOG (10) Integer space for factors = 28 INFOG (11) Maximum front size = 4 INFOG (29) Number of entries in factors = 16 INFOG (12) Number of off diagonal pivots = 0 INFOG (13) Number of delayed pivots = 0 RINFOG(19) Smallest pivot WITH perturbed pivots = 1.866D-01 RINFOG(20) Smallest pivot WITHOUT perturbed pivots = 1.866D-01 RINFOG(21) Largest pivot in absolute value = 7.823D-01 INFOG (24) Effective value of ICNTL(12) = 1 INFOG (14) Number of memory compress = 0 Elapsed time in factorization driver = 0.0003 ****** SOLVE & CHECK STEP ******** GLOBAL STATISTICS PRIOR SOLVE PHASE ........... Number of right-hand-sides = 1 Blocking factor for multiple rhs = 1 ICNTL (9) = 1 --- (10) = 0 --- (11) = 0 --- (20) = 0 --- (21) = 0 --- (30) = 0 --- (35) = 0 --- (48) (effective) = 0 ** Space in MBYTES used for solve : 0 Leaving solve with ... Time to build/scatter RHS = 0.000005 Time in solution step (fwd/bwd) = 0.000025 .. Time in forward (fwd) step = 0.000013 .. Time in backward (bwd) step = 0.000009 Time to gather solution(cent.sol)= 0.000002 Time for distributed solution = 0.000000 Elapsed time in solve driver= 0.0001 Test Summary: | Pass Total Time mixed: | 6 6 20.9s Testing MUMPS tests passed Testing completed after 92.18s PkgEval succeeded after 147.49s