program test_linear_solver_cg use fem_precision use fem_error use fem_control use fem_sparse_csr use fem_sparse_csr_diagnostics use fem_linear_solver_cg implicit none real(rk), parameter :: TOL = 1.0e-9_rk call check_spd_solve() call check_zero_rhs() call check_nonconvergence() call check_dispatch_cg_none() call check_bicgstab_solve() call check_bicgstab_ilu0_solve() call check_gmres_solve() call check_dense_pivot_solve() call check_invalid_configuration() contains subroutine check_spd_solve() type(csr_matrix) :: a integer :: ierr integer :: iter real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm call make_tridiagonal(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(1) b = (/ ZERO, ZERO, 4.0_rk /) x = ZERO call linear_cg_solve(a, b, x, 20, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(2) if (iter .le. 0 .or. iter .gt. 3) call fail(3) if (res_norm .gt. 1.0e-10_rk) call fail(4) call check_close(x(1), ONE, 5) call check_close(x(2), 2.0_rk, 6) call check_close(x(3), 3.0_rk, 7) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8) end subroutine check_spd_solve subroutine check_zero_rhs() type(csr_matrix) :: a integer :: ierr integer :: iter real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm call make_tridiagonal(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(20) b = ZERO x = ZERO call linear_cg_solve(a, b, x, 20, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(21) if (iter .ne. 0) call fail(22) if (res_norm .gt. ZERO) call fail(23) if (maxval(abs(x)) .gt. ZERO) call fail(24) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(25) end subroutine check_zero_rhs subroutine check_nonconvergence() type(csr_matrix) :: a integer :: ierr integer :: iter real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm call make_tridiagonal(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(30) b = (/ ZERO, ZERO, 4.0_rk /) x = ZERO call linear_cg_solve(a, b, x, 1, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .eq. FEM_SUCCESS) call fail(31) if (iter .ne. 1) call fail(32) if (res_norm .le. ZERO) call fail(33) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(34) end subroutine check_nonconvergence subroutine check_dispatch_cg_none() type(csr_matrix) :: a integer :: ierr integer :: iter integer :: method integer :: preconditioner integer :: status_code integer :: matrix_class real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm real(rk) :: initial_resid real(rk) :: final_resid real(rk) :: relative_resid call linear_solver_configure(LSOLVER_CG, LPRECOND_NONE, ierr) if (ierr .ne. FEM_SUCCESS) call fail(40) call make_tridiagonal(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(41) b = (/ ZERO, ZERO, 4.0_rk /) x = ZERO call linear_solver_solve(a, b, x, 20, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(42) call check_close(x(1), ONE, 43) call linear_solver_get_stats(method, preconditioner, iter, res_norm, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(44) if (method .ne. LSOLVER_CG) call fail(45) if (preconditioner .ne. LPRECOND_NONE) call fail(46) if (status_code .ne. LS_STATUS_CONVERGED) call fail(47) call linear_solver_get_diagnostics(matrix_class, initial_resid, & final_resid, relative_resid, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(50) if (matrix_class .ne. CSR_CLASS_SPD_CAND) call fail(51) call check_close(initial_resid, 4.0_rk, 52) if (final_resid .gt. 1.0e-10_rk) call fail(53) if (relative_resid .gt. 1.0e-10_rk) call fail(54) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(48) call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(49) end subroutine check_dispatch_cg_none subroutine check_bicgstab_solve() type(csr_matrix) :: a integer :: ierr integer :: iter integer :: method integer :: preconditioner integer :: status_code integer :: matrix_class real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm real(rk) :: initial_resid real(rk) :: final_resid real(rk) :: relative_resid call linear_solver_configure(LSOLVER_BICGSTAB, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(60) call make_nonsymmetric(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(61) b = (/ 6.0_rk, 9.0_rk, 6.0_rk /) x = ZERO call linear_solver_solve(a, b, x, 30, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(62) if (iter .le. 0) call fail(63) if (res_norm .gt. 1.0e-10_rk) call fail(64) call check_close(x(1), ONE, 65) call check_close(x(2), 2.0_rk, 66) call check_close(x(3), 3.0_rk, 67) call linear_solver_get_stats(method, preconditioner, iter, res_norm, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(68) if (method .ne. LSOLVER_BICGSTAB) call fail(69) if (preconditioner .ne. LPRECOND_JACOBI) call fail(70) if (status_code .ne. LS_STATUS_CONVERGED) call fail(71) call linear_solver_get_diagnostics(matrix_class, initial_resid, & final_resid, relative_resid, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7001) if (matrix_class .ne. CSR_CLASS_GENERAL) call fail(7002) if (initial_resid .le. ONE) call fail(7003) if (final_resid .gt. 1.0e-10_rk) call fail(7004) if (relative_resid .gt. 1.0e-10_rk) call fail(7005) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(72) call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(73) end subroutine check_bicgstab_solve subroutine check_bicgstab_ilu0_solve() type(csr_matrix) :: a integer :: ierr integer :: iter integer :: method integer :: preconditioner integer :: status_code real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm call linear_solver_configure(LSOLVER_BICGSTAB, LPRECOND_ILU0, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7301) call make_nonsymmetric(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7302) b = (/ 6.0_rk, 9.0_rk, 6.0_rk /) x = ZERO call linear_solver_solve(a, b, x, 30, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7303) if (iter .le. 0) call fail(7304) if (res_norm .gt. 1.0e-10_rk) call fail(7305) call check_close(x(1), ONE, 7306) call check_close(x(2), 2.0_rk, 7307) call check_close(x(3), 3.0_rk, 7308) call linear_solver_get_stats(method, preconditioner, iter, res_norm, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7309) if (method .ne. LSOLVER_BICGSTAB) call fail(7310) if (preconditioner .ne. LPRECOND_ILU0) call fail(7311) if (status_code .ne. LS_STATUS_CONVERGED) call fail(7312) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7313) call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(7314) end subroutine check_bicgstab_ilu0_solve subroutine check_gmres_solve() type(csr_matrix) :: a integer :: ierr integer :: iter integer :: method integer :: preconditioner integer :: status_code integer :: matrix_class real(rk) :: b(3) real(rk) :: x(3) real(rk) :: res_norm real(rk) :: initial_resid real(rk) :: final_resid real(rk) :: relative_resid call linear_solver_configure(LSOLVER_GMRES, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(74) call make_nonsymmetric(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(75) b = (/ 6.0_rk, 9.0_rk, 6.0_rk /) x = ZERO call linear_solver_solve(a, b, x, 30, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(76) if (iter .le. 0) call fail(77) if (res_norm .gt. 1.0e-10_rk) call fail(78) call check_close(x(1), ONE, 79) call check_close(x(2), 2.0_rk, 80) call check_close(x(3), 3.0_rk, 81) call linear_solver_get_stats(method, preconditioner, iter, res_norm, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(82) if (method .ne. LSOLVER_GMRES) call fail(83) if (preconditioner .ne. LPRECOND_JACOBI) call fail(84) if (status_code .ne. LS_STATUS_CONVERGED) call fail(85) call linear_solver_get_diagnostics(matrix_class, initial_resid, & final_resid, relative_resid, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8501) if (matrix_class .ne. CSR_CLASS_GENERAL) call fail(8502) if (initial_resid .le. ONE) call fail(8503) if (final_resid .gt. 1.0e-10_rk) call fail(8504) if (relative_resid .gt. 1.0e-10_rk) call fail(8505) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(86) call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(87) end subroutine check_gmres_solve subroutine check_dense_pivot_solve() type(csr_matrix) :: a integer :: ierr integer :: iter integer :: method integer :: preconditioner integer :: status_code integer :: matrix_class real(rk) :: b(2) real(rk) :: x(2) real(rk) :: res_norm real(rk) :: initial_resid real(rk) :: final_resid real(rk) :: relative_resid call linear_solver_configure(LSOLVER_DENSE, LPRECOND_NONE, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8601) call make_indefinite(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8602) b = (/ -ONE, 7.0_rk /) x = ZERO call linear_solver_solve(a, b, x, 10, 1.0e-12_rk, iter, res_norm, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8603) if (iter .ne. 2) call fail(8604) if (res_norm .gt. 1.0e-10_rk) call fail(8605) call check_close(x(1), 2.0_rk, 8606) call check_close(x(2), 3.0_rk, 8607) call linear_solver_get_stats(method, preconditioner, iter, res_norm, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8608) if (method .ne. LSOLVER_DENSE) call fail(8609) if (preconditioner .ne. LPRECOND_NONE) call fail(8610) if (status_code .ne. LS_STATUS_CONVERGED) call fail(8611) call linear_solver_get_diagnostics(matrix_class, initial_resid, & final_resid, relative_resid, & status_code, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8612) if (matrix_class .lt. CSR_CLASS_GENERAL .or. & matrix_class .gt. CSR_CLASS_SPD_CAND) call fail(8613) if (initial_resid .le. ONE) call fail(8614) if (final_resid .gt. 1.0e-10_rk) call fail(8615) if (relative_resid .gt. 1.0e-10_rk) call fail(8616) call csr_free(a, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8617) call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(8618) end subroutine check_dense_pivot_solve subroutine check_invalid_configuration() integer :: ierr integer :: method integer :: preconditioner call linear_solver_configure(LSOLVER_CG, LPRECOND_JACOBI, ierr) if (ierr .ne. FEM_SUCCESS) call fail(90) call linear_solver_configure(-99, LPRECOND_JACOBI, ierr) if (ierr .eq. FEM_SUCCESS) call fail(91) call linear_solver_get_settings(method, preconditioner, ierr) if (ierr .ne. FEM_SUCCESS) call fail(92) if (method .ne. LSOLVER_CG) call fail(93) if (preconditioner .ne. LPRECOND_JACOBI) call fail(94) call linear_solver_configure(LSOLVER_BICGSTAB, -99, ierr) if (ierr .eq. FEM_SUCCESS) call fail(95) call linear_solver_get_settings(method, preconditioner, ierr) if (ierr .ne. FEM_SUCCESS) call fail(96) if (method .ne. LSOLVER_CG) call fail(97) if (preconditioner .ne. LPRECOND_JACOBI) call fail(98) call linear_solver_configure(100, LPRECOND_JACOBI, ierr) if (ierr .eq. FEM_SUCCESS) call fail(99) call linear_solver_get_settings(method, preconditioner, ierr) if (ierr .ne. FEM_SUCCESS) call fail(100) if (method .ne. LSOLVER_CG) call fail(101) if (preconditioner .ne. LPRECOND_JACOBI) call fail(102) end subroutine check_invalid_configuration subroutine make_tridiagonal(a, ierr) type(csr_matrix), intent(inout) :: a integer, intent(out) :: ierr integer :: row_ptr(4) integer :: col_ind(7) call csr_init(a) row_ptr = (/ 1, 3, 6, 8 /) col_ind = (/ 1, 2, 1, 2, 3, 2, 3 /) call csr_create_pattern(a, 3, 3, row_ptr, col_ind, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 1, 2.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 2, -ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 1, -ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 2, 2.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 3, -ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 3, 2, -ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 3, 3, 2.0_rk, ierr) end subroutine make_tridiagonal subroutine make_nonsymmetric(a, ierr) type(csr_matrix), intent(inout) :: a integer, intent(out) :: ierr integer :: row_ptr(4) integer :: col_ind(5) call csr_init(a) row_ptr = (/ 1, 3, 5, 6 /) col_ind = (/ 1, 2, 2, 3, 3 /) call csr_create_pattern(a, 3, 3, row_ptr, col_ind, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 1, 4.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 2, ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 2, 3.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 3, ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 3, 3, 2.0_rk, ierr) end subroutine make_nonsymmetric subroutine make_indefinite(a, ierr) type(csr_matrix), intent(inout) :: a integer, intent(out) :: ierr integer :: row_ptr(3) integer :: col_ind(4) call csr_init(a) row_ptr = (/ 1, 3, 5 /) col_ind = (/ 1, 2, 1, 2 /) call csr_create_pattern(a, 2, 2, row_ptr, col_ind, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 1, -2.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 1, 2, ONE, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 2, 3.0_rk, ierr) if (ierr .ne. FEM_SUCCESS) return call csr_add_value(a, 2, 1, -ONE, ierr) end subroutine make_indefinite subroutine check_close(actual, expected, code) real(rk), intent(in) :: actual real(rk), intent(in) :: expected integer, intent(in) :: code if (abs(actual - expected) .gt. TOL) call fail(code) end subroutine check_close subroutine fail(code) integer, intent(in) :: code write(*,*) 'test_linear_solver_cg failed:', code stop 1 end subroutine fail end program test_linear_solver_cg