1974
DOI: 10.1007/bf01436620
|View full text |Cite
|
Sign up to set email alerts
|

Reduktionsverfahren f�r Differenzengleichungen bei Randwertaufgaben I

Abstract: Summary. This paper describes a fast and numerically stable method for solving the discrete Dirichlet problem for Poisson's equation in case of a rectangle (and mainly, a square). By using a special calculus for difference operators, the system of linear equations is reduced to a block-triangular system such that the diagonal blocks are heavily diagonally dominant. For a standard version of the algorithm, the number of operations and the computing time are proportional to h -~ (h =mesh width). The method is on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

1978
1978
2010
2010

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(15 citation statements)
references
References 8 publications
0
14
0
1
Order By: Relevance
“…When solving Poisson's equation, this solution is equivalent to the total reduction method by Schröder and Trottenberg [7], [8]. The derivation of total reduction methods was based on the structure of a stationary impulse response for LSI systems and thus imposes stronger assumptions on the system.…”
Section: Corollarymentioning
confidence: 99%
See 3 more Smart Citations
“…When solving Poisson's equation, this solution is equivalent to the total reduction method by Schröder and Trottenberg [7], [8]. The derivation of total reduction methods was based on the structure of a stationary impulse response for LSI systems and thus imposes stronger assumptions on the system.…”
Section: Corollarymentioning
confidence: 99%
“…8a changes from a W-cycle into a V-cycle [16], reducing the computational complexity from O(n log n) to O(n). This is actually what happens when solving Poisson's equation, where this method is equivalent to total reduction methods [7], [8]. In general, this depends on the structure of the system and it will not be study here in depth.…”
Section: A Multiplicative Direct Multi-grid Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…This method can be used, for example, for solving a linear system with a tridiagonal matrix or with a special block tridiagonal matrix (d. [14], [17], [25], [26]). We explain the cyclic reduction principle by considering an n x n linear system with a tridiagonal matrix:…”
Section: Cyclic Reductionmentioning
confidence: 99%