Sciweavers

Share
ISSAC
2007
Springer

Some recent progress in exact linear algebra and related questions

9 years 10 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear system solution, determinant, inversion and computation of canonical forms. The matrices are over a finite field, the integers, or univariate polynomials. We show how selected techniques are key ingredients for the new solutions: randomization and algebraic conditioning, lifting, subspace approach, divide-double and conquer, minimum matrix polynomial, matrix approximants. These algorithmic progress allow the design of new generation high performance libraries such as LinBox, and open various research directions. We refer to [3] for an overview of methods in exact linear algebra, see also [37], [1] (in French), and [7, §2.3]. For fundamentals of computer algebra we refer to [16, 7].
Gilles Villard
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ISSAC
Authors Gilles Villard
Comments (0)
books