Skip to content

Latest commit

 

History

History
13 lines (9 loc) · 388 Bytes

README.md

File metadata and controls

13 lines (9 loc) · 388 Bytes

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.