| Title:
|
Complexity and memory requirements of an algorithm for solving saddle-point linear systems with singular blocks (English) |
| Author:
|
Kučera, Radek |
| Language:
|
English |
| Journal:
|
Programs and Algorithms of Numerical Mathematics |
| Volume:
|
Proceedings of Seminar. Dolní Maxov, June 6-11, 2004 |
| Issue:
|
2004 |
| Year:
|
|
| Pages:
|
131-135 |
| . |
| Category:
|
math |
| . |
| Summary:
|
The paper deals with fast solution of large saddle-point systems arising in wavelet-Galerkin discretizations of separable elliptic PDEs. The periodized orthonormal compactly supported wavelets of the tensor product type together with the fictitious domain method are used. A special structure of matrices makes possible to use the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results. () |
| . |
| Date available:
|
2015-09-08T11:15:07Z |
| Last updated:
|
2023-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/702785 |
| . |
