2015
DOI: 10.1134/s2070048215020118
|View full text |Cite
|
Sign up to set email alerts
|

Multigrid method for anisotropic diffusion equations based on adaptive Chebyshev smoothers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…The projection of the discrepancy r h = g h − A h u h onto the H-grid by the operator R is taken as the right-hand side of the system on the H-grid. Algorithmic constructions of inter-grid transition operators P and R = P * are indicated in [19,20], where, in addition to the trilinear interpolation operator, the interpolation operator P based on the approximate solution of local boundary value problems is also given; this is critical for the case of discontinuous coefficients. Such inter-grid transition operators P and R = P * are said to be called problem-dependent (see [14]).…”
Section: Multigrid Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The projection of the discrepancy r h = g h − A h u h onto the H-grid by the operator R is taken as the right-hand side of the system on the H-grid. Algorithmic constructions of inter-grid transition operators P and R = P * are indicated in [19,20], where, in addition to the trilinear interpolation operator, the interpolation operator P based on the approximate solution of local boundary value problems is also given; this is critical for the case of discontinuous coefficients. Such inter-grid transition operators P and R = P * are said to be called problem-dependent (see [14]).…”
Section: Multigrid Methodsmentioning
confidence: 99%
“…We consider only the classical version of the multigrid method with resampling on all additional grid levels. Numerous meaningful examples of solving problems with various degrees of complexity (with discontinuous anisotropic coefficients and significant anisotropy) are given in [18][19][20][21]. For demonstration of the computational efficiency, we provide the results of the solution of the simplest equation u t = Δu + f in the parallelepiped…”
Section: Numerical Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, results are less sensitive to the minimum eigenvalue estimate, provided λ min > 0, as this delimits between the low frequencies that are handled by the coarse grid correction and the high frequencies that are eliminated by the action of the smoother. The choice of the bounds (relative to λ) is not universal: (1/30,1.1) [1], (0.3,1) [2], (0.25,1) [28], and (1/6,1) [32] have all been considered. Based on the results of Table 1, we set (λ min , λ max ) = (0.1, 1.1) λ as a conservative choice.…”
Section: Chebyshev Accelerationmentioning
confidence: 99%