-
-
Notifications
You must be signed in to change notification settings - Fork 107
feat: menambahkan algoritma taylor #347
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Ateng-labrador
wants to merge
4
commits into
bellshade:main
Choose a base branch
from
Ateng-labrador:taylor
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,124 @@ | ||
| # macam - macam deret taylor | ||
| # https://en.wikipedia.org/wiki/Taylor_series | ||
| import math | ||
|
|
||
|
|
||
| def faktorial(n: int) -> int: | ||
| """ | ||
| Fungsi untuk kalkulasi faktorial | ||
| parameter : | ||
| n = bilangan bulat | ||
| return : | ||
| hasil = hasil dari operasi faktorial | ||
| """ | ||
| if n == 1 or n == 0: | ||
| return 1 | ||
| if n > 1: | ||
| return n * faktorial(n - 1) | ||
| else: | ||
| return ValueError("Nilai Tidak valid") | ||
|
|
||
|
|
||
| def sin(x: float) -> float: | ||
| """ | ||
| Fungsi untuk kalkulasi dari deret sin. | ||
| Input dari fungsi ini dikonvergensi menjadi | ||
| radian. | ||
| >>> sin(0) | ||
| 0.0 | ||
| >>> sin(45) | ||
| 0.7071067811865475 | ||
| """ | ||
| result = 0.0 | ||
| interable = 10 | ||
| radian = x * math.pi / 180 | ||
| for i in range(interable + 1): | ||
| numerator = math.pow(radian, (1 + i * 2)) * math.pow(-1, i) | ||
| detector = faktorial((1 + 2 * i)) | ||
| result = result + (numerator / detector) | ||
| return float(result) | ||
|
|
||
|
|
||
| def cos(x: float) -> float: | ||
| """ | ||
| Fungsi untuk kalkulasi dari deret cosinus. | ||
| Input dari fungsi ini dikonvergensi menjadi | ||
| radian. | ||
| >>> cos(0) | ||
| 1.0 | ||
| >>> cos(45) | ||
| 0.7071067811865475 | ||
| """ | ||
| result = 0.0 | ||
| interable = 10 | ||
| radian = x * math.pi / 180 | ||
| for i in range(interable): | ||
| numerator = math.pow(radian, 2 * i) * math.pow(-1, i) | ||
| detector = faktorial(2 * i) | ||
| result = result + (numerator / detector) | ||
| return float(result) | ||
|
|
||
|
|
||
| def euler(x: int = 1) -> float: | ||
| """ | ||
| Fungsi untuk kalkulasi dari deret | ||
| taylor euler e^x | ||
| >>> euler(1) | ||
| 2.7182815255731922 | ||
| >>> euler(2) | ||
| 7.3887125220458545 | ||
| """ | ||
| result = 0.0 | ||
| interable = 10 | ||
| for i in range(interable): | ||
| numerator = math.pow(x, (i)) | ||
| detector = faktorial(i) | ||
| result = result + (numerator / detector) | ||
| return float(result) | ||
|
|
||
|
|
||
| def ln(x: float) -> float: | ||
| """ | ||
| Fungsi untuk melakukan kalkulasi deret taylor | ||
| ln(x + 1).Dengan batas -1 < x <= 1. | ||
| >>> ln(0.5) | ||
| 0.4054346478174603 | ||
| >>> ln(1) | ||
| 0.6456349206349207 | ||
| """ | ||
| if x > -1 and x <= 1: | ||
| result = 0.0 | ||
| interable = 10 | ||
| for i in range(1, interable + 1): | ||
| numerator = math.pow(x, i) * math.pow(-1, i + 1) | ||
| detector = i | ||
| result = result + (numerator / detector) | ||
| return float(result) | ||
| else: | ||
| return ValueError("Angka tidak valid") | ||
|
|
||
|
|
||
| def main(args=None): | ||
| import doctest | ||
|
|
||
| doctest.testmod() | ||
|
|
||
| # test untuk fungsi cos | ||
| print(cos(0)) | ||
| print(cos(45)) | ||
|
|
||
| # test untuk fungsi sin | ||
| print(sin(0)) | ||
| print(sin(45)) | ||
|
|
||
| # test untuk fungsi euler | ||
| print(euler(1)) | ||
| print(euler(2)) | ||
|
|
||
| # test untuk fungsi ln(1 + x) | ||
| print(ln(0.5)) | ||
| print(ln(1)) | ||
|
|
||
|
|
||
| if __name__ == "__main__": | ||
| main() | ||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.