Search Results - Numerical Algorithms AND Problems—Computations on polynomials*

Division-free computation of subresultants using Bezout matrices by Kerber, Michael

“…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L…”
Get full text

Optimal routing and heterogeneous resource allocation for computing-aware networks by Ding, Hongqing, He, Fujun, Zhang, Pengfei, Zhang, Liang, Zhang, Xiaoxiao, Qi, Meiyu

“… The numerical results reveal that the introduced algorithm reduces the computation time 9.18 times, with increasing the objective no more than…”
Get full text

Lightweight Precision Inertial Computation based on Chebyshev Polynomial Optimization by Zhu, Maoran, Wu, Yuanxin

“… Numerical results show that the derived polynomial optimization-based algorithm achieves precision and lightweight inertial navigation computation, that is to say, not only reducing the motion noncommutativity error to the machine precision level but possessing much improved computational efficiency against the state of the art…”
Get full text

Fast and accurate method for high order Zernike moments computation by Singh, Chandan, Upneja, Rahul

“… They, however, suffer from various errors, such as discretization error, geometric error and numerical integration error…”
Get full text

Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode by Stecke, Kathryn E, Zhao, Xuying

“…When a make-to-order manufacturing company adopts a commit-to-delivery business mode, it commits a delivery due date for an order and is responsible for the…”
Get full text

On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order by Abdulhussain, Sadiq H., Ramli, Abd Rahman, Al-Haddad, Syed Abdul Rahman, Mahmmod, Basheera M., Jassim, Wissam A.

“… The common problem of the TP is that the coefficients computation is prone to numerical instabilities when the polynomial order becomes large…”
Get full text

Hybrid evolution strategies for simultaneous solving all real roots of polynomial by Ming Zhang, Li Yin, Yongquan Zhou

“… algorithms in finding roots of polynomial. Numerical computation results indicate that the algorithm offers effective way to finding real roots of polynomial, high…”
Get full text

Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram by Erhel, Jocelyne, Migot, Tangi

“…In this paper, we study the properties of a geochemical model involving aqueous and precipitation-dissolution reactions at a local equilibrium in a diluted…”
Get full text

Stabilization-free Virtual Element Method for 2D second order elliptic equations by Berrone, Stefano, Borio, Andrea, Fassino, Davide, Marcon, Francesca

“… Several numerical tests assess the stability of the method and the robustness in solving problems characterized by anisotropies…”
Get full text

Finding Mixed Cells in the Mixed Volume Computation by Li, T Y, Li, Xing

“… This paper gives a new algorithm for the mixed cell computation via a new formulation of the underlying linear programming problems…”
Get full text

Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal by Pyakurel, Urmila, Nath, Hari Nandan, Dempe, Stephan, Dhamala, Tanka Nath

“… of the quickest partial contraflow problem on two terminal networks is presented, which is substantiated by numerical computations…”
Get full text

Multivariate Polynomial Factorization by Interpolation Method by Zhang, Jingzhong, Feng, Yong

“… Conventional factorization algorithms use symbolic methods to get exact factors of a polynomial while approximate factorization algorithms use numerical methods to get approximate factors of a polynomial…”
Get full text

Combining algebraic and numerical methods in algorithm design by Yu, Yanqiang

“… In the case of multipoint polynomial evaluation and polynomial interpolation, by converting the problem into dense structured matrix computation, we have developed efficient approximation algorithm…”
Get full text

Role of electron relaxation time in the resonance behavior of a graphene strip grating in a slab by Zinenko, Tatiana L.

“… The resulting numerical algorithm possesses guaranteed convergence and controlled accuracy of computations including the vicinities of sharp resonances…”
Get full text

Parameter identification via shifted Legendre polynomials by CHANG, RONG-YEU, WANG, MAW-LING

“… invariant linear systems. By employing operational matrix of shifted Legendre polynomials to approach identification problem, the algorithms for computation are effective and straightforward, and the computational results…”
Get full text

Nonnegative splines, in particular of degree five by Oberle, H.J., Opfer, G.

Get full text