An efficient implementation of a conformal mapping method based on the Szego¨ kernel
SIAM Journal on Numerical Analysis
A matrix problem with application to rapid solution of integral equations
SIAM Journal on Scientific and Statistical Computing
Fast algorithms with preprocessing for matrix-vector multiplication problems
Journal of Complexity
Fast Gaussian elimination with partial pivoting for matrices with displacement structure
Mathematics of Computation
A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Fast reliable algorithms for matrices with structure
Fast reliable algorithms for matrices with structure
Transformations of Cauchy Matrices, Trummer's Problem and a Cauchy-Like Linear Solver
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Solving structured linear systems with large displacement rank
Theoretical Computer Science
The Journal of Supercomputing
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Hi-index | 0.09 |
Using the displacement approach and transformation of vectors, the complexity ofsolving strongly nonsingular Cauchy-like systems of linear equations Cx@?=@u@? will be improved off a factor of log n from the known algorithms of the recursive triangular factorization, where F is a field and v@? @? F"n"x"1 is a vector and C @? F"n"x"n is a strongly nonsingular Cauchy-like matrix. The efficient algorithms were presented by Morf, Bitmead and Anderson to solve strongly nonsingular Toeplitz-like equations of linear systems by using the recursive triangular factorization in 1980. Recently, this approach of the recursive triangular factorization was extended to solve Cauchy-like systems with the complexity of O(n log^3n) operations by Pan et al. This is the best known complexity bound by using the direct approach of recursive triangular factorization in Cauchy-like cases. However, these algorithms are still slower than the well-known algorithms with the asymptotic bound of O(n log^2n) operations, which have been proposed by the means of reducing Cauchy-like matrices into Toeplitz-like matrices. In our present paper, the algorithms of the recursive triangular factorization are modified so that the complexity bound of the direct recursive approach can be decreased to O(n log^2n) operations. This matches the asymptotic bound without transforming to Toeplitz-like matrices. Our improvement of the direct recursive approach is by a factor of log n due to changing the original vectors expressed in the given Cauchy-like matrix into the special vectors, where the entries are unit roots. The applications of structured matrices include Nevanlinna Pick tangential interpolation problems.