A method is proposed for reducing the cost of computing search directions in an interior point method for a quadratic program. The KKT system is partitioned and modified, based on the ratios of the slack variables and dual variables associated with the inequality constraints, to produce a smaller, approximate linear system. Analytical and numerical results are included that suggest the distribu...

هدف: پژوهش حاضر با هدف بررسی مقایسه اثربخشی گروه درمانی شناختی – رفتاری و ذهن ­آگاهی مبتنی بر شناخت کاهش رفتارهای پرخطر در معتادان ترک افیونی صورت گرفت. روش: روش این شبه آزمایشی طرح پیش آزمون پس همراه کنترل است. جامعه­ی آماری شامل کلیه افراد وابسته به مواد مراجعه کننده مرکز اعتیاد شبکه بهداشت درمان شهرستان سرپل ذهاب نیمه اول سال 1396 بود، نمونه­ گیری دسترس تعداد 36 نفر تشخیص وابستگی اساس معیاره...

We consider numerical solution of finite element discretizations the Stokes problem. focus on transform-then-solve approach, which amounts to first apply a specific algebraic transformation linear system equations arising from discretization, and then solve transformed with an multigrid method. The approach has recently been applied difference problem constant viscosity, recommended itself as r...

This work is devoted to the multiharmonic analysis of eddy current optimal control problems in a time-periodic setting. In contrast to previous approaches, we derive the problem setting in a mixed variational formulation to enforce Coulomb gauge in an explicit way. Additionally, we include the cases of different control and observation domains, observation in certain energy spaces, observation ...

In this manuscript, we describe effective solvers for the optimal control of stabilized convectiondiffusion control problems. We employ the Local Projection Stabilization, which results in the same matrix system whether the discretize-then-optimize or optimize-then-discretize approach for this problem is used. We then derive two effective preconditioners for this problem, the first to be used w...

Image deblurring, i.e., reconstruction of a sharper image from a blurred and noisy one, involves the solution of a large and very ill-conditioned system of linear equations, and regularization is needed in order to compute a stable solution. Krylov subspace methods are often ideally suited for this task: their iterative nature is a natural way to handle such largescale problems, and the underly...

In the context of Krylov methods for solving systems of linear equations, expressions and bounds are derived for the norm of the minimal residual, like the one produced by GMRES or MINRES. It is shown that the minimal residual norm is large as long as the Krylov basis is well-conditioned. In the context of non-normal matrices, examples are given where the minimal residual norm is a function of ...

Projected Krylov methods are full-space formulations of Krylov methods that take place in a nullspace. Provided projections into the nullspace can be computed accurately, those methods only require products between an operator and vectors lying in the nullspace. In the symmetric case, their convergence is thus entirely described by the spectrum of the (preconditioned) operator restricted to the...

This is a methodological study that suggests a taxometric technique for objective classification of yeasts. It makes use of the minres method of factor analysis and groups strains of yeast according to their factor profiles. The similarities are judged in the higher-dimensional space determined by the factor analysis, but otherwise rely on the simple concept of "most like" or "neighbor." The pr...

We present and analyze a new damping approach called backward step control for the globalization of the convergence of Newton-type methods for the numerical solution of nonlinear root-finding problems. We provide and discuss reasonable assumptions that imply convergence of backward step control on the basis of generalized Newton paths in conjunction with a backward analysis argument. In particu...