EuDML | Browse

The convergence of the Accelerated Overrelaxation (AOR) method is discussed. It is shown that the intervals of convergence for the parameters $σ$ and $ω$ are not always of the following form: $0 \leq ω \leq ω_{1}, - σ_{1} \leq σ \leq σ_{2}, σ_{1}, σ_{2} \geq 0$ .

Convergence properties of ART and SOR algorithms.

P. Lancaster, L. Elsner, I. Koltracht (1991)

Numerische Mathematik

Convergence rate estimate for a domain decomposition method.

X.-Ch. Cai, W.D. Gropp, D.E. Keyes (1992)

Numerische Mathematik

Convergence Theory of Extrapolated Iterative Methods for a Certain Class of Non-Symmetric Linear Systems.

Nikolaos M. Missirlis (1984)

Numerische Mathematik

Convergent Nonnegative Matrices and Iterative Methods for Consistent Linear Systems.

R.J. Plemmons, M. Neumann (1978/1979)

Numerische Mathematik

Crout versions of ILU factorization with pivoting for sparse symmetric matrices.

Li, Na, Saad, Yousef (2005)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

Decompositional analysis of Kronecker structured Markov chains.

Bao, Yujuan, Bozkurt, ịlker N., Dayar, Tuǧrul, Sun, Xiaobai, Trivedi, Kishor S. (2008)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations

Petr Tichý, Jan Zítko (1998)

Applications of Mathematics

Lanczos’ method for solving the system of linear algebraic equations $A x = b$ consists in constructing a sequence of vectors $x_{k}$ in such a way that $r_{k} = b - A x_{k} \in r_{0} + A 𝒦_{k} (A, r_{0})$ and $r_{k} ⊥ 𝒦_{k} (A^{T}, {\tilde{r}}_{0})$ . This sequence of vectors can be computed by the BiCG (BiOMin) algorithm. In this paper is shown how to obtain the recurrences of BiCG (BiOMin) directly from this conditions.

Currently displaying 161 – 180 of 549

Previous Page 9 Next

Displaying 161 – 180 of 549

Conjugate Direction Methods for Solving Systems of Linear Equations.

Constructive Sobolev gradient preconditioning for semilinear elliptic systems.

Contribution à la résolution numérique des équations de Laplace et de la chaleur

Convergence analysis of preconditioned AOR iterative method for linear systems.

Convergence and Comparison Analysis of Some Numerical Schwarz Methods.

Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations.

Convergence of infinite products of matrices and inner-outer iteration schemes.

Convergence of nested classical iterative methods for linear systems.

Convergence of the accelerated overrelaxation method

Convergence properties of ART and SOR algorithms.

Convergence rate estimate for a domain decomposition method.

Convergence Theory of Extrapolated Iterative Methods for a Certain Class of Non-Symmetric Linear Systems.

Convergent Nonnegative Matrices and Iterative Methods for Consistent Linear Systems.

Crout versions of ILU factorization with pivoting for sparse symmetric matrices.

Decompositional analysis of Kronecker structured Markov chains.

Derivation of BiCG from the conditions defining Lanczos' method for solving a system of linear equations

Derivation of high-order spectral methods for time-dependent PDE using modified moments.

Discrete wavelet transforms accelerated sparse preconditioners for dense boundary element systems.

Displacement preconditioner for Toeplitz least squares iterations.

Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes.

Currently displaying 161 – 180 of 549