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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Linear algebra and its applications Ročník 340; číslo 1-3; s. 183 - 198
Hlavní autoři:	Fasino, D., Gemignani, L.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Elsevier Inc 01.01.2002 Elsevier Science
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!