High Relative Accuracy With Matrices Of Q-Integers | 0 | 0.34 | 2021 |
Estimation of missing prices in real-estate market agent-based simulations with machine learning and dimensionality reduction methods | 0 | 0.34 | 2020 |
Extremal and optimal properties of B-bases Collocation Matrices. | 0 | 0.34 | 2020 |
Accurate computations with Lupaş matrices. | 1 | 0.37 | 2019 |
Algorithm 960: POLYNOMIAL: An Object-Oriented Matlab Library of Fast and Efficient Algorithms for Polynomials. | 1 | 0.36 | 2016 |
Accurate and fast computations with positive extended Schoenmakers-Coffey matrices. | 0 | 0.34 | 2016 |
Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm | 1 | 0.38 | 2015 |
Accurate Computations with Collocation Matrices of q-Bernstein Polynomials. | 0 | 0.34 | 2015 |
Fast and accurate algorithms for Jacobi-Stirling matrices. | 1 | 0.38 | 2014 |
Conditioning and accurate computations with Pascal matrices. | 9 | 0.78 | 2013 |
Accurate computations with collocation matrices of rational bases | 5 | 0.51 | 2013 |
On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis | 0 | 0.34 | 2013 |
Progressive iteration approximation and the geometric algorithm | 2 | 0.39 | 2012 |
A note on matrices with maximal growth factor for Neville elimination | 0 | 0.34 | 2012 |
Running error for the evaluation of rational Bézier surfaces through a robust algorithm | 0 | 0.34 | 2011 |
On the progressive iteration approximation property and alternative iterations | 0 | 0.34 | 2011 |
Growth factors of pivoting strategies associated with Neville elimination | 8 | 1.03 | 2011 |
Running error for the evaluation of rational Bézier surfaces | 1 | 0.48 | 2010 |
A collection of examples where Neville elimination outperforms Gaussian elimination | 3 | 0.50 | 2010 |
Optimal Conditioning of Bernstein Collocation Matrices | 7 | 0.58 | 2009 |
Computation of the eigenvalues of convexity preserving matrices | 0 | 0.34 | 2009 |
Running Relative Error for the Evaluation of Polynomials | 7 | 0.74 | 2009 |
Mean distance from a curve to its control polygon | 0 | 0.34 | 2008 |
A comparison of different progressive iteration approximation methods | 4 | 0.50 | 2008 |
A Corner Cutting Algorithm for Evaluating Rational B[e-acute]zier Surfaces and the Optimal Stability of the Basis | 0 | 0.34 | 2007 |
Progressive iterative approximation and bases with the fastest convergence rates | 20 | 1.51 | 2007 |
Are rational Bézier surfaces monotonicity preserving? | 7 | 0.71 | 2007 |
On the generalized Ball bases | 4 | 0.69 | 2006 |
Corner cutting systems | 2 | 0.45 | 2005 |
A shape preserving representation with an evaluation algorithm of linear complexity | 21 | 2.10 | 2003 |
A Linear Complexity Algorithm For The Bernstein Basis | 0 | 0.34 | 2003 |
Monotonicity preservation of some polynomial and rational representations | 3 | 0.53 | 2002 |