Iterative Methods for Overflow Queuing Models I.
For solving linear complementarity problems LCP more attention has recently been paid on a class of iterative methods called the matrix-splitting. But up to now, no paper has discussed the effect of preconditioning technique for matrix-splitting methods in LCP. So, this paper is planning to fill in this gap and we use a class of preconditioners with generalized Accelerated Overrelaxation (GAOR) methods and analyze the convergence of these methods for LCP. Furthermore, Comparison between our methods...
We consider high order finite difference approximations to the Helmholtz equation in an exterior domain. We include a simplified absorbing boundary condition to approximate the Sommerfeld radiation condition. This yields a large, but sparse, complex system, which is not self-adjoint and not positive definite. We discretize the equation with a compact fourth or sixth order accurate scheme. We solve this large system of linear equations with a Krylov subspace iterative method. Since the method converges...
We consider high order finite difference approximations to the Helmholtz equation in an exterior domain. We include a simplified absorbing boundary condition to approximate the Sommerfeld radiation condition. This yields a large, but sparse, complex system, which is not self-adjoint and not positive definite. We discretize the equation with a compact fourth or sixth order accurate scheme. We solve this large system of linear equations with a Krylov subspace iterative method. Since the method converges...
We will discuss Kellogg's iterations in eigenvalue problems for normal operators. A certain generalisation of the convergence theorem is shown.