scholarly journals Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra

2021 ◽  
Vol 352 ◽  
pp. 167-172
Author(s):  
Zoltán Kovács ◽  
Róbert Vajda
Keyword(s):  
Geometric Inequalities ◽  
Root Finding

scholarly journals DoA Estimation Using Neural Tangent Kernel under Electromagnetic Mutual Coupling

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1057
Author(s):  
Qifeng Wang ◽  
Xiaolin Hu ◽  
Xiaobao Deng ◽  
Nicholas E. Buris
Keyword(s):  
Mutual Coupling ◽  
Deep Neural Network ◽  
Doa Estimation ◽  
Antenna Element ◽  
Root Finding ◽  
Multiple Signal ◽  
Estimation Problems ◽  
Limiting Case ◽  
Signal Doa Estimation ◽  
Polynomial Root Finding

Antenna element mutual coupling degrades the performance of Direction of Arrival (DoA) estimation significantly. In this paper, a novel machine learning-based method via Neural Tangent Kernel (NTK) is employed to address the DoA estimation problem under the effect of electromagnetic mutual coupling. NTK originates from Deep Neural Network (DNN) considerations, based on the limiting case of an infinite number of neurons in each layer, which ultimately leads to very efficient estimators. With the help of the Polynomial Root Finding (PRF) technique, an advanced method, NTK-PRF, is proposed. The method adapts well to multiple-signal scenarios when sources are far apart. Numerical simulations are carried out to demonstrate that this NTK-PRF approach can handle, accurately and very efficiently, multiple-signal DoA estimation problems with realistic mutual coupling.

scholarly journals A Comparative Study among New Hybrid Root Finding Algorithms and Traditional Methods

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1306
Author(s):  
Elsayed Badr ◽  
Sultan Almotairi ◽  
Abdallah El Ghamry
Keyword(s):  
Comparative Study ◽  
Numerical Results ◽  
Traditional Methods ◽  
Running Time ◽  
Root Finding ◽  
Average Running Time ◽  
False Position ◽  
Newton Raphson ◽  
Number Of Iterations

In this paper, we propose a novel blended algorithm that has the advantages of the trisection method and the false position method. Numerical results indicate that the proposed algorithm outperforms the secant, the trisection, the Newton–Raphson, the bisection and the regula falsi methods, as well as the hybrid of the last two methods proposed by Sabharwal, with regard to the number of iterations and the average running time.

An implicit multistep numerical method for real-time simulation of stiff systems

SIMULATION ◽  
2021 ◽  
pp. 003754972110216
Author(s):  
Zhang Lei ◽  
Li Jie ◽  
Wang Menglu ◽  
Liu Mengya
Keyword(s):  
Differential Equations ◽  
Numerical Method ◽  
Real Time ◽  
Physical System ◽  
Physical Models ◽  
Stiff Systems ◽  
Real Time Simulation ◽  
Stiff Ordinary Differential Equations ◽  
Root Finding ◽  
Time Simulation

Simulating a physical system in real-time is widely used in equipment design, test, and validation. Though an implicit multistep numerical method excels at solving physical models that are usually composed of stiff ordinary differential equations, it is not suitable for real-time simulation because of state discontinuity and massive iterations for root finding. Thus, a method based on the backward differential formula is presented. It divides the main fixed step of real-time simulation into limited minor steps according to computing cost and accuracy demand. By analyzing and testing its capability, this method shows advantage and efficiency in real-time simulation, especially when the system contains stiff equations. A simulation application will have more flexibility while using this method.

Optimal iterative processes for root-finding

1972 ◽  
Vol 20 (5) ◽  
pp. 327-341 ◽  
Author(s):  
Richard Brent ◽  
Shmuel Winograd ◽  
Philip Wolfe
Keyword(s):  
Iterative Processes ◽  
Root Finding

Semimartingales and geometric inequalities on manifolds

2007 ◽  
Vol 75 (2) ◽  
pp. 522-544 ◽  
Author(s):  
Huiling Le ◽  
Dennis Barden
Keyword(s):  
Geometric Inequalities

scholarly journals Root finding with threshold circuits

2012 ◽  
Vol 462 ◽  
pp. 59-69 ◽  
Author(s):  
Emil Jeřábek
Keyword(s):  
Root Finding ◽  
Threshold Circuits

scholarly journals Efficient high degree polynomial root finding using GPU

2017 ◽  
Vol 18 ◽  
pp. 46-56 ◽  
Author(s):  
Kahina Ghidouche ◽  
Abderrahmane Sider ◽  
Raphaël Couturier ◽  
Christophe Guyeux
Keyword(s):  
Degree Polynomial ◽  
Root Finding ◽  
High Degree ◽  
Polynomial Root Finding
Sign in / Sign up

Export Citation Format

Share Document