Solving structured linear systems with large displacement rank - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2008

Solving structured linear systems with large displacement rank

Résumé

Linear systems with structures such as Toeplitz, Vandermonde or Cauchy-likeness can be solved in $O\,\tilde{~}(\alpha^2 n)$ operations, where $n$ is the matrix size, $\alpha$ is its displacement rank, and $O\,\tilde{~}$ denotes the omission of logarithmic factors. We show that for such matrices, this cost can be reduced to $O\,\tilde{~}(\alpha^{\omega-1} n)$, where $\omega$ is a feasible exponent for matrix multiplication over the base field. The best known estimate for $\omega$ is $\omega < 2.38$, resulting in costs of order $O\,\tilde{~}(\alpha^{1.38} n)$. We present consequences for Hermite--Pad\'e approximation and bivariate interpolation.
Fichier principal
Vignette du fichier
BoJeSc08.pdf (404.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03420733 , version 1 (09-11-2021)

Identifiants

Citer

Alin Bostan, Claude-Pierre Jeannerod, Éric Schost. Solving structured linear systems with large displacement rank. Theoretical Computer Science, 2008, 407 (1-3), pp.155-181. ⟨10.1016/j.tcs.2008.05.014⟩. ⟨hal-03420733⟩
30 Consultations
83 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More