Sensitivity-based methods for convergence acceleration of iterative algorithms.
From MaRDI portal
Publication:1578628
DOI10.1016/0045-7825(94)00776-JzbMATH Open1159.76361OpenAlexW1978809190MaRDI QIDQ1578628FDOQ1578628
Authors: Kwang-Yoon Choi, George S. Dulikravich 
Publication date: 4 September 2000
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(94)00776-j
Recommendations
- On accelerating the convergence of nonlinear iterative algorithms
- scientific article; zbMATH DE number 1864556
- scientific article; zbMATH DE number 4064340
- Acceleration of convergence of static and dynamic iterations
- Accelerating the convergence speed of iterative methods for solving nonlinear systems
- An acceleration technique for slowly convergent fixed point iterative methods
- scientific article; zbMATH DE number 4137236
- On acceleration of the convergence of one iterative method
- scientific article; zbMATH DE number 524098
- Acceleration of iteration methods for interval fixed point problems
Cites Work
- Title not available (Why is that?)
- Time-dependent boundary conditions for hyperbolic systems. II
- A numerical method for solving incompressible viscous flow problems
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Optimum acceleration factors for iterative solution of linear and nonlinear differential systems
- Fast iterative algorithms based on optimized explicit time stepping
- Distributed minimal residual (DMR) method for acceleration of iterative algorithms
- Modeling three-dimensional solidification with magnetic fields and reduced gravity
Cited In (4)
This page was built for publication: Sensitivity-based methods for convergence acceleration of iterative algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578628)
