Numerical properties of block Cholesky-like methods for solving symmetric quasi-definite linear systems

Felicja Okulicka-Dłuzewska, Ryszard Kozera, Alicja Smoktunowicz

Research output: Chapter in Book/Conference paperConference paper

Abstract

This paper presents a comparison of two Cholesky-like algorithms for solving symmetric quasi-definite system Mz = f. This pair of methods computes the block factorization M = RT DR, where R is upper triangular and D is a diagonal matrix.

Original languageEnglish
Title of host publicationInternational Conference of Numerical Analysis and Applied Mathematics, ICNAAM 2017
EditorsCharalambos Tsitouras, Theodore Simos
PublisherAmerican Institute of Physics
Volume1978
ISBN (Electronic)9780735416901
DOIs
Publication statusPublished - 10 Jul 2018
EventInternational Conference of Numerical Analysis and Applied Mathematics, ICNAAM 2017 - Thessaloniki, Greece
Duration: 25 Sep 201730 Sep 2017

Conference

ConferenceInternational Conference of Numerical Analysis and Applied Mathematics, ICNAAM 2017
CountryGreece
CityThessaloniki
Period25/09/1730/09/17

Fingerprint Dive into the research topics of 'Numerical properties of block Cholesky-like methods for solving symmetric quasi-definite linear systems'. Together they form a unique fingerprint.

Cite this