Generalized matrix inversion is not harder than matrix multiplication

Starting from the Strassen method for rapid matrix multiplication and inversion as well as from the recursive Cholesky factorization algorithm, we introduced a completely block recursive algorithm for generalized Cholesky factorization of a given symmetric, positive semi-definite matrix A ∈ R n × n...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of computational and applied mathematics Ročník 230; číslo 1; s. 270 - 282
Hlavní autoři:	PETKOVIC, Marko D, STANIMIROVIC, Predrag S
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier B.V 01.08.2009 Elsevier
Témata:	Cholesky factorization Complexity analysis Exact sciences and technology Generalized inverses Mathematical analysis Mathematics Moore–Penrose inverse Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Sequences, series, summability Strassen method Complexity analysis Generalized inverses Strassen method Moore–Penrose inverse 15A09 Cholesky factorization Multiplication Moore Penrose inverse Numerical linear algebra Recursive algorithm Moore-Penrose inverse Direct method Numerical analysis Linear system Matrix inversion Applied mathematics Symmetric matrix Cholesky method Factorization method Positive definite matrix Recursive method Matrix method
ISSN:	0377-0427, 1879-1778
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!