Joab R. Winkler

According to our database1, Joab R. Winkler authored at least 28 papers between 1997 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The application of regularisation to variable selection in statistical modelling.
J. Comput. Appl. Math., 2022

2021
An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain.
J. Comput. Appl. Math., 2021

2020
The Computation of Multiple Roots of a Bernstein Basis Polynomial.
SIAM J. Sci. Comput., 2020

Condition estimation for regression and feature selection.
J. Comput. Appl. Math., 2020

The computation of the degree of the greatest common divisor of three Bernstein basis polynomials.
J. Comput. Appl. Math., 2020

2018
The Sylvester and Bézout Resultant Matrices for Blind Image Deconvolution.
J. Math. Imaging Vis., 2018

2017
A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials.
J. Comput. Appl. Math., 2017

2015
Blind image deconvolution using the Sylvester resultant matrix.
Proceedings of the 2015 IEEE International Conference on Image Processing, 2015

2014
Structured matrix methods for the computation of multiple roots of a polynomial.
J. Comput. Appl. Math., 2014

A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials.
Comput. Aided Geom. Des., 2014

The Sylvester Resultant Matrix and Image Deblurring.
Proceedings of the Curves and Surfaces, 2014

2013
An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix.
J. Comput. Appl. Math., 2013

Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials.
Comput. Aided Geom. Des., 2013

2012
The computation of multiple roots of a polynomial.
J. Comput. Appl. Math., 2012

2011
The calculation of the degree of an approximate greatest common divisor of two polynomials.
J. Comput. Appl. Math., 2011

2010
A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix.
J. Comput. Appl. Math., 2010

2008
A unified approach to resultant matrices for Bernstein basis polynomials.
Comput. Aided Geom. Des., 2008

2007
Condition Numbers and Least Squares Regression.
Proceedings of the Mathematics of Surfaces XII, 2007

2006
High Order Terms for Condition Estimation of Univariate Polynomials.
SIAM J. Sci. Comput., 2006

Automatic Face Recognition Using Stereo Images.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

2005
Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis.
Numer. Linear Algebra Appl., 2005

Backward Errors and Condition Numbers of Regular and Singular Points on Algebraic Curves.
Proceedings of the Mathematics of Surfaces XI, 2005

2004
A Comparison of Condition Numbers for the Full Rank Least Squares Problem.
Proceedings of the Deterministic and Statistical Methods in Machine Learning, 2004

2001
A note on the backward error of the roots of polynomials.
Neural Parallel Sci. Comput., 2001

A comparison of the average case numerical condition of the power and bernstein polynomial bases.
Int. J. Comput. Math., 2001

2000
A Class of Bernstein Polynomials that Satisfy Descartes' Rule of Signs Exactly.
Proceedings of the 9th IMA Conference on the Mathematics of Surfaces, 2000

1999
Backward error analysis of the roots of polynomials.
Neural Parallel Sci. Comput., 1999

1997
An ill-conditioned problem in computer aided geometric design.
Neural Parallel Sci. Comput., 1997


  Loading...