Results 221 to 230 of about 51,455 (264)

Oblivious polynomial evaluation

Journal of Computer Science and Technology, 2004
The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomial P(x) and the other party (Bob) with an input x wants to learn P(x) in such an oblivious way that Bob obtains P(x) without learning any additional information about P except what is implied by P(x) and Alice does not know Bob's input x ...
Hong-Da Li 0001, Dongyao Ji, Dengguo Feng, Bao Li 0001   +3 more
openaire   +1 more source

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

Evaluation of polynomials by computer

Communications of the ACM, 1962
© 1962 ACM.
openaire   +3 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., Jiang, H., Li, H., Cheng, L., Yang, C.   +4 more
openaire   +2 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

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, Gerardo Bandera, Mario A. González, Javier Hormigo, Emilio L. Zapata   +4 more
openaire   +1 more source

Evaluation of Polynomials

1993
In this chapter, we consider the evaluation of a polynomial function of a single variable. We usually compute the value of an arithmetic function by replacing each arithmetic operation by its corresponding floating-point machine operation (see Section 3.5). Roundoff errors and cancellations sometimes cause the calculated result to be drastically wrong.
Ulrich Kulisch, Rolf Hammer, Dietmar Ratz, Matthias Hocks   +3 more
openaire   +1 more source

On the Parallel Evaluation of Multivariate Polynomials

SIAM Journal on Computing, 1978
We prove that any multivariate polynomial P of degree d that can be computed with $C(P)$ multiplications-divisions can be computed in $O(\log d \cdot \log C(P))$ parallel steps and $O(\log d)$ parallel multiplicative steps.
openaire   +2 more sources