Structural and computational properties of possibly singular semiseparable matrices

A classical result of structured numerical linear algebra states that the inverse of a nonsingular semiseparable matrix is a tridiagonal matrix. Such a property of a semiseparable matrix has been proved to be useful for devising linear complexity solvers, for establishing recurrence relations among...

Full description

Saved in:

Bibliographic Details
Published in:	Linear algebra and its applications Vol. 340; no. 1-3; pp. 183 - 198
Main Authors:	Fasino, D., Gemignani, L.
Format:	Journal Article
Language:	English
Published:	New York, NY Elsevier Inc 01.01.2002 Elsevier Science
Subjects:	Algebra Block tridiagonal matrices Exact sciences and technology Linear and multilinear algebra, matrix theory Linear and multilinear algebra, matrix theory (finite and infinite) Linear complexity algorithms Logic, set theory, and algebra Mathematical methods in physics Mathematics Physics Sciences and techniques of general use Semiseparable matrices Linear complexity algorithms Block tridiagonal matrices Semiseparable matrices Singular matrix Singularity Recurrence relation Linear algebra Characteristic polynomial Sparse matrix Numerical method Rank Tridiagonal matrix Generalized inverse
ISSN:	0024-3795, 1873-1856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!