46 search results - page 5 / 10 » issac 2007 |
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Linear systems with structures such as Toeplitz-, Vandermonde- or Cauchy-likeness can be solved in O˜(α2 n) operations, where n is the matrix size, α is its displacement rank, ...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
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...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...