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

Control theoretic splines: optimal control, statistics, and path planning (princeton series in applied mathematics). by Egerstedt, Magnus, Martin, Clyde

“… In this book, they begin with a series of problems ranging from path planning to statistics to approximation…”
Get full text

Ninja: Automated integrand reduction via Laurent expansion for one-loop amplitudes by Peraro, Tiziano

“… The algorithm is suited for applications to complex one-loop processes. Program title: Ninja Catalogue identifier…”
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

“… in CAN. We formulate the problem as an integer linear programming problem. We introduce a polynomial-time algorithm for larger-size problems…”
Get full text

Recent advances in real complexity and computation : UIMP-RSME Lluís A. Santaló Summer School, recent advances in real complexity and computation, July 16-20, 2012, Universidad Internacional Menéndez Pelayo, Santander, Spain by UIMP-RSME Santaló Summer School, Montana, Jose Luis, Pardo, L. M. (Luis M.)

“…?'' These papers cover several aspects of this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity aspects…”
Get full text

Complexity and Real Computation by Blum, Lenore, Cucker, Felipe, Shub, Michael, Smale, Steve

“… The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms…”
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

A unified framework for the numerical solution and analysis of generalized algebraic quadratic matrix equations with engineering and scientific applications : theory and software design and implementation by Tsachouridis, Vassilios A

“… The essential tools for the developments of the numerical algorithms are the probability-1 homotopy methods…”
Get full text

A unified framework for the numerical solution and analysis of generalized algebraic quadratic matrix equations with engineering and scientific applications : theory and software design and implementation by Tsachouridis, Vassilios A

“… The essential tools for the developments of the numerical algorithms are the probability-1 homotopy methods…”
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

“… This method is characterized by the definition of new polynomial projections that allow the definition of structure-preserving schemes…”
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

“… Moreover, the contraflow model with inflow-dependent transit time on arcs is introduced. A strongly polynomial time algorithm to compute approximate solution…”
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

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

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