This is a Java Program to Implement Regular Falsi Algorithm. Regular Falsi method is used for finding roots of functions.
Here is the source code of the Java Program to Implement Regular Falsi Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** * Java Program to Implement Regular Falsi Algorithm **/ public class RegularFalsi { /** function to find root for **/ public double f(double x) { /** make your own function here but accordingly change (s, t) **/ return Math.cos(x) - x * x * x; // return x * x * x - 3 * x + 4; // return Math.cos(x) - 3 * x + 1; // return 2 * x - Math.log(x)/Math.log(10) - 7; // return x * x - Math.log(x) - 12; } /** function to find root **/ public double findRoot(double s, double t, double e, int m) { double r = 0.0,fr; int n, side = 0; /** starting values at endpoints of interval **/ double fs = f(s); double ft = f(t); for (n = 0; n < m; n++) { r = (fs * t - ft * s) / (fs - ft); if (Math.abs(t - s) < e * Math.abs(t + s)) break; fr = f(r); if (fr * ft > 0) { /** fr and ft have same sign, copy r to t **/ t = r; ft = fr; if (side == -1) fs /= 2; side = -1; } else if (fs * fr > 0) { /** fr and fs have same sign, copy r to s **/ s = r; fs = fr; if (side == +1) ft /= 2; side = +1; } else { /** fr * f_ very small (looks like zero) **/ break; } } return r; } /** Main function **/ public static void main(String[] args) { System.out.println("Regular Falsi Test "); RegularFalsi rf = new RegularFalsi(); /** lower limit **/ double s = 0; /** upper limit **/ double t = 1; /** half of upper bound for relative error **/ double e = 5E-15; /** number of iterations **/ int iterations = 100; System.out.println("\nRoot : "+ rf.findRoot(s, t, e, iterations)); } }
Output:
Regular Falsi Test Root : 0.8654740331016145
Related posts:
Guide to java.util.concurrent.Locks
Java Program to Implement Flood Fill Algorithm
Guide to the Java Queue Interface
Java Program to Construct an Expression Tree for an Infix Expression
Java – Write an InputStream to a File
Guide to Apache Commons CircularFifoQueue
Java Program to Implement Sorted Vector
Hướng dẫn Java Design Pattern – Singleton
Guide to ThreadLocalRandom in Java
Java Program to Implement HashMap API
Java Program to Find a Good Feedback Vertex Set
Java Program to Check Whether Topological Sorting can be Performed in a Graph
Java Program to Implement Binary Tree
Java Program to Implement Hopcroft Algorithm
Hướng dẫn sử dụng biểu thức chính quy (Regular Expression) trong Java
Serialization và Deserialization trong java
Simultaneous Spring WebClient Calls
Build a REST API with Spring and Java Config
Overview of Spring Boot Dev Tools
Get the workstation name or IP
New Features in Java 14
Java – Rename or Move a File
Java Program to Find Number of Spanning Trees in a Complete Bipartite Graph
Java – Generate Random String
Java Program to Implement Find all Forward Edges in a Graph
Java Program to Show the Duality Transformation of Line and Point
A Guide to Java HashMap
A Guide to Spring Boot Admin
Java Program to Check whether Graph is Biconnected
Spring Boot Tutorial – Bootstrap a Simple Application
Spring WebClient Requests with Parameters
Java Program to Implement Singly Linked List