Accelerating the Convergence of Discretization Algorithms

DOI10.1137/0704046zbMath0265.65043OpenAlexW2131453825MaRDI QIDQ5681481

No author found.

Publication date: 1967

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2060/19670015991

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Extrapolation to the limit, deferred corrections (65B05) Numerical solution of boundary value problems involving ordinary differential equations (65L10)

Related Items (22)

Asymptotic Expansions for a Class of Elliptic Difference Schemes ⋮ Convergence of a two-stage Richardson process for nonlinear equations ⋮ On the stability of the disturbance algorithm for a semi-discrete scheme of solution of an evolutionary equation in the Banach space ⋮ The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems ⋮ The perturbation algorithm for the realization of a four-layer semi-discrete solution scheme of an abstract evolutionary problem ⋮ Unnamed Item ⋮ On the design of nested iterations for elliptic difference equations ⋮ Fixed Point Iteration with Inexact Function Values ⋮ A split step approach for the 3-D Maxwell's equations ⋮ Reduction of Some Semi-discrete Schemes for an Evolutionary Equation to Two-Layer Schemes and Estimates for the Approximate Solution Error ⋮ Some unconditionally stable time stepping methods for the 3D Maxwell's equations. ⋮ Perturbation algorithm for implementing a finite-difference approximation to an abstract evolutionary problem and explicit error estimation of its solution ⋮ A note on the “nested iterations” method ⋮ On the perturbation algorithm for the semidiscrete scheme for the evolution equation and estimation of the approximate solution error using semigroups ⋮ A note on solution of large sparse maximum entropy problems with linear equality constraints ⋮ The perturbation algorithm for the realization of a multi-layer semi-discrete solution scheme for an abstract evolutionary problem ⋮ The accurate solution of Poisson's equation by expansion in Chebyshev polynomials ⋮ Error estimation and iterative improvement for discretization algorithms ⋮ The accuracy, efficiency, and stability of three numerical models with application to open ocean problems ⋮ Asymptotic expansions of the global error for the implicit midpoint rule (stiff case) ⋮ High Order Fast Laplace Solvers for the Dirichlet Problem on General Regions ⋮ Reduction of a three-layer semi-discrete scheme for an abstract parabolic equation to two-layer schemes. Explicit estimates for the approximate solution error

This page was built for publication: Accelerating the Convergence of Discretization Algorithms