mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-03-13 09:50:19 +08:00
[pre-commit.ci] pre-commit autoupdate (#11322)
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
committed by
GitHub
parent
5f95d6f805
commit
bc8df6de31
@@ -4,6 +4,7 @@ Use the Adams-Bashforth methods to solve Ordinary Differential Equations.
|
||||
https://en.wikipedia.org/wiki/Linear_multistep_method
|
||||
Author : Ravi Kumar
|
||||
"""
|
||||
|
||||
from collections.abc import Callable
|
||||
from dataclasses import dataclass
|
||||
|
||||
|
||||
@@ -1,11 +1,11 @@
|
||||
"""
|
||||
Python program to show how to interpolate and evaluate a polynomial
|
||||
using Neville's method.
|
||||
Neville’s method evaluates a polynomial that passes through a
|
||||
given set of x and y points for a particular x value (x0) using the
|
||||
Newton polynomial form.
|
||||
Reference:
|
||||
https://rpubs.com/aaronsc32/nevilles-method-polynomial-interpolation
|
||||
Python program to show how to interpolate and evaluate a polynomial
|
||||
using Neville's method.
|
||||
Neville’s method evaluates a polynomial that passes through a
|
||||
given set of x and y points for a particular x value (x0) using the
|
||||
Newton polynomial form.
|
||||
Reference:
|
||||
https://rpubs.com/aaronsc32/nevilles-method-polynomial-interpolation
|
||||
"""
|
||||
|
||||
|
||||
|
||||
@@ -9,6 +9,7 @@ with the precision of the approximation increasing as the number of iterations i
|
||||
|
||||
Reference: https://en.wikipedia.org/wiki/Newton%27s_method
|
||||
"""
|
||||
|
||||
from collections.abc import Callable
|
||||
|
||||
RealFunc = Callable[[float], float]
|
||||
|
||||
@@ -1,6 +1,7 @@
|
||||
"""
|
||||
Approximates the area under the curve using the trapezoidal rule
|
||||
"""
|
||||
|
||||
from __future__ import annotations
|
||||
|
||||
from collections.abc import Callable
|
||||
|
||||
@@ -4,6 +4,7 @@ Use the Runge-Kutta-Gill's method of order 4 to solve Ordinary Differential Equa
|
||||
https://www.geeksforgeeks.org/gills-4th-order-method-to-solve-differential-equations/
|
||||
Author : Ravi Kumar
|
||||
"""
|
||||
|
||||
from collections.abc import Callable
|
||||
from math import sqrt
|
||||
|
||||
|
||||
@@ -2,6 +2,7 @@
|
||||
Implementing Secant method in Python
|
||||
Author: dimgrichr
|
||||
"""
|
||||
|
||||
from math import exp
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user