Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices

Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A [asymptotically =] R^T R up to any desired accuracy, where R is an upper triangular hierarchically semiseparable (HSS) matrix. The factorization is stable, robust, and efficient. The method com...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on matrix analysis and applications Jg. 31; H. 5; S. 2899 - 2920
Hauptverfasser:	Xia, Jianlin, Gu, Ming
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
Schlagworte:	Algebra Algorithms Approximation Breaking down Cholesky factorization Complement Compressing Exact sciences and technology Factorization Linear and multilinear algebra, matrix theory Mathematical analysis Mathematical models Mathematics Matrix Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Studies Triangular matrix Compression Stabilization Schur compensation Numerical data Cholesky method Compensation 65F30 Development Sparse matrix hierarchically semiseparable structure Schur complement Approximation off-diagonal compression robust preconditioner Rank Algorithm Factorization Numerical analysis Symmetric matrix 15A12 Linear algebra Positive definite matrix Potential method Performance Preconditioning 65F05
ISSN:	0895-4798, 1095-7162
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!