Results 21 to 30 of about 281,189 (325)
The forward kinematics in parallel manipulators is a mathematically challenging issue, unlike serial manipulators. Kinematic constraint equations are non-linear transcendental equations that can be reduced to algebraic equations with appropriate ...
Ercan Düzgün, Osman Kopmaz
doaj +1 more source
Smart building uncertainty analysis via adaptive Lasso
Uncertainty analysis plays a pivotal role in identifying the important parameters affecting building energy consumption and estimate their effects at the early design stages.
Bingqing Lin, Bei Yu
doaj +1 more source
Privacy-preserving verifiable delegation of polynomial and matrix functions
Outsourcing computation has gained significant popularity in recent years due to the development of cloud computing and mobile services. In a basic outsourcing model, a client delegates computation of a function f on an input x to a server. There are two
Zhang Liang Feng, Safavi-Naini Reihaneh
doaj +1 more source
Generalizations of the Eneström–Kakeya Theorem Involving Weakened Hypotheses
The well-known Eneström–Kakeya Theorem states that, for P(z)=∑ℓ=0naℓzℓ, a polynomial of degree n with real coefficients satisfying 0≤a0≤a1≤⋯≤an, then all the zeros of P lie in |z|≤1 in the complex plane. Motivated by recent results concerning an Eneström–
Robert Gardner, Matthew Gladin
doaj +1 more source
Equiconvergence of some sequences of rational functions
The phenomenon of equiconvergence was first observed by Walsh for two sequences of polynomial interpolants to a class of functions. Here we obtain analogues of Yuanren's results for Walsh equiconvergence using rational functions as in Saff and Sharma. We
M. A. Bokhari, A. Sharma
doaj +1 more source
In order to improve the accuracy and resolution for transmit beamspace (TB) multiple‐input multiple‐output (MIMO) radar, a search‐free direction‐of‐arrival (DOA) estimation method based on tensor modelling and polynomial rooting is proposed.
Feng Xu, Xiaopeng Yang, Tian Lan
doaj +1 more source
On Polynomial and Polynomial Matrix Interpolation [PDF]
The classical algorithms for computations with polynomials and polynomial matrices use elementary operations with their coefficients. The relative accuracy of such algorithms is relatively small and for polynomials of higher order and polynomial matrices of higher dimension the executing time grows very quickly.
Petr Husek, Renata Pytelková
openaire +1 more source
INEQUALITIES CONCERNING B-OPERATORS
Let P_n be the class of polynomials of degree at most n. Rahman introduced the class B_n of operators B that map P_n into itself. In this paper we prove some results concerning such operators and thereby obtain generalizations of some well known ...
W. M. Shah, A. Liman
doaj +1 more source
Novel priori-knowledge-free manoeuvring target-tracking method
In the past few decades, many manoeuvring target-tracking methods have been proposed. However, most of these methods require some priori knowledge about the target, which is hard to obtain in many scenarios.
Jin-Peng Guo, Quan-Hua Liu, Jia Xu
doaj +1 more source
Polynomial reconstruction of the matching polynomial
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph.
Xueliang Li, Yongtang Shi, Martin Trinks
openaire +5 more sources

