An efficient solution for Cauchy-like systems of linear equations
type: Item
instance of: scholarly article
title: An efficient solution for Cauchy-like systems of linear equations
zbMATH Open document ID: 1066.65031
publication date: 2005-03-08T00:00:00Z
review text: The authors use the displacement approach and the transformation of vectors to solve strongly nonsingular Cauchy-like systems of linear equations. They modify the algorithms of the recursive triangular factorization so that the complexity bound of the approach is decreased. Their improvement of the direct recursive approach is by a factor of log \(n\). This is due to a change in the original vectors, expressed in the given Cauchy-like matrix, into special vectors, where the entries are unit roots. This is a novel algorithm for solving a Cauchy-like linear system of equations.
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 2142479
zbMATH Keywords: Cauchy like matrices
zbMATH Keywords: recursive factorization
zbMATH Keywords: Cauchy-like linear systems
zbMATH Keywords: Displacement
zbMATH Keywords: scaling
zbMATH Keywords: Fast algorithms
zbMATH Keywords: recursive triangular factorization
author: Zhao Chen
author: Victor Y. Pan
reviewed by: R. P. Tewarson
MaRDI profile type: Publication
full work available at URL: j.camwa.2003.09.028
OpenAlex ID: W2061587719
cites work: Displacement ranks of matrices and linear equations
cites work: An Efficient Implementation of a Conformal Mapping Method Based on the Szegö Kernel
cites work: Rapid solution of integral equations of classical potential theory
cites work: A Matrix Problem with Application to Rapid Solution of Integral Equations
cites work: Q4405419
cites work: A new approach to fast polynomial interpolation and multipoint evaluation
cites work: Q4365459
cites work: New transformations of Cauchy matrices and Trummer's problem
cites work: Q4265495
cites work: A displacement approach to efficient decoding of algebraic-geometric codes
cites work: Q4938647
cites work: Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
cites work: Q4314299
cites work: Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
cites work: Asymptotically fast solution of Toeplitz and related systems of linear equations
cites work: Superfast algorithms for Cauchy-like matrix computations and extensions
cites work: Norm estimates for inverses of Vandermonde matrices
cites work: Fast algorithms with preprocessing for matrix-vector multiplication problems
cites work: Q3156423
cites work: Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
cites work: Complexity of multiplication with vectors for structured matrices
cites work: A probabilistic remark on algebraic program testing
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Q3851616
DOI: 10.1016/J.CAMWA.2003.09.028
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2142479