2006
DOI: 10.1137/1.9780898718669
|View full text |Cite
|
Sign up to set email alerts
|

Control Perspectives on Numerical Algorithms and Matrix Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
100
0
1

Year Published

2007
2007
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 88 publications
(101 citation statements)
references
References 0 publications
0
100
0
1
Order By: Relevance
“…As discussed above, researchers have tried to manage these dynamics through the time step (Tocci et al, 1997;Kavetski et al, 2002;D'Haese et al, 2007) and/or linearization technique (Paniconi and Putti, 1994;Lehmann and Ackerer, 1998;Lipnikov et al, 2016). Alternative linearization approaches (e.g., List and Radu, 2016) and better algorithms for managing the complex dynamics of adaptive solvers taken, for example, from control-theory (Bhaya and Kaszkurewicz, 2006) could directly improve existing production codes and also lower the barrier to adoption of more accurate spatial approximations.…”
Section: Discussion and Alternativesmentioning
confidence: 99%
“…As discussed above, researchers have tried to manage these dynamics through the time step (Tocci et al, 1997;Kavetski et al, 2002;D'Haese et al, 2007) and/or linearization technique (Paniconi and Putti, 1994;Lehmann and Ackerer, 1998;Lipnikov et al, 2016). Alternative linearization approaches (e.g., List and Radu, 2016) and better algorithms for managing the complex dynamics of adaptive solvers taken, for example, from control-theory (Bhaya and Kaszkurewicz, 2006) could directly improve existing production codes and also lower the barrier to adoption of more accurate spatial approximations.…”
Section: Discussion and Alternativesmentioning
confidence: 99%
“…See [39,1,12,71,47,37,55], as well as the review paper [25] and the feedback control interpretation in [10,11].…”
Section: Iterative Methods and Forward Eulermentioning
confidence: 99%
“…It is also appropriate for use with large, sparse matrices, since it uses only matrix-vector products in its computations. Notice, however, that the CG algorithm works with a state space of dimension twice that of the vector x, since it uses coupled iterations in both r and p. This is interpreted from a control perspective in [9,10]. Note also that the coupling between the r and p iterations (5) is of the Gauss-Seidel type, i.e, the updated value r k+1 is used immediately after it is computed in the p update.…”
Section: Preliminariesmentioning
confidence: 99%