Optimum iterative methods for the solution of singular linear systems arising from the discretization of elliptic P.D.E.'s
From MaRDI portal
(Redirected from Publication:1065499)
Optimal convergence rates of the Jacobi overrelaxation, successive overrelaxation and a Chebyshev semi-iterative method for the Poisson equation in a rectangle discretized by the 5-point scheme are computed for Neumann and periodic boundary conditions. They are compared with analogous results for the Dirichlet boundary conditions.
Recommendations
- Periodically generated iterative methods for solving elliptic equations
- scientific article; zbMATH DE number 124176
- Optimum sor methods for a class of linear systems
- scientific article; zbMATH DE number 939330
- The rational fitting method for determining the optimal parameters of iterative methods in finite difference discretization to Poisson's equations
Cites work
- A method for the improvement of the convergence rates of stationary iterative schemes for the solution of complex linear systems
- A second order stationary scheme for complex linear systems
- How to embrace your spectrum for faster iterative results
- scientific article; zbMATH DE number 3174491 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3766947 (Why is no real title available?)
- scientific article; zbMATH DE number 3640786 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3304458 (Why is no real title available?)
- scientific article; zbMATH DE number 3325215 (Why is no real title available?)
- scientific article; zbMATH DE number 3071035 (Why is no real title available?)
- On complex successive overrelaxation
- On the optimization of a class of second order iterative schemes
- On the Optimization of the Classical Iterative Schemes for the Solution of Complex Singular Linear Systems
- Optimal Parameters for Linear Second-Degree Stationary Iterative Methods
- Optimum strategy and nonstationary iterative methods for the solution of singular linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- Theorems of Stein-Rosenberg type. III. The singular case
Cited in
(16)- Optimum strategy and nonstationary iterative methods for the solution of singular linear systems
- Optimal block iterative schemes for certain large, sparse,and nonsymmetric linear systems
- Spectral analysis of the convergence of multicomponent iterative methods
- On the rate of convergence of the \(k\times k\) block, \(k\)-line iterative methods: \(k\to \infty\)
- A symmetrized Stone's method
- Periodically generated iterative methods for solving elliptic equations
- Determination of the optimal relaxation parameters for the solution of the Neumann-Poisson problem on uniform and non-uniform meshes using the scheduled relaxation Jacobi method
- The rational fitting method for determining the optimal parameters of iterative methods in finite difference discretization to Poisson's equations
- An accelerated over-relaxation quarter-sweep point iterative method for two-dimensional Poisson equation
- Optimum sor methods for a class of linear systems
- scientific article; zbMATH DE number 3909630 (Why is no real title available?)
- The convergence behaviour of iterative methods on severely stretched grids
- scientific article; zbMATH DE number 2097090 (Why is no real title available?)
- Asymptotically optimal solution of the model task for the screened Poisson equation
- On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method
- Scheduled relaxation Jacobi method: improvements and applications
This page was built for publication: Optimum iterative methods for the solution of singular linear systems arising from the discretization of elliptic P.D.E.'s
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065499)