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:
Java Program to Use Dynamic Programming to Solve Approximate String Matching
Java Program to Implement Fermat Factorization Algorithm
Java Copy Constructor
Comparing Arrays in Java
Lập trình đa luồng với CompletableFuture trong Java 8
Java Program to Find Number of Articulation points in a Graph
Spring Boot - Interceptor
Serialize Only Fields that meet a Custom Criteria with Jackson
Merging Streams in Java
Circular Dependencies in Spring
Simultaneous Spring WebClient Calls
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
Java Program to Check the Connectivity of Graph Using BFS
Guava – Join and Split Collections
Spring Data JPA @Modifying Annotation
Guide to the Volatile Keyword in Java
A Guide to the finalize Method in Java
Java Program to Implement Euler Circuit Problem
Spring WebClient Filters
Apache Commons Collections Bag
Java Program to Implement SimpeBindings API
Intro to the Jackson ObjectMapper
Java Program to Implement Doubly Linked List
Receive email using POP3
Quản lý bộ nhớ trong Java với Heap Space vs Stack
Java Program to Generate Random Numbers Using Probability Distribution Function
Sao chép các phần tử của một mảng sang mảng khác như thế nào?
Java Program to Implement the Bin Packing Algorithm
A Quick JUnit vs TestNG Comparison
4 tính chất của lập trình hướng đối tượng trong Java
Java Deep Learning Essentials - Yusuke Sugomori
Extract links from an HTML page