algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 17:34:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix mypy annotations for arithmetic_analysis (#6040)

Browse Source 
* fixed mypy annotations for arithmetic_analysis

* shortened numpy references
This commit is contained in:
Leoriem-code
2022-05-12 05:35:56 +02:00
committed by GitHub
parent e23c18fb5c
commit 533eea5afa
4 changed files with 29 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
arithmetic_analysis/jacobi_iteration_method.py
View File

@ -4,13 +4,15 @@ Jacobi Iteration Method - https://en.wikipedia.org/wiki/Jacobi_method
from __future__ import annotations
import numpy as np
from numpy import float64
from numpy.typing import NDArray
# Method to find solution of system of linear equations
def jacobi_iteration_method(
coefficient_matrix: np.ndarray,
constant_matrix: np.ndarray,
init_val: list,
coefficient_matrix: NDArray[float64],
constant_matrix: NDArray[float64],
init_val: list[int],
iterations: int,
) -> list[float]:
"""
@ -99,7 +101,9 @@ def jacobi_iteration_method(
if iterations <= 0:
raise ValueError("Iterations must be at least 1")
table = np.concatenate((coefficient_matrix, constant_matrix), axis=1)
table: NDArray[float64] = np.concatenate(
(coefficient_matrix, constant_matrix), axis=1
)
rows, cols = table.shape
@ -125,7 +129,7 @@ def jacobi_iteration_method(
# Checks if the given matrix is strictly diagonally dominant
def strictly_diagonally_dominant(table: np.ndarray) -> bool:
def strictly_diagonally_dominant(table: NDArray[float64]) -> bool:
"""
>>> table = np.array([[4, 1, 1, 2], [1, 5, 2, -6], [1, 2, 4, -4]])
>>> strictly_diagonally_dominant(table)