algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 10:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Indent ... for visual purposes (#7744)

Browse Source
This commit is contained in:
Caeden Perelli-Harris
2022-10-27 18:42:30 +01:00
committed by GitHub
parent e8915097c4
commit 9bba42eca8
46 changed files with 134 additions and 134 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
arithmetic_analysis/jacobi_iteration_method.py
View File

@ -42,7 +42,7 @@ def jacobi_iteration_method(
>>> iterations = 3
>>> jacobi_iteration_method(coefficient, constant, init_val, iterations)
Traceback (most recent call last):
...
...
ValueError: Coefficient matrix dimensions must be nxn but received 2x3
>>> coefficient = np.array([[4, 1, 1], [1, 5, 2], [1, 2, 4]])
@ -51,7 +51,7 @@ def jacobi_iteration_method(
>>> iterations = 3
>>> jacobi_iteration_method(coefficient, constant, init_val, iterations)
Traceback (most recent call last):
...
...
ValueError: Coefficient and constant matrices dimensions must be nxn and nx1 but
received 3x3 and 2x1
@ -61,7 +61,7 @@ def jacobi_iteration_method(
>>> iterations = 3
>>> jacobi_iteration_method(coefficient, constant, init_val, iterations)
Traceback (most recent call last):
...
...
ValueError: Number of initial values must be equal to number of rows in coefficient
matrix but received 2 and 3
@ -71,7 +71,7 @@ def jacobi_iteration_method(
>>> iterations = 0
>>> jacobi_iteration_method(coefficient, constant, init_val, iterations)
Traceback (most recent call last):
...
...
ValueError: Iterations must be at least 1
"""
@ -138,7 +138,7 @@ def strictly_diagonally_dominant(table: NDArray[float64]) -> bool:
>>> table = np.array([[4, 1, 1, 2], [1, 5, 2, -6], [1, 2, 3, -4]])
>>> strictly_diagonally_dominant(table)
Traceback (most recent call last):
...
...
ValueError: Coefficient matrix is not strictly diagonally dominant
"""