2011
DOI: 10.1007/s00791-011-0158-4
|View full text |Cite
|
Sign up to set email alerts
|

Nested multigrid methods for time-periodic, parabolic optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 18 publications
0
15
0
Order By: Relevance
“…As we have shown in [5] and also follows from Section 3.1, an application of the preconditioner P For completeness, we include a brief account for the analysis of the spectrum of the preconditioned matrix P −1 F S A, where A is as in (17). The following result holds true.…”
Section: The Block Matrix Preconditioner Applied To a Stokes Optimal mentioning
confidence: 81%
See 2 more Smart Citations
“…As we have shown in [5] and also follows from Section 3.1, an application of the preconditioner P For completeness, we include a brief account for the analysis of the spectrum of the preconditioned matrix P −1 F S A, where A is as in (17). The following result holds true.…”
Section: The Block Matrix Preconditioner Applied To a Stokes Optimal mentioning
confidence: 81%
“…By eliminating the state and adjoint variables in the three-by-three block matrix for the optimality conditions, in [17] a Fredholm integral equation of the second kind arises. This can be seen as an infinite dimensional extension of the corresponding Schur complement matrix.…”
Section: Some Other Preconditioners For Time-periodic Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…In Figure 4.7, however, we can observe numerical evidence that the two-grid Newton-Picard preconditioner is completely robust with respect to γ. Our approach is thus more robust than alternative approaches, e.g., the nested multigrid methods suggested by Abbeloos et al [1], for which the convergence rates deteriorate with decreasing γ.…”
Section: 4mentioning
confidence: 96%
“…In this approach, the optimality conditions for the constrained minimization problem (1) are solved simultaneously for the state, the adjoint and the design variable in a SQP-like fashion. Because the simulation is directly integrated in the optimization process, these methods are often called Simultaneous Analysis and Design (SAND), all-at-once approach, or one-shot approach [10,11,12,13,14,15,16]. It has been observed numerically -at least for steady state PDEs -that the full space methods can outperform the reduced space methods by about one order of magnitude measured in iteration counts and runtime [8,17].…”
mentioning
confidence: 99%