Skip to content
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.

Sign up for GitHub

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

Jump to bottom

to_python(n_evaluation=True)-> eval_N(...).to_python() #640

Merged
merged 6 commits into from
Jul 9, 2023
Merged

to_python(n_evaluation=True)-> eval_N(...).to_python() #640

Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
b01cda6
to_python(n_evaluation=True)-> eval_N(...).to_python()
mmatera Nov 21, 2022
621f92e
Merge branch 'master' into removing_case_of_n_evaluation
mmatera Nov 27, 2022
0c54a10
Merge branch 'master' into removing_case_of_n_evaluation
mmatera Nov 28, 2022
1bdbde5
Merge branch 'master' into removing_case_of_n_evaluation
mmatera Dec 31, 2022
a4cf77b
Merge branch 'master' into removing_case_of_n_evaluation
mmatera Jul 9, 2023
4ddf3f5
Merge branch 'master' into removing_case_of_n_evaluation
mmatera Jul 9, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions mathics/algorithm/optimizers.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -202,8 +202,8 @@ def find_root_secant(f, x0, x, opts, evaluation) -> (Number, bool):
return x0, False
if not isinstance(f1, Number):
return x0, False
f0 = f0.to_python(n_evaluation=True)
f1 = f1.to_python(n_evaluation=True)
f0 = eval_N(f0, evaluation).to_python()
f1 = eval_N(f1, evaluation).to_python()
count = 0
while count < maxit:
if f0 == f1:
Expand All @@ -224,7 +224,7 @@ def find_root_secant(f, x0, x, opts, evaluation) -> (Number, bool):
)
if not isinstance(f1, Number):
return x0, False
f1 = f1.to_python(n_evaluation=True)
f1 = eval_N(f1, evaluation).to_python()
continue

inv_deltaf = from_python(1.0 / (f1 - f0))
Expand Down