Approximation of the determinant of large sparse symmetric positive definite matrices

Simple item page
dc.creatorReusken, Arnold
dc.date2000-08-10
dc.date.accessioned2026-07-07T03:38:21Z
dc.date.available2026-07-07T03:38:21Z
dc.descriptionThis paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse of A. The method is explained and theoretical properties are discussed. A posteriori error estimation techniques are presented. Furthermore, results of numerical experiments are given which illustrate the performance of this new method.
dc.description21 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/hep-lat/0008007
dc.identifierhttp://arxiv.org/abs/hep-lat/0008007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/38496
dc.subjectHigh Energy Physics - Lattice
dc.titleApproximation of the determinant of large sparse symmetric positive definite matrices
dc.typetext

Files

Collections

arXiv