Juan Manuel Peña

Axioms, September, 2024

High relative accuracy through Newton bases.

[BibT_eX]

[DOI]

Numer. Algorithms, February, 2024

2023

Total positivity and accurate computations with Gram matrices of Said-Ball bases.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., December, 2023

A Shape Preserving Class of Two-Frequency Trigonometric B-Spline Curves.

[BibT_eX]

[DOI]

Symmetry, November, 2023

Accurate and fast computations with Green matrices.

[BibT_eX]

[DOI]

Guillermo Peña

Appl. Math. Lett., November, 2023

High relative accuracy with some special matrices related to Γ and β functions.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., October, 2023

On the accuracy of de Casteljau-type algorithms and Bernstein representations.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., October, 2023

A New Class of Trigonometric B-Spline Curves.

[BibT_eX]

[DOI]

Symmetry, August, 2023

An evaluation algorithm for q-Bézier triangular patches formed by convex combinations.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., August, 2023

Green Matrices, Minors and Hadamard Products.

[BibT_eX]

[DOI]

Guillermo Peña

Axioms, August, 2023

On the stability of the representation of finite rank operators.

[BibT_eX]

[DOI]

Adv. Comput. Math., August, 2023

Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., July, 2023

Gaussian Markov Random Fields and totally positive matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2023

2022

Accurate and efficient computations with Wronskian matrices of Bernstein and related bases.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2022

Total positivity and accurate computations with Gram matrices of Bernstein bases.

[BibT_eX]

[DOI]

Numer. Algorithms, 2022

Inverse central ordering for the Newton interpolation formula.

[BibT_eX]

[DOI]

Yasmina Khiar

Numer. Algorithms, 2022

Almost strictly sign regular rectangular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2022

Accurate computations with matrices related to bases {tieλt}.

[BibT_eX]

[DOI]

Juan Manuel Peña Ferrández

Adv. Comput. Math., 2022

2021

A collection of efficient tools to work with almost strictly sign regular matrices.

[BibT_eX]

[DOI]

Pedro Alonso Velázquez

Jorge Jiménez Meana

María Luisa Serrano Ortega

Comput. Math. Methods, November, 2021

High relative accuracy with matrices of q-integers.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2021

Stability properties of disk polynomials.

[BibT_eX]

[DOI]

Numer. Algorithms, 2021

Accurate Computations with Collocation and Wronskian Matrices of Jacobi Polynomials.

[BibT_eX]

[DOI]

J. Sci. Comput., 2021

Accurate bidiagonal decomposition and computations with generalized Pascal matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2021

Error bounds for linear complementarity problems of $$B_{\pi }^R$$-matrices.

[BibT_eX]

[DOI]

Comput. Appl. Math., 2021

Optimal properties of tensor product of B-bases.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2021

2020

Extremal and optimal properties of B-bases collocation matrices.

[BibT_eX]

[DOI]

Numerische Mathematik, 2020

Accurate bidiagonal decomposition of collocation matrices of weighted ϕ-transformed systems.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2020

Algorithmic characterization of pentadiagonal ASSR matrices.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2020

Evaluation and subdivision algorithms for general classes of totally positive rational bases.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2020

2019

Accurate computations with Laguerre matrices.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2019

On the asymptotic optimality of error bounds for some linear complementarity problems.

[BibT_eX]

[DOI]

Numer. Algorithms, 2019

Optimal interval length for the collocation of the Newton interpolation basis.

[BibT_eX]

[DOI]

Yasmina Khiar

Numer. Algorithms, 2019

Accurate Algorithms for Bessel Matrices.

[BibT_eX]

[DOI]

J. Sci. Comput., 2019

Combined matrices of almost strictly sign regular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2019

Comparing pivoting strategies for almost strictly sign regular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2019

Optimal stability of the Lagrange formula and conditioning of the Newton formula.

[BibT_eX]

[DOI]

Yasmina Khiar

J. Approx. Theory, 2019

Infinity norm bounds for the inverse of Nekrasov matrices using scaling matrices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

Accurate computations with collocation matrices of a general class of bases.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2018

2017

Backward stability with almost strictly sign regular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2017

QR decomposition of almost strictly sign regular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2017

Accurate computations with Lupaş matrices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

2016

Algorithm 960: POLYNOMIAL: An Object-Oriented Matlab Library of Fast and Efficient Algorithms for Polynomials.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2016

Spline approximation, Kronecker products and multilinear forms.

[BibT_eX]

[DOI]

Frank Lamping

Numer. Linear Algebra Appl., 2016

Accurate and fast computations with positive extended Schoenmakers-Coffey matrices.

[BibT_eX]

[DOI]

Guillermo Peña

Numer. Linear Algebra Appl., 2016

