{"id":21419382,"url":"https://github.com/konstantin8105/root","last_synced_at":"2025-03-16T19:41:00.766Z","repository":{"id":57650093,"uuid":"235343481","full_name":"Konstantin8105/root","owner":"Konstantin8105","description":"root-finding algorithm","archived":false,"fork":false,"pushed_at":"2024-11-29T15:29:39.000Z","size":32,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-23T06:14:25.575Z","etag":null,"topics":["algorithm","bisection-method","root-finding"],"latest_commit_sha":null,"homepage":null,"language":"Go","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/Konstantin8105.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":"2020-01-21T13:00:26.000Z","updated_at":"2024-11-29T15:29:42.000Z","dependencies_parsed_at":"2024-06-20T18:49:17.363Z","dependency_job_id":null,"html_url":"https://github.com/Konstantin8105/root","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/Konstantin8105%2Froot","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Konstantin8105%2Froot/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Konstantin8105%2Froot/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Konstantin8105%2Froot/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Konstantin8105","download_url":"https://codeload.github.com/Konstantin8105/root/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243922102,"owners_count":20369350,"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":["algorithm","bisection-method","root-finding"],"created_at":"2024-11-22T19:40:49.408Z","updated_at":"2025-03-16T19:41:00.745Z","avatar_url":"https://github.com/Konstantin8105.png","language":"Go","readme":"# root\n\nroot-finding algorithm\n\n```\npackage root // import \".\"\n\nconst (\n\t// Precision of rott-finding\n\tPrecision float64 = 1e-6\n\n\t// MaxIteration is max allowable amount of iteration.\n\t// Typically for precition=1e-6 need 20 iterations.\n\t//\n\t// Example:\n\t//\n\t//\tgo test -v -run=\"Test/Case_26\"\n\t//\n\t//\tIt.  X value         Y value         Xerror\n\t//  0    5.000000e-01    5.714286e-03    1.000000e+00\n\t//  1    7.500000e-01    2.142857e-03    5.000000e-01\n\t//  2    8.750000e-01    3.571429e-04    2.500000e-01\n\t//  3    9.375000e-01   -5.357143e-04    1.250000e-01\n\t//  4    9.062500e-01   -8.928571e-05    6.666667e-02\n\t//  5    8.906250e-01    1.339286e-04    3.448276e-02\n\t//  6    8.984375e-01    2.232143e-05    1.724138e-02\n\t//  7    9.023438e-01   -3.348214e-05    8.620690e-03\n\t//  8    9.003906e-01   -5.580357e-06    4.329004e-03\n\t//  9    8.994141e-01    8.370536e-06    2.169197e-03\n\t// 10    8.999023e-01    1.395089e-06    1.084599e-03\n\t// 11    9.001465e-01   -2.092634e-06    5.422993e-04\n\t// 12    9.000244e-01   -3.487723e-07    2.712232e-04\n\t// 13    8.999634e-01    5.231585e-07    1.356300e-04\n\t// 14    8.999939e-01    8.719308e-08    6.781500e-05\n\t// 15    9.000092e-01   -1.307896e-07    3.390750e-05\n\t// 16    9.000015e-01   -2.179827e-08    1.695404e-05\n\t// 17    8.999977e-01    3.269741e-08    8.477091e-06\n\t// 18    8.999996e-01    5.449568e-09    4.238545e-06\n\t// 19    9.000006e-01   -8.174351e-09    2.119273e-06\n\t// 20    9.000001e-01   -1.362392e-09    1.059637e-06\n\tMaxIteration int = 500\n)\n    Constants\n\n\nfunc Find(f func(float64) (float64, error), minX, maxX float64) (root float64, err error)\n    Find In mathematics, the bisection method is a root-finding method that\n    applies to any continuous functions for which one knows two values with\n    opposite signs. The method consists of repeatedly bisecting the interval\n    defined by these values and then selecting the subinterval in which the\n    function changes sign, and therefore must contain a root.\n\n    Documentation: https://en.wikipedia.org/wiki/Bisection_method\n\n        Input data:\n        \tf    - function of variable X for root-finding\n        \tminX - minimal X\n        \tmaxX - maximal X\n        Output data:\n        \troot - root of function\n        \terr  - error if some is not ok\n\n    Notes:\n\n        * Concurrency acceptable\n        * Panic-free function\n\n    Last operation of finding is run function.\n```\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkonstantin8105%2Froot","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkonstantin8105%2Froot","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkonstantin8105%2Froot/lists"}