2017
DOI: 10.1016/j.cam.2016.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Analytical Jacobian-vector products for the matrix-free time integration of partial differential equations

Abstract: Many scientific and engineering applications require the solution of large systems of initial value problems arising from method of lines discretization of partial differential equations. For systems with widely varying time scales, or with complex physical dynamics, implicit time integration schemes are preferred due to their superior stability properties. These schemes solve at each step linear systems with matrices formed using the Jacobian of the right hand side function. For large applications iterative l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
1
1

Relationship

5
3

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…In this section we test the several implementations of the new BOROK methods on a set of problems. As the base ROK methods (and other K-methods) have been previously compared against other standard methods (see [27,[47][48][49][50]), we restrict ourselves to comparing BOROK only against the base ROK methods and compatible variations.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In this section we test the several implementations of the new BOROK methods on a set of problems. As the base ROK methods (and other K-methods) have been previously compared against other standard methods (see [27,[47][48][49][50]), we restrict ourselves to comparing BOROK only against the base ROK methods and compatible variations.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Similar to some 4-D ensemble approaches, the gradient computations can be approximated by the tangent linear model with the adjoint not being required. In fact all that is required is matrix vector products which can be approximated with finite differences (Tranquilli et al, 2017).…”
Section: Adaptive Localization Via a Time-distributed Cost Functionmentioning
confidence: 99%
“…Similar to all other 4D ensemble approaches, this requires only the computation of the tangent linear model in order to derive the gradient; an adjoint model is not required. In fact all that is required is matrix vector products which can be approximated with finite differences (Tranquilli et al, 2017).…”
Section: Adaptive Localization Via a Time-distributed Cost Functionmentioning
confidence: 99%
“…The inflation factor is kept constant, and we test α values from 1.02 to 1.16 (represented on the x-axis). The constant localization radius varies in increments of 5 over the range[5,45]. Only the best results are plotted, and are used as the mean seeds for the adaptive algorithm.…”
mentioning
confidence: 99%