Search results for: A.Tajaddini

Authors: Azita Tajaddini, Ramleh Shamsi

Abstract:

In this paper, we present the block generalized minimal residual (BGMRES) method in order to solve the generalized Sylvester matrix equation. However, this method may not be converged in some problems. We construct a polynomial preconditioner based on BGMRES which shows why polynomial preconditioner is superior to some block solvers. Finally, numerical experiments report the effectiveness of this method.

Keywords: Linear matrix equation, Block GMRES, matrix Krylov subspace, polynomial preconditioner.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 825

Authors: Ladan Tajaddini

Abstract:

Iranians- imagination of heaven, which is the reward of a person-s good deeds during their life, has shown itself in pleasant and green gardens where earthly gardens were made as representations of paradise. Iranians are also quite interested in making their earthly gardens and plantations around their buildings. With Iran-s hot and dry climate with a lack of sufficient water for plantation coverage, it becomes noticeable how important it is to Iranians- art in making gardens. This study, with regard to examples, documents and library studies, investigates the characteristics of Persian gardens. The result shows that elements such as soil, water, plants and layout have been used in forming a unique style of Persian gardens. Bagh-e Shah Zadeh Mahan (Mahan prince garden) is a typical example and has been carefully studied. In this paper I try to investigate and evaluate the characteristics of a Persian garden by means of a descriptive approach.

Keywords: environmental planning, Persian garden, landscape, shah zadeh garden, soil and water, gardening.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2879

Authors: A.Tajaddini

Abstract:

In this paper, two matrix iterative methods are presented to solve the matrix equation A1X1B1 + A2X2B2 + ... + AlXlBl = C the minimum residual problem l i=1 AiXiBi−CF = minXi∈BRni×ni l i=1 AiXiBi−CF and the matrix nearness problem [X1, X2, ..., Xl] = min[X1,X2,...,Xl]∈SE [X1,X2, ...,Xl] − [X1, X2, ..., Xl]F , where BRni×ni is the set of bisymmetric matrices, and SE is the solution set of above matrix equation or minimum residual problem. These matrix iterative methods have faster convergence rate and higher accuracy than former methods. Paige’s algorithms are used as the frame method for deriving these matrix iterative methods. The numerical example is used to illustrate the efficiency of these new methods.

Keywords: Bisymmetric matrices, Paige’s algorithms, Least square.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1347