Skip to content

Numerical Explorations

Computer Science

  • Home
  • Contact

Tag: Regula Falsi

Root Finding Algorithms by James Pate Williams, BA, BS, MSwE, PhD

Root Finding Algorithms by James Pate Williams, BA, BS, MSwE, PhD

We designed and implemented a C# application that uses the following root finding algorithms:

  1. Bisection Method
  2. Brent’s Method
  3. Newton’s Method
  4. Regula Falsi

https://en.wikipedia.org/wiki/Bisection_method

https://en.wikipedia.org/wiki/Brent%27s_method

https://en.wikipedia.org/wiki/Newton%27s_method

https://en.wikipedia.org/wiki/False_position_method

rfa f 1

rfa f 2

bs 0bs 1br 1nm 1rf 1bs 2br 2nm 2rf 2bs 3br 3nm 3rf 3nm 0rf 0

The source code files are displayed below as Word files:

BisectionMethod – Copy

BrentsMethod – Copy.cs

MainForm – Copy.cs

NewtonsMethod – Copy.cs

RegulaFalsi – Copy.cs

Unknown's avatarAuthor jamespatewilliamsjrPosted on July 29, 2018July 29, 2018Categories C# Computer Programming Language, Root Finding AlgorithmsTags Bisection Method, Brent's Method, C/C++, Computer Science, Newton's Method, Numerical Analysis, Regula FalsiLeave a comment on Root Finding Algorithms by James Pate Williams, BA, BS, MSwE, PhD

Enter your email address to follow this blog and receive notifications of new posts by email.

Join 9 other subscribers
  • Home
  • Contact
Numerical Explorations Blog at WordPress.com.
  • Subscribe Subscribed
    • Numerical Explorations
    • Already have a WordPress.com account? Log in now.
    • Numerical Explorations
    • Subscribe Subscribed
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar
 

Loading Comments...