2015Unika Repositor (Unika)Open access

Applying Bisection Method to Solve Nonlinear Equations

BILLIANTO, ARDY

Open full text 0 citations

Abstract

High rank equation is a function to search for the roots of an equation \nresults . In the high rank of the equation can be solved by some means or \nmethods . The method can be used to solve the equations of high rank is a \nnumerical method , graphical method , bisection method , secant method and \nNewton-Raphson method . \nThe method to be used is the bisection method. Bisection is a concept to \ncalculate the result of the roots of equation of High Rank. Bisection method is \nalso called the method divided by two. So how to find the end result is to use \nthe middle value or the result of the division of two values. This method is \nused because it is easier and quicker to understand but longer in the \ncalculations . \nBisection method implementation is done by using the c language. The end \nresult of this process is to find the value bisection x average to find a point x \nis close to zero

Open-access reader

About this research paper

What this paper is about

High rank equation is a function to search for the roots of an equation \nresults . In the high rank of the equation can be solved by some means or \nmethods . The method can be used to solve the equations of high rank is a \nnumerical method , graphical method , bisection method , secant method and \nNewton-Raphson method . \nThe method to be used is the bisection method. Bisection is a concept to \ncalculate the result of the roots of equation of High Rank. Bisection method is \nalso called the method divided by two. So how to find the end result is to use \nthe middle value or the result of the division of two values. This method is \nused because it is easier and quicker to understand but longer in the \ncalculations . \nBisection method implementation is done by using the c language. The end \nresult of this process is to find the value bisection x average to find a point x \nis close to zero

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

High rank equation is a function to search for the roots of an equation \nresults . In the high rank of the equation can be solved by some means or \nmethods . The method can be used to solve the equations of high rank is a \nnumerical method , graphical method , bisection method , secant method and \nNewton-Raphson method . \nThe method to be used is the bisection method. Bisection is a concept to \ncalculate the result of the roots of equation of High Rank. Bisection method is \nalso called the method divided by two. So how to find the end result is to use \nthe middle value or the result of the division of two values. This method is \nused because it is easier and quicker to understand but longer in the \ncalculations . \nBisection method implementation is done by using the c language. The end \nresult of this process is to find the value bisection x average to find a point x \nis close to zero

Key concepts: Bisection method, Bisection, Rank (graph theory), Mathematics, Applied mathematics, Nonlinear system, Newton's method, Function (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Applying Bisection Method to Solve Nonlinear Equations — Research Paper | ScholarLens