Jorge Delgado

Orcid: 0000-0003-2156-9856

Affiliations:
  • University of Zaragoza, Department of Applied Mathematics, Spain


According to our database1, Jorge Delgado authored at least 45 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Accurate bidiagonal decompositions of Cauchy-Vandermonde matrices of any rank.
Numer. Linear Algebra Appl., December, 2024

Accurate Computations with Generalized Green Matrices.
Symmetry, August, 2024

2023
Accurate and fast computations with Green matrices.
Appl. Math. Lett., November, 2023

High relative accuracy with some special matrices related to Γ and β functions.
Numer. Linear Algebra Appl., October, 2023

On the accuracy of de Casteljau-type algorithms and Bernstein representations.
Comput. Aided Geom. Des., October, 2023

An evaluation algorithm for q-Bézier triangular patches formed by convex combinations.
J. Comput. Appl. Math., August, 2023

Green Matrices, Minors and Hadamard Products.
Axioms, August, 2023

Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank.
J. Comput. Appl. Math., July, 2023

2021
High relative accuracy with matrices of q-integers.
Numer. Linear Algebra Appl., 2021

Accurate bidiagonal decomposition and computations with generalized Pascal matrices.
J. Comput. Appl. Math., 2021

Optimal properties of tensor product of B-bases.
Appl. Math. Lett., 2021

2020
Extremal and optimal properties of B-bases collocation matrices.
Numerische Mathematik, 2020

Estimation of missing prices in real-estate market agent-based simulations with machine learning and dimensionality reduction methods.
Neural Comput. Appl., 2020

2019
Accurate computations with Laguerre matrices.
Numer. Linear Algebra Appl., 2019

Accurate Algorithms for Bessel Matrices.
J. Sci. Comput., 2019

2017
Accurate computations with Lupaş matrices.
Appl. Math. Comput., 2017

2016
Algorithm 960: POLYNOMIAL: An Object-Oriented Matlab Library of Fast and Efficient Algorithms for Polynomials.
ACM Trans. Math. Softw., 2016

Accurate and fast computations with positive extended Schoenmakers-Coffey matrices.
Numer. Linear Algebra Appl., 2016

2015
Accurate Computations with Collocation Matrices of q-Bernstein Polynomials.
SIAM J. Matrix Anal. Appl., 2015

Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm.
Appl. Math. Comput., 2015

2014
Fast and accurate algorithms for Jacobi-Stirling matrices.
Appl. Math. Comput., 2014

2013
Conditioning and accurate computations with Pascal matrices.
J. Comput. Appl. Math., 2013

Accurate computations with collocation matrices of rational bases.
Appl. Math. Comput., 2013

On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis.
Adv. Comput. Math., 2013

2012
Optimality of Bernstein Representations for Computational Purposes.
Reliab. Comput., 2012

A note on matrices with maximal growth factor for Neville elimination.
J. Comput. Appl. Math., 2012

Progressive iteration approximation and the geometric algorithm.
Comput. Aided Des., 2012

2011
Running error for the evaluation of rational Bézier surfaces through a robust algorithm.
J. Comput. Appl. Math., 2011

Growth factors of pivoting strategies associated with Neville elimination.
J. Comput. Appl. Math., 2011

On the progressive iteration approximation property and alternative iterations.
Comput. Aided Geom. Des., 2011

2010
Running error for the evaluation of rational Bézier surfaces.
J. Comput. Appl. Math., 2010

A collection of examples where Neville elimination outperforms Gaussian elimination.
Appl. Math. Comput., 2010

2009
Running Relative Error for the Evaluation of Polynomials.
SIAM J. Sci. Comput., 2009

Optimal Conditioning of Bernstein Collocation Matrices.
SIAM J. Matrix Anal. Appl., 2009

Computation of the eigenvalues of convexity preserving matrices.
Appl. Math. Lett., 2009

2008
A Comparison of Different Progressive Iteration Approximation Methods.
Proceedings of the Mathematical Methods for Curves and Surfaces, 2008

Mean Distance from a Curve to Its Control Polygon.
Proceedings of the Mathematical Methods for Curves and Surfaces, 2008

2007
A Corner Cutting Algorithm for Evaluating Rational B[e-acute]zier Surfaces and the Optimal Stability of the Basis.
SIAM J. Sci. Comput., 2007

Are rational Bézier surfaces monotonicity preserving?
Comput. Aided Geom. Des., 2007

Progressive iterative approximation and bases with the fastest convergence rates.
Comput. Aided Geom. Des., 2007

2006
On the generalized Ball bases.
Adv. Comput. Math., 2006

2005
Corner cutting systems.
Comput. Aided Geom. Des., 2005

2003
A shape preserving representation with an evaluation algorithm of linear complexity.
Comput. Aided Geom. Des., 2003

A Linear Complexity Algorithm for the Bernstein Basis.
Proceedings of the 2003 International Conference on Geometric Modeling and Graphics, 2003

2002
Monotonicity Preservation of Some Polynomial and Rational Representations.
Proceedings of the International Conference on Information Visualisation, 2002


  Loading...