Stable and Efficient Algorithms for Structured Systems of Linear Equations

From MaRDI portal





A Cauchy-like matrix has the form \[ C= \Biggl({a^T_i b_j\over \omega_i-\lambda_j}\Biggr)_{1\leq i,j\leq n}\qquad (a_i, b_j\in\mathbb{R}^\alpha), \] where \(\alpha\ll n\). It satisfied a so-called displacement equation, i.e., \[ \Omega C- C\Lambda= A\cdot B\qquad (A\in\mathbb{R}^{n\times\alpha}, B\in\mathbb{R}^{\alpha\times n}). \] The author studies variations of a fast Gaussian elimination algorithm with partial or complete pivoting for Cauchy-like matrices, working systematically with the displacement equation. He describes algorithms that avoid internal element growths and therefore have better backward error properties than the existing methods. The solution of Toeplitz, Hankel and Toeplitz-plus-Hankel matrices can be reduced (in more than one way) to solutions of linear systems with a Cauchy-like matrix. The author discusses implementation techniques that further reduce execution. He presents a careful error analysis, flow counts and extensive numerical experiments that show the superiority of the newly developed methods.




Cited in
(38)


Describes a project that uses

Uses Software






This page was built for publication: Stable and Efficient Algorithms for Structured Systems of Linear Equations

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