Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
نویسندگان
چکیده
We present fast and numerically stable algorithms for the solution of linear systems of equations, where the coefficient matrix can be written in the form of a banded plus semiseparable matrix. Such matrices include banded matrices, banded bordered matrices, semiseparable matrices, and block-diagonal plus semiseparable matrices as special cases. Our algorithms are based on novel matrix factorizations developed specifically for matrices with such structures. We also present interesting numerical results with these algorithms.
منابع مشابه
O(n) Algorithms for Banded Plus Semiseparable Matrices
We present a new representation for the inverse of a matrix that is a sum of a banded matrix and a semiseparable matrix. In particular, we show that under certain conditions, the inverse of a banded plus semiseparable matrix can also be expressed as a banded plus semiseparable matrix. Using this result, we devise a fast algorithm for the solution of linear systems of equations involving such ma...
متن کاملFast Stable Solvers for Sequentially Semi-separable Linear Systems of Equations
We define the class of sequentially semi-separable matrices in this paper. Essentially this is the class of matrices which have low numerical rank on their off diagonal blocks. Examples include banded matrices, semi-separable matrices, their sums as well as inverses of these sums. Fast and stable algorithms for solving linear systems of equations involving such matrices and computing Moore-Penr...
متن کاملFast Stable Solver for Sequentially Semi-separable Linear Systems of Equations
In this paper we will present a fast backward stable algorithm for the solution of certain structured matrices which can be either sparse or dense. It essentially combines the fast solution techniques for banded plus semi-separable linear systems of equations of Chandrasekaran and Gu [4] with similar techniques of Dewilde and van der Veen for time-varying systems [12]. We will also use the prop...
متن کاملFast algorithms for hierarchically semiseparable matrices
Semiseparable matrices and many other rank-structured matrices have been widely used in developing new fast matrix algorithms. In this paper, we generalize the hierarchically semiseparable (HSS) matrix representations and propose some fast algorithms for HSS matrices. We represent HSS matrices in terms of general binary HSS trees and use simplified postordering notation for HSS forms. Fast HSS ...
متن کاملA Levinson-like algorithm for symmetric positive definite semiseparable plus diagonal matrices
In this paper a Levinson-like algorithm is derived for solving symmetric positive definite semiseparable plus diagonal systems of equations. In a first part we solve a Yule-Walker-like system of equations. Based on this O(n) solver an algorithm for a general right-hand side is derived. The new method has a linear complexity and takes 19n − 13 operations. The relation between the algorithm and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 25 شماره
صفحات -
تاریخ انتشار 2003