Results 261 to 270 of about 17,255,193 (320)
Some of the next articles are maybe not open access.

Hardwired polynomial evaluation

Journal of Parallel and Distributed Computing, 1988
Abstract This paper is devoted to the evaluation of polynomials and elementary functions by special-purpose circuits. First we recall the basic results concerning the approximation of mathematical functions by polynomials (these results enable us to compute every continuous function if we are able to compute polynomials); then we describe a simple ...
Jean Duprat, Jean-Michel Muller
openaire   +1 more source

On the Parallel Evaluation of Polynomials

IEEE Transactions on Computers, 1973
If an unlimited number of processors is available, then for any given number of steps s, s≥1, polynomials of degree as large as C2n-δcan be evaluated, where C= √2 and δ ≈ √2s. This implies polynomials of degree can be evaluated in log 2 n+√2log 2 n +0(1) steps. Various techniques for the evaluation of polynomials in a "reasonable number" of "steps" are
openaire   +2 more sources

Accurate Evaluation of Bivariate Polynomials

2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2016
Polynomials are widely used in scientific computing and engineering. In this paper, we present an accurate and fast compensated algorithm to evaluate bivariate polynomials with floating-point coefficients. This algorithm is applying error free transformations to the bivariate Horner scheme and sum the final decomposition accurately.
Du, P.   +4 more
openaire   +2 more sources

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps

Cryptology and Network Security, 2013
Verifiable computation (VC) allows a computationally weak client to outsource evaluation of a function on many inputs to a powerful but untrusted server.
L. Zhang, R. Safavi-Naini
semanticscholar   +1 more source

Evaluation of polynomials by computer

Communications of the ACM, 1962
[no abstract] ; © 1962 ACM.
openaire   +3 more sources

Efficient evaluation of multivariate polynomials

Computer Aided Geometric Design, 1986
The authors give an algorithm to evaluate a polynomial of total degree d defined on a triangle T in the plane, \[ p(r,s,t)=\sum^{d}_{i=0}\sum^{i}_{j=0}c_{d-i,i-j,j}\cdot r^{d- i}s^{i-j}t^ j, \] where \(c_{d-i,i-j,j}=(d!/(d-i)!(i-j)!j!)b_{d- i,i-j,j}\), \(0\leq j\leq i\), \(0\leq i\leq d\), and (r,s,t) are the barycentric coordinates of each point in T,
Larry L. Schumaker, Wolfgang Volk
openaire   +2 more sources

Polynomial evaluation and associated polynomials

Numerische Mathematik, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A comprehensive experimental evaluation of orthogonal polynomial expanded random vector functional link neural networks for regression

Applied Soft Computing, 2017
The Random Vector Functional Link Neural Network (RVFLNN) enables fast learning through a random selection of input weights while learning procedure determines only output weights.
N. Vukovic   +2 more
semanticscholar   +1 more source

Dual-Channel Multiplier for Piecewise-Polynomial Function Evaluation for Low-Power 3-D Graphics

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2019
A dual-channel multiplier (DCM) for energy efficient second-order piecewise-polynomial function evaluation for 3-D graphics applications is presented in this paper.
D. Ellaithy   +3 more
semanticscholar   +1 more source

Polynomial evaluation on multimedia processors

Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors, 2003
In this paper we deal with polynomial evaluation based on new processor architectures for multimedia applications. We introduce some algorithms to take advantage of the new attributes of multimedia processors, such as VLIW (very long instruction word) and SIMD (single instruction multiple data architecture) architectures.
Julio Villalba   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy