Skip to content

The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

License

Notifications You must be signed in to change notification settings

cppf/secant-root

Repository files navigation

The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

Course: Numerical Methods Laboratory, Monsoon 2011
Taught by: Prof. Bata Krushna Ojha

See main.cpp for code.

About

The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

Topics

Resources

License

Stars

Watchers

Forks