Fast and stable two-way algorithm for diagonal plus semi-separable systems of linear equations
نویسندگان
چکیده
An algorithm for the solution of linear systems of equations where the coe cient matrix is diagonal plus a semi{separable matrix is considered. The algorithm is stable with linear complexity. Furthermore it is suitable for an implementation on a system of two processors.
منابع مشابه
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 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 factoriz...
متن کاملFast weak-KAM integrators for separable Hamiltonian systems
We consider a numerical scheme for Hamilton–Jacobi equations based on a direct discretization of the Lax–Oleinik semi–group. We prove that this method is convergent with respect to the time and space stepsizes provided the solution is Lipschitz, and give an error estimate. Moreover, we prove that the numerical scheme is a geometric integrator satisfying a discrete weak–KAM theorem which allows ...
متن کاملJacobi Operational Matrix Approach for Solving Systems of Linear and Nonlinear Integro-Differential Equations
This paper aims to construct a general formulation for the shifted Jacobi operational matrices of integration and product. The main aim is to generalize the Jacobi integral and product operational matrices to the solving system of Fredholm and Volterra integro--differential equations which appear in various fields of science such as physics and engineering. The Operational matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001