Iterative methods for solving large systems of linear equations

D. M. Young

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Iterative methods for solving large systems of linear equations”

New SOR-like methods for solving the Sylvester equation

Jakub Kierzkowski (2015)

Open Mathematics

Similarity:

We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.

A two parameter iterative method for solving algebraic systems of domain decomposition type

Milan Práger (1993)

Applications of Mathematics

Similarity:

An iterative procedure containing two parameters for linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numeric example is given as an illustration.

An iterative method of alternating type for systems with special block matrices

Milan Práger (1991)

Applications of Mathematics

Similarity:

An iterative procedure for systems with matrices originalting from the domain decomposition technique is proposed. The procedure introduces one iteration parameter. The convergence and optimization of the method with respect to the parameter is investigated. The method is intended not as a preconditioner for the CG method but for the independent use.