Sciweavers

81 search results - page 1 / 17
» Using fast matrix multiplication to solve structured linear ...
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 4 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
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, ...
Alin Bostan, Claude-Pierre Jeannerod, Éric ...
JSC
2010
155views more  JSC 2010»
13 years 3 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
ARC
2010
Springer
387views Hardware» more  ARC 2010»
13 years 11 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides