An efficient solution for Cauchy-like systems of linear equations

DOI10.1016/J.CAMWA.2003.09.028MaRDI QIDQ1767958zbMATH OpenOpenAlexFDO

Authors Zhao Chen, Victor Y. Pan

Publication date 8 March 2005

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2003.09.028

zbMATH Keywords

Cauchy like matricesCauchy-like linear systemsDisplacementFast algorithmsrecursive factorizationrecursive triangular factorizationscaling

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

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.

Recommendations

• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• Solving Toeplitz- and Vandermonde-like linear systems with large displacement rank
• Superfast algorithms for Cauchy-like matrix computations and extensions
• Recursive solution of Cauchy-Vandermonde systems of equations
• A fast solver for linear systems with displacement structure

Cites work

• A displacement approach to efficient decoding of algebraic-geometric codes
• A Matrix Problem with Application to Rapid Solution of Integral Equations
• A new approach to fast polynomial interpolation and multipoint evaluation
• A probabilistic remark on algebraic program testing
• An Efficient Implementation of a Conformal Mapping Method Based on the Szegö Kernel
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Complexity of multiplication with vectors for structured matrices
• Displacement ranks of matrices and linear equations
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
• scientific article; zbMATH DE number 2125598 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1350351 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 1083142 (Why is no real title available?)
• scientific article; zbMATH DE number 3437485 (Why is no real title available?)
• scientific article; zbMATH DE number 1405666 (Why is no real title available?)
• Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
• New transformations of Cauchy matrices and Trummer's problem
• Norm estimates for inverses of Vandermonde matrices
• Rapid solution of integral equations of classical potential theory
• Superfast algorithms for Cauchy-like matrix computations and extensions

Cited in

(3)

• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
• Solving structured linear systems with large displacement rank

This page was built for publication: An efficient solution for Cauchy-like systems of linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767958)