B-Nekrasov matrices and error bounds for linear complementarity problems.

[BibT_eX]

[DOI]

Numer. Algorithms, 2016

Greville abscissae of totally positive bases.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2016

Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2016

2015

Accurate Computations with Collocation Matrices of q-Bernstein Polynomials.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2015

On the characterization of almost strictly sign regular matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2015

Almost strictly totally negative matrices: An algorithmic characterization.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2015

Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

Eventually SDD matrices and eigenvalue localization.

[BibT_eX]

[DOI]

Ljiljana Cvetkovic

M. Eric

Appl. Math. Comput., 2015

2014

Error bounds for linear complementarity problems of Nekrasov matrices.

[BibT_eX]

[DOI]

Numer. Algorithms, 2014

Interpolation on cycloidal spaces.

[BibT_eX]

[DOI]

J. Approx. Theory, 2014

Eigenvalue localization and Neville elimination.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

Fast and accurate algorithms for Jacobi-Stirling matrices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

2013

Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.

[BibT_eX]

[DOI]

Alvaro Barreras

Numer. Linear Algebra Appl., 2013

Conditioning and accurate computations with Pascal matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2013

Eigenvalue localization and pivoting strategies for Gaussian elimination.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2013

Accurate computations with collocation matrices of rational bases.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2013

On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2013

Accurate Computations for Some Classes of Matrices.

[BibT_eX]

[DOI]

Proceedings of the Numerical Mathematics and Advanced Applications - ENUMATH 2013, 2013

2012

Optimality of Bernstein Representations for Computational Purposes.

[BibT_eX]

[DOI]

Reliab. Comput., 2012

A note on matrices with maximal growth factor for Neville elimination.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2012

Progressive iteration approximation and the geometric algorithm.

[BibT_eX]

[DOI]

Comput. Aided Des., 2012

Error bounds for linear complementarity problems involving BS-matrices.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

Eigenvalue Localization Refinements for Matrices Related to Positivity.

[BibT_eX]

[DOI]

Ljiljana Cvetkovic

Vladimir Kostic

SIAM J. Matrix Anal. Appl., 2011

Running error for the evaluation of rational Bézier surfaces through a robust algorithm.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2011

Growth factors of pivoting strategies associated with Neville elimination.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2011

On the progressive iteration approximation property and alternative iterations.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2011

Diagonal dominance, Schur complements and some classes of H-matrices and P-matrices.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2011

Preface: numerical and applied linear algebra.

[BibT_eX]

[DOI]

Rafael Bru

Adv. Comput. Math., 2011

2010

Monotonicity preserving representations of non-polynomial surfaces.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2010

Running error for the evaluation of rational Bézier surfaces.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2010

Three term recurrence for the evaluation of multivariate orthogonal polynomials.

[BibT_eX]

[DOI]

Roberto Barrio

J. Approx. Theory, 2010

Optimal bases for a class of mixed spaces and their associated spline spaces.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

Scaling laws in bacterial genomes: A side-effect of selection of mutational robustness?

[BibT_eX]

[DOI]

Guillaume Beslon

David P. Parsons

Yolanda Sanchez-Dehesa

Carole Knibbe

Biosyst., 2010

A collection of examples where Neville elimination outperforms Gaussian elimination.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2010

2009

Running Relative Error for the Evaluation of Polynomials.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2009

Optimal Conditioning of Bernstein Collocation Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2009

Eigenvalue bounds for some classes of P-matrices.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2009

Iterative refinement for Neville elimination.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

Convexity preserving scattered data interpolation using Powell-Sabin elements.

[BibT_eX]

[DOI]

Tim N. T. Goodman

Comput. Aided Geom. Des., 2009

Error bounds for linear complementarity problems for B-matrices.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Computation of the eigenvalues of convexity preserving matrices.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

2008

A stable test for strict sign regularity.

[BibT_eX]

[DOI]

Vanesa Cortés

Math. Comput., 2008

Roundoff errors for polynomial evaluation by a family of formulae.

[BibT_eX]

[DOI]

Tim N. T. Goodman

Computing, 2008

A Comparison of Different Progressive Iteration Approximation Methods.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2007

Strict Diagonal Dominance and Optimal Bounds for the Skeel Condition Number.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2007

Refining Gerschgorin disks through new criteria for nonsingularity.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2007

A general class of Bernstein-like bases.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2007

Are rational Bézier surfaces monotonicity preserving?

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2007

Progressive iterative approximation and bases with the fastest convergence rates.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2007

Efficient polynomial reduction.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2007

The work of Mariano Gasca.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2007

Shape preservation regions for six-dimensional spaces.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2007

2006

Characterizations and Decompositions of Almost Strictly Positive Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

A note on the optimal stability of bases of univariate functions.

[BibT_eX]

