Search Results - "Joldes, Mioara"
-
1
Efficient Floating-Point Implementation of the Probit Function on FPGAs
Published in Journal of signal processing systems (01-12-2021)“…Non-uniform random number generators are key components in Monte Carlo simulations. The inverse cumulative distribution function (ICDF) technique provides a…”
Get full text
Journal Article -
2
Rigorous uniform approximation of D-finite functions using Chebyshev expansions
Published in Mathematics of computation (01-05-2017)“…It is well known that the order- n truncation of the Chebyshev expansion of a function over a given interval is a near-best uniform polynomial approximation of…”
Get full text
Journal Article -
3
Algorithms for Manipulating Quaternions in Floating-Point Arithmetic
Published in 2020 IEEE 27th Symposium on Computer Arithmetic (ARITH) (01-06-2020)“…Quaternions form a set of four global but not unique parameters, which can represent three-dimensional rotations in a non-singular way. They are frequently…”
Get full text
Conference Proceeding -
4
Certified and Fast Computation of Supremum Norms of Approximation Errors
Published in 2009 19th IEEE Symposium on Computer Arithmetic (01-06-2009)“…In many numerical programs there is a need for a high-quality floating-point approximation of useful functions f, such as such as exp, sin, erf. In the actual…”
Get full text
Conference Proceeding -
5
Special Section on "Emerging and Impacting Trends on Computer Arithmetic"
Published in IEEE transactions on emerging topics in computing (01-07-2021)Get full text
Journal Article -
6
Rounding Error Analysis of an Orbital Collision Probability Evaluation Algorithm
Published in 2024 IEEE 31st Symposium on Computer Arithmetic (ARITH) (10-06-2024)“…We present an error analysis of an algorithm due to Serra et al. (Journal of Guidance Control and Dynamics, 2016) for computing the orbital collision…”
Get full text
Conference Proceeding -
7
Exchange Algorithm for Evaluation and Approximation Error-Optimized Polynomials
Published in 2019 IEEE 26th Symposium on Computer Arithmetic (ARITH) (01-06-2019)“…Machine implementation of mathematical functions often relies on polynomial approximations. The particularity is that rounding errors occur both when…”
Get full text
Conference Proceeding -
8
Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
Published in IEEE transactions on computers (01-04-2016)“…Many numerical problems require a higher computing precision than the one offered by standard floating-point (FP) formats. One common way of extending the…”
Get full text
Journal Article -
9
Implementation and Performance Evaluation of an Extended Precision Floating-Point Arithmetic Library for High-Accuracy Semidefinite Programming
Published in 2017 IEEE 24th Symposium on Computer Arithmetic (ARITH) (01-07-2017)“…Semidefinite programming (SDP) is widely used in optimization problems with many applications, however, certain SDP instances are ill-posed and need more…”
Get full text
Conference Proceeding -
10
Automatic generation of polynomial-based hardware architectures for function evaluation
Published in ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors (01-07-2010)“…Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an…”
Get full text
Conference Proceeding -
11
Efficient and accurate computation of upper bounds of approximation errors
Published in Theoretical computer science (01-04-2011)“…For purposes of actual evaluation, mathematical functions f are commonly replaced by approximation polynomials p. Examples include floating-point…”
Get full text
Journal Article -
12
Least multivariate Chebyshev polynomials on diagonally determined domains
Published 29-05-2024“…We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval…”
Get full text
Journal Article -
13
Multiplicative Square Root Algorithms for FPGAs
Published in 2010 International Conference on Field Programmable Logic and Applications (01-08-2010)“…Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent…”
Get full text
Conference Proceeding -
14
Optimization-Aided Construction of Multivariate Chebyshev Polynomials
Published 16-05-2024“…This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best…”
Get full text
Journal Article -
15
Efficient Floating-Point Implementation of the Probit Function on FPGAs
Published in 2020 IEEE 31st International Conference on Application-specific Systems, Architectures and Processors (ASAP) (01-07-2020)“…Non-uniform random number generators are key components in Monte Carlo simulations. The inverse cumulative distribution function (ICDF) technique provides a…”
Get full text
Conference Proceeding -
16
Rigorous uniform approximation of D-finite functions using Chebyshev expansions
Published 10-07-2014“…A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series…”
Get full text
Journal Article -
17
On the computation of the reciprocal of floating point expansions using an adapted Newton-Raphson iteration
Published in 2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors (01-06-2014)“…Many numerical problems require a higher computing precision than that offered by common floating point (FP) formats. One common way of extending the precision…”
Get full text
Conference Proceeding -
18
Parallel floating-point expansions for extended-precision GPU computations
Published in 2016 IEEE 27th International Conference on Application-specific Systems, Architectures and Processors (ASAP) (01-07-2016)“…GPUs are an important hardware development platform for problems where massive parallel computations are needed. Many of these problems require a higher…”
Get full text
Conference Proceeding -
19
Polynomial superlevel set approximation of swept-volume for computing collision probability in space encounters
Published in 2021 60th IEEE Conference on Decision and Control (CDC) (14-12-2021)“…Computing long-term collision probability in space encounters is usually based on integration of a multivariate Gaussian distribution over the volume of…”
Get full text
Conference Proceeding