Search

Abstract: In this paper, we consider numerical simulation to a class of constrained dynamic problems where the overall dynamics are determined by the interactions between two sub-systems. We present an iterative algorithm that naturally decouples the computation of the two sub-systems and that ensures an accurate and efficient solution procedure. We conduct rigorous error analysis for the convergence of the iterative algorithm, and verify the analytical results through careful numerical tests. [Copyright &y& Elsevier]

Abstract: In this paper we propose an iterative algorithm to solve large size linear inverse ill posed problems. The regularization problem is formulated as a constrained optimization problem. The dual Lagrangian problem is iteratively solved to compute an approximate solution. Before starting the iterations, the algorithm computes the necessary smoothing parameters and the error tolerances from the data. The numerical experiments performed on test problems show that the algorithm gives good results both in terms of precision and computational efficiency. [Copyright &y& Elsevier]

Abstract: In this paper, the issue of multi-degree reduction of Bézier curves with C 1 and G 2-continuity at the end points of the curve is considered. An iterative method, which is the first of this type, is derived. It is shown that this algorithm converges and can be applied iteratively to get the required accuracy. Some examples and figures are given to demonstrate the efficiency of this method. [Copyright &y& Elsevier]

Abstract: In this paper extended algorithm of Karmarkar’s interior point algorithm is considered. Theoretical aspects of the new algorithm are discussed. We show that the new iterative algorithm converges faster than former Karmarkar’s algorithms. Successful convergence for problems of different sizes is obtained. Numerical results show that when we use a new parameter in the classical Karmarkar’s algorithm, number of iterations is less than the number of iterations for two mentioned methods. [Copyright &y& Elsevier]

Abstract: In this paper, a two-step algorithm for solving singular linear systems is presented. We compare this algorithm with a DGCR type algorithm [A. Sidi, A unified approach to Krylov subspace methods for the Drazin-inverse solution of singular non-symmetric linear systems, Linear Algebra Appl. 298 (1999) 99–113] by numerical experiments. An error analysis is given. [Copyright &y& Elsevier]

Abstract: In this paper two algorithms for computing the principal square root of a centrosymmetric H-matrix with positive diagonal entries are proposed. It is showed that our algorithms ensure significant savings in computational costs, as compared to the case of an arbitrary H-matrix A with positive diagonal entries. [Copyright &y& Elsevier]

In this paper, DFOM algorithm is presented. We compare DGMRES algorithm with DFOM algorithm by numerical experiment. Error analysis for projection method is also given. [Copyright &y& Elsevier]