[DOI]

Numerische Mathematik, 2006

Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form.

[BibT_eX]

[DOI]

J. Approx. Theory, 2006

Preface.

[BibT_eX]

[DOI]

Martin D. Buhmann

J. Approx. Theory, 2006

Running Error Analysis of Evaluation Algorithms for Bivariate Polynomials in Barycentric Bernstein Form.

[BibT_eX]

[DOI]

Computing, 2006

On the generalized Ball bases.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2006

2005

Exclusion and Inclusion Intervals for the Real Eigenvalues of Positive Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2005

Almost strict total positivity and a class of Hurwitz polynomials.

[BibT_eX]

[DOI]

Dimitar K. Dimitrov

J. Approx. Theory, 2005

Corner cutting systems.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2005

Evaluation of the derivative of a polynomial in Bernstein form.

[BibT_eX]

[DOI]

Roberto Barrio

Appl. Math. Comput., 2005

Recent advances in shape preserving representations.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Computer-Aided Design and Computer Graphics, 2005

2004

A stable test to check if a matrix is a nonsingular M-matrix.

[BibT_eX]

[DOI]

Math. Comput., 2004

Quadratic-Cycloidal Curves.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2004

Optimally Stable Multivariate Bases.

[BibT_eX]

[DOI]

Tom Lyche

Adv. Comput. Math., 2004

2003

Scaled Pivots and Scaled Partial Pivoting Strategies.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2003

On an alternative to Gerschgorin circles and ovals of Cassini.

[BibT_eX]

[DOI]

Numerische Mathematik, 2003

Simultaneous backward stability of Gauss and Gauss-Jordan elimination.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2003

A shape preserving representation with an evaluation algorithm of linear complexity.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2003

Representing circles with five control points.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2003

Restricted Systems.

[BibT_eX]

[DOI]

Adv. Comput. Math., 2003

A Linear Complexity Algorithm for the Bernstein Basis.

[BibT_eX]

[DOI]

Proceedings of the 2003 International Conference on Geometric Modeling and Graphics, 2003

2002

On the optimal stability of bases of univariate functions.

[BibT_eX]

[DOI]

Numerische Mathematik, 2002

A basis of C-Bézier splines with optimal properties.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2002

Monotonicity Preservation of Some Polynomial and Rational Representations.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Information Visualisation, 2002

2001

A Class of P-Matrices with Applications to the Localization of the Eigenvalues of a Real Matrix.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2001

Shape preserving alternatives to the rational Bézier model.

[BibT_eX]

[DOI]

Javier Sánchez-Reyes

Comput. Aided Geom. Des., 2001

Error Analysis for the Evaluation of Rational Bézier Curves.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Information Visualisation, 2001

2000

On the Multivariate Horner Scheme.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2000

Monotonicity preservation on triangles.

[BibT_eX]

[DOI]

Michael S. Floater

Math. Comput., 2000

On the Multivariate Horner Scheme II: Running Error Analysis.

[BibT_eX]

[DOI]

Computing, 2000

1999

Error analysis of corner cutting algorithms.

[BibT_eX]

[DOI]

Numer. Algorithms, 1999

Corner cutting algorithms associated with optimal shape preserving representations.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1999

Block and Partitioned Neville Elimination.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computation, 1999

1998

On the Relationship Between Graphs and Totally Positive Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., April, 1998

Pivoting strategies leading to diagonal dominance by rows.

[BibT_eX]

[DOI]

Numerische Mathematik, 1998

Tensor-product monotonicity preservation.

[BibT_eX]

[DOI]

Michael S. Floater

Adv. Comput. Math., 1998

1997

B-splines and optimal stability.

[BibT_eX]

[DOI]

Math. Comput., 1997

Shape preserving representations for trigonometric polynomial curves.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1997

Linear convexity conditions for rectangular and triangular Bernstein-Bézier surfaces.

[BibT_eX]

[DOI]

Michael S. Floater

Comput. Aided Geom. Des., 1997

1996

Generalized convexity preserving transformations.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1996

1995

Matrices with Sign Consistency of a Given Order.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1995

On the characterization of almost strictly totally positive matrices.

[BibT_eX]

[DOI]

Adv. Comput. Math., 1995

A generalization of the variation diminishing property.

[BibT_eX]

[DOI]

Tim N. T. Goodman

Adv. Comput. Math., 1995

1994

Totally positive bases for shape preserving curve design and optimality of B-splines.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1994

1993

Total Positivity, $QR$ Factorization, and Neville Elimination.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., October, 1993

Shape preserving representations and optimality of the Bernstein basis.

[BibT_eX]

[DOI]

Adv. Comput. Math., 1993

1992

Almost strictly totally positive matrices.

[BibT_eX]

[DOI]

Charles A. Micchelli