Ron Goldman

Ron Goldman

Auto-generated profile, based on publicly available information

Ron Goldman

Department of Computer Science Rice University 77251 Houston Texas USA

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2012 in BIT Numerical Mathematics
Verified
Journal Article
Closed access
PDF file
PSPlamen Simeonov
Plamen Simeonov
RGRon Goldman
Ron Goldman

31 July 1999 in Computer Aided Geometric Design
Verified
Journal Article
Closed access
MZMing Zhang
Ming Zhang
ECEng-Wee Chionh
Eng-Wee Chionh
RGRonald N. Goldman
Ronald N. Goldman

1 October 1997 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
SLSuresh Lodha
Suresh Lodha
RGRon Goldman
Ron Goldman
We present a unified framework for most of the known and a few new evaluation algorithms for multivariate polynomials expressed in a wide variety of bases including the Bernstein-Bézier, multinomial (or Taylor), Lagrange and Newton bases. This unification is achieved by considering evaluation algorithms for multivariate polynomials expressed in terms of L-bases, a class of bases that include the Bernstein-Bézier, multinomial, and a rich subclass of Lagrange and Newton bases. All of the known evaluation algorithms can be generated either by considering up recursive evaluation algorithms for L-bases or by examining change of basis algorithms for L-bases. For polynomials of degree n n in s s variables, the class of up recursive evaluation algorithms includes a parallel up recurrence algorithm with computational complexity O ( n s + 1 ) O(n^{s+1}) , a nested multiplication algorithm with computational complexity O ( n s log ⁡ n ) O(n^s \log n) and a ladder recurrence algorithm with computational complexity O ( n s ) O(n^s) . These algorithms also generate a new generalization of the Aitken-Neville algorithm for evaluation of multivariate polynomials expressed in terms of Lagrange L-bases. The second class of algorithms, based on certain change of basis algorithms between L-bases, include a nested multiplication algorithm with computational complexity O ( n s ) O(n^s) , a divided difference algorithm, a forward difference algorithm, and a Lagrange evaluation algorithm with computational complexities O ( n s ) O(n^s) , O ( n s ) O(n^s) and O ( n ) O(n) per point respectively for the evaluation of multivariate polynomials at several points.


13 September 2018 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
RGRon Goldman
Ron Goldman
PSPlamen Simeonov
Plamen Simeonov

1 January 2020 in Filomat
Verified
Journal Article
Open access
PDF file
FYFatma Zürnacı Yetiş
Fatma Zürnacı Yetiş
RGRon Goldman
Ron Goldman
PSPlamen Simeonov
Plamen Simeonov
Two seemingly disparate mathematical entities - quantum Bernstein bases and hypergeometric series - are revealed to be intimately related. The partition of unity property for quantum Bernstein bases is shown to be equivalent to the Chu-Vandermonde formula for hypergeometric series, and the Marsden identity for quantum Bernstein bases is shown to be equivalent to the Pfaff-Saalsch?tz formula for hypergeometric series. The equivalence of the q-versions of these formulas and identities is also demonstrated.