Quadratically convergent algorithm for computing real root of non-linear transcendental equations
Abstract Objectives The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that Regula-Falsi method always gives guaranteed result but slow convergence. However, Newton–Raphson method does not give guaranteed result but faster than Regula-Falsi...
المؤلفون الرئيسيون: | , |
---|---|
التنسيق: | مقال |
اللغة: | English |
منشور في: |
BMC
2018-12-01
|
سلاسل: | BMC Research Notes |
الموضوعات: | |
الوصول للمادة أونلاين: | http://link.springer.com/article/10.1186/s13104-018-4008-z |