نتایج جستجو برای: root finding

تعداد نتایج: 387642  

Journal: :IEEE Transactions on Information Theory 2005

Journal: :IEEE robotics and automation letters 2023

Robotic systems have subsystems with a combinatorially large configuration space and hundreds or thousands of possible software hardware options interacting non-trivially. The configurable parameters are set to target specific objectives, but they can cause functional faults when incorrectly configured. Finding the root such is challenging due exponentially dependencies between robot's settings...

Journal: :Applied Mathematics and Computation 2007
Nenad Ujevic Goran Erceg Ivan Lekic

K e y w o r d s N o n l i n e a r equations, Iteration method, Root finding, Order of convergence. 1. I N T R O D U C T I O N The problem of finding a real root of the nonlinear equation,

‎In this paper‎, ‎we present a new modification of Newton's method‎ ‎for finding a simple root of a nonlinear equation‎. ‎It has been‎ ‎proved that the new method converges cubically‎.

Elnaz Mosavi Khoonsari, Maryam ghamari,

The main objective of endodontic therapy is the thorough mechanical and chemical cleansing of the entire root canal system and its complete obturation with an inert filling material. Failure to find and fill a canal contributes toward the failure of endodontic therapy .The root canal anatomy of mandibular first molars is complex. Studies of the morphologic structure of root canal systems hav...

2017
Biba Vikas B S Akhil S R Suja K Sujathan

Natural products such as plants, animals and minerals have been the basis of treatment of human diseases. Herbal remedies have been used for the treatment of many ailments. Many compounds have been derived from the plant species mentioned in the ancient texts of Indian system of medicine for the treatment of a number of ailments. The R and D thrust in the pharmaceutical sector is focused on dev...

1997
GREGORIO MALAJOVICH JORGE P. ZUBELLI

A new algorithm for splitting polynomials is presented. This algorithm requires O(d log −1)1+δ floating point operations, with O(log −1)1+δ bits of precision. As far as complexity is concerned, this is the fastest algorithm known by the authors for that problem. An important application of the method is factorizing polynomials or polynomial root-finding.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید