A symmetric linear system solver

Rao, S. Chandra Sekhara; Sarita,

doi:10.1016/j.amc.2008.04.046

Cited by 5 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another application of the collocation method using the cardinal exponential B-splines was shown for nding the numerical solutions of the singularly perturbed boundary problem in the study of Desanka Radunuvic [4]. The exponential B-spline collocation method is set up to obtain the numerical solutions of the self-adjoint singularly perturbed boundary value problems in the work [5]. The linear partial di erential equation known as the convection-di usion equation is solved by way of the exponential B-spline collocation method in the study [6].…”

Section: Introductionmentioning

confidence: 99%

Numerical solutions of the reaction diffusion system by using exponential cubic B-spline collocation algorithms

Ersoy

Dağ

2015

Open Physics

View full text Add to dashboard Cite

Abstract:The solutions of the reaction-di usion system are given by method of collocation based on the exponential B-splines. Thus the reaction-di usion system turns into an iterative banded algebraic matrix equation. Solution of the matrix equation is carried out by way of Thomas algorithm. The present methods test on both linear and nonlinear problems. The results are documented to compare with some earlier studies by use of L∞ and relative error norm for problems respectively.

show abstract

Section: Introductionmentioning

confidence: 99%

Numerical solutions of the reaction diffusion system by using exponential cubic B-spline collocation algorithms

Ersoy

Dağ

2015

Open Physics

View full text Add to dashboard Cite

show abstract

Using a new regularized factorization method for unconstrained optimization problems

Niri

Fazeli

Hosseini

2019

Int J Numerical Modelling

View full text Add to dashboard Cite

In this paper, a new regularized factorization method is presented for solving unconstrained minimization problems in which the Hessian matrix may not be a positive definite or may be close to singular. With employing the modified quadrant interlocking factorization (QIF), an efficient algorithm is developed to find a suitable method. Moreover, under suitable conditions, the global convergence of the proposed method is established. Some interesting examples are solved by the proposed method and the improved Cholesky factorization method. The results show that the proposed method, in the most cases, the algorithm has a faster convergence than the improved Cholesky factorization method. KEYWORDSimproved Cholesky factorization, modified newton method, QIF, unconstrained optimization Int J Numer Model. 2019;32:e2580.wileyonlinelibrary.com/journal/jnm

show abstract