Solving structured linear systems of large displacement rank

Authors:
Alin Bostan;Claude-Pierre Jeannerod;Éric Schost
Affiliations:
INRIA Roquencourt, France;INRIA Rhônes-Alpes and LIP, ENS Lyon. France;LIX, École polytechnique, France
Venue:
ACM Communications in Computer Algebra
Year:
2006

Citing 6
Cited 0

Ideal Bases and Primary Decomposition: Case of Two Variables

Journal of Symbolic Computation
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants

SIAM Journal on Matrix Analysis and Applications
Asymptotically fast solution of Toeplitz-like singular linear systems

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms
On the complexity of polynomial matrix computations

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness.