Power bounded prolongations and Picard-Lindelöf iteration
convergence accelerationlinear constant coefficient systemslinear multistep methodmesh refinementPicard-Lindelöf iterationpower bounded prolongations
Linear ordinary differential equations and systems (34A30) Extrapolation to the limit, deferred corrections (65B05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)
The author continues several earlier studies of Picard-Lindelöf iteration of linear constant coefficient systems \(\dot x+Ax=f(t),\) \(x(0)=x_ 0\), where the matrix A is assumed to be split as \(A=M-N\) for iteration \(\dot x^ n+Mx^ n=Nx^{n-1}+f(t),\) \(x^ n(0)=x_ 0\) [see e.g. the author, ibid. 57, No.2, 147-156 (1990; Zbl 0697.65058)]. There are two obvious ways to try to speed up the basic iteration: either by accelerating the convergence or by lessening the work done with iterating. In the present paper the author obtains a result which says that if one keeps refining the mesh the iteration errors decay essentially independently of the refinement process. The analysis to prove these results is done among grid functions identifying them as sequences in \(l_ 2\)-spaces. Each sweep is done by a linear multistep method with a fixed time step. As one is forced to prolongate the iterate on the finer mesh each time the step is decreased, an essential point in those results is to make sure that repeated prolongation itself is stable. It is shown that there are arbitrarily high order nonexpansive prolongations in an \(l_ 2\)-setting and that those particular prolongations are power bounded in the \(l_{\infty}\)- norm.
- An efficient and simple approximate technique for solving nonlinear initial and boundary-value problems
- Remarks on Picard-Lindelöf iteration
- A note on approximation of solutions of \(K\)-positive definite operator equations
- On the problem of starting points for iterative methods
- scientific article; zbMATH DE number 4109996
- Semiconvergence criteria of iterations and extrapolated iterations and constructive methods of semiconvergent iteration matrices
- Chebyshev acceleration of Picard-Lindelöf iteration
- Monotone convergence of iterative methods for right focal point boundary value problems
- A convergence analysis of the iterative aggregation method with one parameter
- Accuracy and stability of multistage multistep formulas
- Convergence of Dynamic Iteration Methods for Initial Value Problems
- Linear acceleration of Picard-Lindelöf iteration
- Multi-grid dynamic iteration for parabolic equations
- Order stars and stability theorems
- Remarks on Picard-Lindelöf iteration
- Sets of convergence and stability regions
- Stability and accuracy of time discretizations for initial value problems
- Remarks on Picard-Lindelöf iteration
- Space-time domain decomposition for advection-diffusion problems in mixed formulations
- scientific article; zbMATH DE number 4109996 (Why is no real title available?)
- Quasinilpotency of the operators in picard-lindelöf iteration
- Polynomial acceleration of the Picard-Lindelof iteration
- On resolvent conditions and stability estimates
- Remarks on Picard-Lindelöf iteration. II
- Linear acceleration of Picard-Lindelöf iteration
This page was built for publication: Power bounded prolongations and Picard-Lindelöf iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756380)
