{"id":22462561,"url":"https://github.com/louis-finegan/root-finding-algorithms-c","last_synced_at":"2026-05-04T06:31:30.671Z","repository":{"id":166016403,"uuid":"611815143","full_name":"Louis-Finegan/Root-Finding-Algorithms-c","owner":"Louis-Finegan","description":"Algorithms for root finding writting in c with, bash shell script that compiles and runs all executable files.","archived":false,"fork":false,"pushed_at":"2023-04-17T20:20:00.000Z","size":19,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T18:36:34.420Z","etag":null,"topics":["algorithms","bash","bash-shell-script","bisection-method","c-programming-language","false-position-method","fixed-point-iteration","gcc-complier","linux-shell","newton-raphson","numerical-analysis","numerical-methods","regula-falsi","root-finding","ubuntu"],"latest_commit_sha":null,"homepage":"https://github.com/Louis-Finegan/Root-Finding-Algorithms-c","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Louis-Finegan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-03-09T15:49:17.000Z","updated_at":"2023-03-24T13:23:18.000Z","dependencies_parsed_at":null,"dependency_job_id":"d08e9d30-29c4-4d5d-9800-ab353a3ae740","html_url":"https://github.com/Louis-Finegan/Root-Finding-Algorithms-c","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Louis-Finegan%2FRoot-Finding-Algorithms-c","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Louis-Finegan%2FRoot-Finding-Algorithms-c/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Louis-Finegan%2FRoot-Finding-Algorithms-c/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Louis-Finegan%2FRoot-Finding-Algorithms-c/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Louis-Finegan","download_url":"https://codeload.github.com/Louis-Finegan/Root-Finding-Algorithms-c/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245858889,"owners_count":20684062,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","bash","bash-shell-script","bisection-method","c-programming-language","false-position-method","fixed-point-iteration","gcc-complier","linux-shell","newton-raphson","numerical-analysis","numerical-methods","regula-falsi","root-finding","ubuntu"],"created_at":"2024-12-06T09:10:11.737Z","updated_at":"2026-05-04T06:31:30.624Z","avatar_url":"https://github.com/Louis-Finegan.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Root Finding Algorithms in the c programming language\n\nWriten in Linux Ubuntu 20.04.2 LTS.\n\n## Algorithms\n\n1. Bisection Method.\n\n2. False Position (Regula Falsi) Method.\n\n3. Newton-Raphson Method.\n\n4. Fixed Point Method.\n\n## Example Case:\n\nLet $f(x) = 3x^2 - 2x +6$. The value can $x$ such that $f(x)=0$ was calculated by the above algorithms.\n\n## How to use\n\n1. Run the following command in the terminal:\n\n\u003cpre\u003e\u003ccode\u003e\n\t./run.sh\n\u003c/code\u003e\u003c/pre\u003e\n\n2. Enter in the required quantities in the different fields until the program finshes.\n\n## Results\n\n\n\u003cpre\u003e\u003ccode\u003e\n\tSTARTING PROGRAM\n\n\tFile Names:\n\t1. bisection-method.c\n\t2. false-position-method.c\n\t3. fixed-point-iteration-method.c\n\t4. newton-raphson-method.c\n\n\tWere Compiled\n\t\n\tRunning applications:\n\n\n\t---STARTING BISECTION METHOD---\n\n\tEnter an a: -1\n\tEnter a b:  0\n\tEnter the number of iterations: 100\n\n\tBisection Method: Solution is -0.290994\n\tinitial interval: [-1.000000, 0.000000]\n \tnumber of iterations is: 100\n\n\t---ENDING BISECTION METHOD---\n\n\t---STARTING FALSE POSITION METHOD---\n\n\tEnter an a: -1\n\tEnter a b:  0\n\tEnter the number of iterations: 100\n\n\tFalse Position Method: Solution is -0.290994\n\tinitial interval: [-1.000000, 0.000000]\n\t number of iterations is: 100\n\n\t---ENDING FALSE POSITION METHOD---\n\n\t---STARTING FIXED POINT ITERATION---\n\n\tEnter an initial guess: 0\n\n\tEnter a tolerance:  0.00001\n\tEnter the maximum number of iterations: 1000\n\n\tFixed Point Iteration: Solution is -0.290995\n\n\t---ENDING FIXED POINT ITERATION---\n\n\t---STARTING NEWTOW RAPHSON METHOD---\n\n\tEnter an initial guess: 0\n\tEnter the number of iterations: 100\n\n\tNewton Raphson Method: Solution is -0.290994\n\tnumber of iterations is: 100\n\n\t---ENDING NEWTON RAPHSON METHOD---\n\n\tENDING PROGRAM\n\u003c/code\u003e\u003c/pre\u003e\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flouis-finegan%2Froot-finding-algorithms-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flouis-finegan%2Froot-finding-algorithms-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flouis-finegan%2Froot-finding-algorithms-c/lists"}