A Lanczos approach to the inverse square root of a large and sparse matrix (Q1577026): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088635427 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: hep-lat/9910045 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Locality properties of Neuberger's lattice Dirac operator / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MINIMIZING STORAGE IN IMPLEMENTATIONS OF THE OVERLAP LATTICE-DIRAC OPERATOR / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3359644 / rank | |||
Normal rank | |||
Latest revision as of 13:31, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lanczos approach to the inverse square root of a large and sparse matrix |
scientific article |
Statements
A Lanczos approach to the inverse square root of a large and sparse matrix (English)
0 references
22 November 2000
0 references
The author presents a Lanczos method to compute the inverse square root of a large and sparse positive definite matrix. The algorithm is a stable version of an earlier proposal of the author. The proposed method is characterized by a residual vector norm that decreases monotonically and by a consistent stopping condition. The ``matrix sign'' and the ``polar decomposition'' of a matrix are the concepts used in the paper. The paper has no theorems, lemmas, or propositions, but it has a descriptive character.
0 references
matrix equations
0 references
inverse square root of a matrix
0 references
Lanczos algorithm
0 references
