نتایج جستجو برای: حل کننده gmres
تعداد نتایج: 115678 فیلتر نتایج به سال:
GMRES is a popular iterative method for the solution of large linear systems of equations with a square nonsymmetric matrix. The method generates a Krylov subspace in which an approximate solution is determined. We present modifications of the GMRES and the closely related RRGMRES methods that allow augmentation of the Krylov subspaces generated by these methods by a user-supplied subspace. We ...
به منظور بررسی اثر تلقیح باکتری های تثبیت کننده نیتروژن و حل کننده فسفات بر شاخص های رشد و جذب عناصر غذایی پایه هیبرید هلو × بادام (gf677) آزمایشی به صورت طرح کاملاً تصادفی با 9 تیمار و 4 تکرار انجام شد. سطوح آزمایش شامل تلقیح پایه با سویه هایی از باکتری های تثبیت کننده نیتروژن، ازتوباکتر کروکوکوم (1b )، آزوسپریلوم لیپوفروم (2b) و باکتری های حل کننده فسفات سودوموناس پوتیدا (3b)1 و باسیلوس پانتیا...
The sideways Heat equation (SHE) is a model of the problem of determining the temperature on the surface of a body from the interior measurements. Mathematically it can be formulated as a noncharacteristic Cauchy problem for a parabolic partial differential equation. This problem is severely ill-posed: the solution does not depend continuously on the data. We use a preconditioned Generalized Mi...
The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. However, little is known about the behavior of this method when it is applied to the solution of nonsymmetric linear ill-posed problems with a right-hand side that is contaminated by errors. We show that when the associated error-free right-hand side lies ...
Flexible GMRES, introduced by Saad, is a generalization of the standard GMRES method for the solution of large linear systems of equations. It is based on the flexible Arnoldi process for reducing a large square matrix to a small matrix. We describe how the flexible Arnoldi process can be applied to implement one-parameter and multi-parameter Tikhonov regularization of linear discrete ill-posed...
On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
The solution of nonsymmetric systems of linear equations continues to be a diicult problem. A main algorithm for solving nonsymmetric problems is restarted GMRES. The algorithm is based on restarting full GMRES every s iterations, for some integer s>0. This paper considers the impact of the restart frequency s on the convergence and work requirements of the method. It is shown that a good choic...
We construct, analyze and implement SSOR-like preconditioners for non-Hermitian positive definite system of linear equations when its coefficient matrix possesses either a dominant Hermitian part or a dominant skew-Hermitian part. We derive tight bounds for eigenvalues of the preconditioned matrices and obtain convergence rates of the corresponding SSOR-like iteration methods as well as the cor...
Standard multigrid algorithms have proven ineffective for the solution of discretizations of Helmholtz equations. In this work we modify the standard algorithm by adding GMRES iterations at coarse levels and as an outer iteration. We demonstrate the algorithm’s effectiveness through theoretical analysis of a model problem and experimental results. In particular, we show that the combined use of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید