摘要
We consider the numerical solution of a c-stable linear equation in the tensor product space ℝn1x...xnd, arising from a discretized elliptic partial differential equation in ℝd. Utilizing the stability, we produce an equivalent d-stable generalized Stein-like equation, which can be solved iteratively. For large-scale problems defined by sparse and structured matrices, the methods can be modified for further efficiency, producing algorithms of O(Σini)+O(ns) computational complexity, under appropriate assumptions (with ns being the flop count for solving a linear system associated with Ai-γIni). Illustrative numerical examples will be presented.
原文 | 英語 |
---|---|
文章編號 | e2106 |
期刊 | Numerical Linear Algebra with Applications |
卷 | 24 |
發行號 | 6 |
DOIs | |
出版狀態 | 已發佈 - 2017 12月 |
ASJC Scopus subject areas
- 代數與數理論
- 應用數學