2012
DOI: 10.1090/s0025-5718-2012-02564-6
|View full text |Cite
|
Sign up to set email alerts
|

Semi-implicit Krylov deferred correction methods for differential algebraic equations

Abstract: Abstract. In the recently developed Krylov deferred correction (KDC) methods for differential algebraic equation initial value problems (Huang, Jia, Minion, 2007), a Picard-type collocation formulation is preconditioned using low-order time integration schemes based on spectral deferred correction (SDC), and the resulting system is solved efficiently using Newton-Krylov methods. KDC methods have the advantage that methods with arbitrarily high order of accuracy can be easily constructed which have similar com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 54 publications
0
8
0
Order By: Relevance
“…Appendix: Pseudo-code of the parareal/SDC method The following is the pseudocode for a semi-implicit parareal/SDC implementation using the first-order time-stepping method in (12) and (15). FOR k = 1 .…”
Section: Discussionmentioning
confidence: 99%
“…Appendix: Pseudo-code of the parareal/SDC method The following is the pseudocode for a semi-implicit parareal/SDC implementation using the first-order time-stepping method in (12) and (15). FOR k = 1 .…”
Section: Discussionmentioning
confidence: 99%
“…In this section, we present our numerical scheme for solving (7), (8), and (9). Evaluating v involves layer potentials and Fourier differentiation, and for concentrated suspensions, this can be costly.…”
Section: Numerical Schemementioning
confidence: 99%
“…To reduce the cost of the linear solves, we used a block-diagonal preconditioner in [31] which is formed and factorized in matrix form at each time step. Using this preconditioner, the number of preconditioned GM-RES iterations depends only on the magnitude of the inter-vesicle interactions, which in turn is a function 1 If e n x j converges to 0, then r n+1 j = r n j , and by (8), we have solved (7) up to quadrature error.…”
Section: Preconditioningmentioning
confidence: 99%
See 1 more Smart Citation
“…There are many research topics [2,4,5,8,10,11,12,15,16,17,18] in developing numerical methods for solving initial value problems (IVPs) described by…”
Section: Introductionmentioning
confidence: 99%