A global variant of the COCR method for the complex symmetric Sylvester matrix equation AX + XB = C
| Autor: | Mao-Xiao Wang, Sheng-Kun Li, Gang Liu |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Sylvester matrix
Helmholtz equation 010103 numerical & computational mathematics 01 natural sciences 010101 applied mathematics Computational Mathematics Monotone polygon Computational Theory and Mathematics Modeling and Simulation Convergence (routing) Conjugate residual method Sylvester matrix equation Applied mathematics Lanczos process 0101 mathematics Mathematics Conjugate |
| Zdroj: | Computers & Mathematics with Applications. 94:104-113 |
| ISSN: | 0898-1221 |
| DOI: | 10.1016/j.camwa.2021.04.026 |
| Popis: | Complex symmetric Sylvester matrix equations appear in many applications, such as the numerical solution of the complex Helmholtz equations. In this paper, by designing a global complex symmetric M -Lanczos process we develop a global variant of the conjugate A-orthogonal conjugate residual method (Gl-COCR) for solving the Sylvester matrix equation A X + X B = C with complex symmetric coefficient matrices. To obtain the smooth and monotone convergence behavior, we also propose a smoothed Gl-COCR method, denoted by SGl-COCR. Finally, numerical examples are given to illustrate the performances of our methods. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect