Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics...Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.展开更多
This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann con...This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann condition on the another part of boundary). For the pure Dirichlet problem, Marini and Quarteroni [3], [4] considered a similar approach, which is extended to more complex problem in this paper.展开更多
By applying iterative technique,we obtain the existence of positive solutions for a singular Riemann-Stieltjes integral boundary value problem in the case that f（t,u） is non-increasing respect to u.
In this paper, we are concerned with the symmetric positive solutions of a 2n-order boundary value problems on time scales. By using induction principle,the symmetric form of the Green＇s function is established. In o...In this paper, we are concerned with the symmetric positive solutions of a 2n-order boundary value problems on time scales. By using induction principle,the symmetric form of the Green＇s function is established. In order to construct a necessary and sufficient condition for the existence result, the method of iterative technique will be used. As an application, an example is given to illustrate our main result.展开更多
基金supported by Open Fund of Engineering Laboratory of Spatial Information Technology of Highway Geological Disaster Early Warning in Hunan Province(Changsha University of Science&Technology,kfj150602)Hunan Province Science and Technology Program Funded Projects,China(2015NK3035)+1 种基金the Land and Resources Department Scientific Research Project of Hunan Province,China(2013-27)the Education Department Scientific Research Project of Hunan Province,China(13C1011)
文摘Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.
文摘This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann condition on the another part of boundary). For the pure Dirichlet problem, Marini and Quarteroni [3], [4] considered a similar approach, which is extended to more complex problem in this paper.
基金supported by Program for Scientific research innovation team in Colleges and universities of Shandong Provincethe Doctoral Program Foundation of Education Ministry of China(20133705110003)+1 种基金the Natural Science Foundation of Shandong Province of China(ZR2014AM007)the National Natural Science Foundation of China(11571197)
文摘By applying iterative technique,we obtain the existence of positive solutions for a singular Riemann-Stieltjes integral boundary value problem in the case that f（t,u） is non-increasing respect to u.
基金Supported by NNSF of China(11201213,11371183)NSF of Shandong Province(ZR2010AM022,ZR2013AM004)+2 种基金the Project of Shandong Provincial Higher Educational Science and Technology(J15LI07)the Project of Ludong University High-Quality Curriculum(20130345)the Teaching Reform Project of Ludong University in 2014(20140405)
文摘In this paper, we are concerned with the symmetric positive solutions of a 2n-order boundary value problems on time scales. By using induction principle,the symmetric form of the Green＇s function is established. In order to construct a necessary and sufficient condition for the existence result, the method of iterative technique will be used. As an application, an example is given to illustrate our main result.
