RECORD
Robust iteration methods for complex systems with an indefinite matrix term
Numerical Analysis · Submitted 1 Oct 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim To handle this we propose different forms of matrix splitting methods, with or without any parameters involved.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with symmetric positive definite matrices can be solved readily by rewriting the complex matrix system in two-by-two block matrix form with real matrices which can be efficiently solved by iteration using the preconditioned square block (PRESB) preconditioning method and preferably accelerated by the Chebyshev method. The appearances of an indefinite matrix term causes however some difficulties. To handle this we propose different forms of matrix splitting methods, with or without any parameters involved. A matrix spectral analyses is presented followed by extensive numerical comparisons of various forms of the methods.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. | background 1.00 | 0.05 | 0.03 | asserted 1.00 |
| s1 | Complex systems with symmetric positive definite matrices can be solved readily by rewriting the complex matrix system in two-by-two block matrix form with real matrices which can be efficiently solved by iteration using the preconditioned square block (PRESB) preconditioning method and preferably accelerated by the Chebyshev method. | background 1.00 | 0.10 | 0.06 | asserted 0.99 |
| s2 | The appearances of an indefinite matrix term causes however some difficulties. | background 0.68 | 0.08 | 0.02 | asserted 1.00 |
| s3 | To handle this we propose different forms of matrix splitting methods, with or without any parameters involved. | contribution 0.74 | 0.90 | 0.13 | asserted 0.98 |
| s4 | A matrix spectral analyses is presented followed by extensive numerical comparisons of various forms of the methods. | contribution 0.58 | 0.92 | 0.13 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with symmetric positive definite matrices can be solved readily by rewriting the complex matrix system in two-by-two block matrix form with real matrices which can be efficiently solved by iteration using the preconditioned square block (PRESB) preconditioning method and preferably accelerated by the Chebyshev method. The appearances of an indefinite matrix term causes however some difficulties. To handle this we propose different forms of matrix splitting methods, with or without any parameters involved. A matrix spectral analyses is presented followed by extensive numerical comparisons of various forms of the methods.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites · 1 sentence without a confident label
Cites as background 1 paper
-
When the matrices $M$ and $K$ are symmetric positive semidefinite with at least one of them being positive definite, there are several iteration methods for solving the system [ref] .
Two-step scale-splitting method for solving complex symmetric system of linear equations · Introduction · 0.85
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.