zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Approximate sparsity patterns for the inverse of a matrix and preconditioning. (English) Zbl 0927.65045
The author shows that it is possible to use purely algebraic methods to derive a rough prediction for a sparsity pattern of a sparse approximate inverse matrix. Different strategies for choosing a-priori such patterns are compared. It is shown that the sparsity pattern can be used as a maximum pattern to distribute the claimed data in one step to each processor. Therefore, communication is necessary only at the beginning and at the end of a subprocess. Results of numerical experiments comparing the different methods with regard to the quality of the resulting approximation for the inverse are given.

65F05Direct methods for linear systems and matrix inversion (numerical linear algebra)
65F35Matrix norms, conditioning, scaling (numerical linear algebra)
65F50Sparse matrices (numerical linear algebra)
Full Text: DOI