Skip to content

SYNC: update short_path.md from lecture-python-intro #28

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鈥檒l occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
mmcky merged 1 commit into from
Jun 21, 2026
Merged

SYNC: update short_path.md from lecture-python-intro #28

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion lectures/short_path.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -142,7 +142,7 @@ implement it.

### The algorithm

The standard algorithm for finding $J$ is to start an initial guess and then iterate.
The standard algorithm for finding $J$ is to start with an initial guess and then iterate.

This is a standard approach to solving nonlinear equations, often called
the method of **successive approximations**.
Expand Down
Loading