Learn More
Fast On 2 implementation of Gaussian elimination with partial pivoting is designed for matrices possessing Cauchy-like displacement structure. We show how Toeplitzz like, Toeplitz-plus-Hankelllike and Vandermonde-like matrices can be transformed into Cauchyylike matrices by using Discrete Fourier, Cosine or Sine Transform matrices. In particular this allows(More)
In this paper the problem of complexity of multiplication of a matrix with a vector is studied for Toeplitz, Hankel, Vandermonde and Cauchy matrices and for matrices connected with them (i.e. for transpose, inverse and transpose to inverse matrices). The proposed algorithms have complexities at most O(n log 2 n) ops and in a number of cases improve the(More)
Using methods originating in numerical analysis, we will develop a unified framework for derivation of efficient list decoding algorithms for algebraic-geometric codes. We will demonstrate our method by accelerating Sudan's list decoding algorithm for Reed-Solomon codes [22], its generalization to algebraic-geometric codes by Shokrollahi and Wasserman [21],(More)
Many important problems in pure and applied mathematics and engineering can be reduced to linear algebra on dense structured matrices. The structure of these dense matrices is understood in the sense that their n z entries can be "compressed" to a smaller number O(n) of parameters. Operating directly on these paxameters allows one to design efficient fast(More)
In this paper a displacement structure technique is used to design a class of new precondition-ers for the conjugate gradient method applied to the solution of large Toeplitz linear equations. Explicit formulas are suggested for the G.Strang-type and for the T.Chan-type precondition-ers belonging to any of 8 classes of matrices diagonalized by the(More)
This paper contains two fast algorithms for inversion of Chebyshev{ Vandermonde matrices of the rst and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also(More)
In an earlier paper GKO95 w e exploited the displacement structure of Cauchy-like matrices to derive for them a fast On 2 implementation of Gaussian elimination with partial pivoting. One application is to the rapid and numerically accurate solution of linear systems with Toeplitz-like coeecient matrices, based on the fact that the latter can be transformed(More)
In this paper we carry over the Björck-Pereyra algorithm for solving Vandermonde linear systems to what we suggest to call Szegö-Vandermonde systems V Φ (x), i.e., polynomial-Vandermonde systems where the corresponding polynomial system Φ is the Szegö polyno-mials. The properties of the corresponding unitary Hessenberg matrix allow us to derive a fast O(n(More)