Add to ORKGThe Vandermonde matrix and Cauchy matrix are classical and are encountered in polynomial and rational interpolation computation respectively. The structure of these matrices lead to fast inversion algorithms and system solvers. We look to extend these properties to other structured matrices, including Cauchy-Vandermonde matrices and systems involving Laurent polynomials
International audienceThe asymptotically fastest known divide-and-conquer methods for inverting dens...
AbstractIn this paper we compare the numerical properties of the well-knownfastO(n2) Traub and Björc...
AbstractIn the present paper, confluent polynomial Vandermonde-like matrices with general recurrence...
The Vandermonde matrix and Cauchy matrix are classical and are encountered in polynomial and rationa...
AbstractIn the present paper we use the displacement structure approach to introduce a new class of ...
AbstractMatrices consisting of two parts one of Vandermonde and the other of Löwner type are conside...
AbstractMatrices of composed type consisting of a Vandermonde and a Cauchy part and their connection...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
In [P90] we proposed to employ Vandermonde and Hankel multipliers to transform into each other the m...
The papers [MRT05], [CGS07], [XXG12], and [XXCB14] combine the techniques of the Fast Multipole Meth...
AbstractThis paper analyzes the factorization of the inverse of a Cauchy-Vandermonde matrix as a pro...
AbstractRecursive fast algorithms for the solution of linear systems Ax = b the coefficient matrix o...
Abstract. The papers [MRT05], [CGS07], [XXG12], and [XXCBa] have combined the advanced FMM technique...
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solu...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
International audienceThe asymptotically fastest known divide-and-conquer methods for inverting dens...
AbstractIn this paper we compare the numerical properties of the well-knownfastO(n2) Traub and Björc...
AbstractIn the present paper, confluent polynomial Vandermonde-like matrices with general recurrence...
The Vandermonde matrix and Cauchy matrix are classical and are encountered in polynomial and rationa...
AbstractIn the present paper we use the displacement structure approach to introduce a new class of ...
AbstractMatrices consisting of two parts one of Vandermonde and the other of Löwner type are conside...
AbstractMatrices of composed type consisting of a Vandermonde and a Cauchy part and their connection...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
In [P90] we proposed to employ Vandermonde and Hankel multipliers to transform into each other the m...
The papers [MRT05], [CGS07], [XXG12], and [XXCB14] combine the techniques of the Fast Multipole Meth...
AbstractThis paper analyzes the factorization of the inverse of a Cauchy-Vandermonde matrix as a pro...
AbstractRecursive fast algorithms for the solution of linear systems Ax = b the coefficient matrix o...
Abstract. The papers [MRT05], [CGS07], [XXG12], and [XXCBa] have combined the advanced FMM technique...
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solu...
This paper considers the problem of effective algorithms for some problems having structured coeffic...
International audienceThe asymptotically fastest known divide-and-conquer methods for inverting dens...
AbstractIn this paper we compare the numerical properties of the well-knownfastO(n2) Traub and Björc...
AbstractIn the present paper, confluent polynomial Vandermonde-like matrices with general recurrence...