非线性最小二乘问题的一类迭代解法

本给出了求解非线性最小二乘问题的一种迭代解法，即由已知节点数据（xi,yi）(i=1,2,…,m）求函数y=f(x,b1,b2,…，bn）中非线性参数b1,b2,…，bn的一种迭代解法。并用实际算例的结果说明了该迭代解法优于一般线性化方法，说明了该种方法在实际工程领域中的应用。     

一个不等式的推广及应用

第 6 4届普特南数学竞赛 ( 2 0 0 3年 ) A2题为 [1 ] :设 a1 ,a2 ,… ,an 和 b1 ,b2 ,… ,bn 都是非负实数 ,则　 ( a1 a2 … an) 1 n ( b1 b2 … bn) 1 n≤ [( a1 b1 ) ( a2 b2 )… ( an bn) ]1 n ( 1 )此不等式显然等价于　 ( a1 b1 ) ( a2 b2 )… ( an bn)≥ [( a1 a2 … an) 1 n ( b1 b2 … bn) 1 n]n ( 2 )当且仅当 a1 b1=a2b2=… =anbn或 b1 ,b2 ,… ,bn 全为 0时取等号 .最近文 [2 ]给出了此不等式的一些应用 .本文首先给出 ( 2 )的一个推广 ,然后给出推广结果的一些应用 .定理　设 aij>0 ( i=1 ,2 ,… ,n;j=1 ,2 ,… ,…     

浅谈柯西不等式的证明及应用

柯西(Cauchy)不等式(a1b1 a2b2 … anbn)2≤(a12 a22 … an2)(b12 b22 … bn2)(ai,bi∈R,i=1,2…,n),当且仅当a1b1=a2b2=…=anbn时等号成立.现将它的证明介绍如下:证明1(构造法):构设二次函数f(x)=(a1x b1)2 (a2x b2)2 … (anx bn)2=(a12 a22 … an2)x2 2(a1b1 a2b2 …anbn)x (b12 b22 … bn2),∵a12 a22 … an2>0,f(x)≥0恒成立,∴△=4(a1b1 a2b2 … anbn)2-4(a12 a22 … an2).(b12 b22 … bn2)≤0,即(a1b1 a2b2 … anbn)2≤(a12 a22 … an2)(b12 b22 … bn2),当且仅当aix bi=0(i=1,2,…,n),即a1b1=a2b2=…=anbn时等号成立.证明2(数学归纳…     

柯西不等式的解题魅力

平凡无奇的柯西不等式,应用广泛,充满着迷人的解题魅力．定理设a1,a2,…,an;b1,b2,…,bn∈R, 则(a12 a22 … an2)(b12 b22 … bn2)≥(a1b1 a2b2 … anbn)2．当且仅当a1:b1=a2:b2=…=an:bn时等号成立. 证明构造“数字式”:1 1=2简证之．设k1=a12 a22 … an2,k2=b12 b22 … bn2, 则1=1/k1(a12 a22 … an2),1=1/k2(b12 b22     

利用构造法巧解一道高考题

(1998年全国理科试题)已知数列{bn}是等差数列,b1=1,b1 b2 … b10=145. (1)求数列{bn}的通项bn;(2)设数列{bn}的通项an=loga(1 1/b)(其中a>0,且a≠1),记Sn是数列{an}的前n项和.试比较Sn与1/3logabn 1的大小,并证明你的结论. 解(1)易求得bn=3n-2. (2)由(1)可得     

柯西不等式的证明及应用

<正>高中数学学习中,不等式变形巧妙神奇,尤其是柯西不等式的应用.我梳理了一下有关柯西不等式的证明及应用,方便同学们使用.柯西不等式:(a1b1+a2b2+…+an bn)2≤(a21+a22+…+a2n)(b21+b22+…+b2n)(ai bi∈R,i=1,2…n).等号当且仅当a1=a2=…=an=0或bi=tai时成立(t为常数,i=1,2…n).柯西不等式的证明方法很多,下面的方法比较深刻且具通性.为简便,设ai不全为0.证法一(构造二次函数)f(x)=(a1x+b1)2+(a2x+b2)2+…+(an x+bn)2=(a21+a22+…+a2n)x2+2(a1b1+a2b2+…+an bn)x+(b21+b22+…+b2n).     

一个不等式的再推广及应用

2003年第64届普特兰数学竞赛A2题:设a1,a2,…,an和b1,b2,…,bn都是非负实数,证明:(a1a2…an)1n (b1b2…bn)1n≤[(a1 b1)(a2 b2)…(an bn)]1n.文[1]给出该不等式的如下推广:如果xij(i=1,2,…,m;j=1,2,…,n)为非负实数,则(x11x12…x1n)1n (x21x22…x2n)1n … (xm1xm2…xmn)1n≤[(     

综合题新编选登

题143设函数f(x)=x x2-a2(a>0).1)求f(x)的反函数f-1(x)及定义域;2)若数列{an}满足a1=3a,an 1=f-1(an),设bn=an-aan a,Sn表示{bn}的前n项和,试比较Sn与78的大小.解1)由f(x)=x x2-a2(a>0)得x=y2 a22y,∵y=x x2-a2(a>0),∴x2-a2=y-x=y-y2 a22y=(y a)(y-a)2y≥0,∴-a≤y<0或y≥a.∴f-1(x)=x2 a22x(-a≤x<0或x≥a)2)∵an 1=f-1(an)=an2 a22an,∴bn 1=an 1-aan 1 a=an2 a22an-a an2 a22an a=an-a an a2=bn2.∵a1=3a,∴b1=a1-aa1 a=12.∴bn=(bn-1)2=(bn-2)22=…=(12)2n-1.∴Sn=b1 b2 b3 … bn=12 (12)2 (12)22 … (12)2n-1.∵2n-1=C0n-1 C1n-1 …     

这样证明柯西不等式行得通吗?

在某文稿中,作者讲述如何用向量来解题,有一个例子是用向量证明柯西不等式——对任意实数。a1,a2,…,an;b1,b2,…,bn,n∈N*,有(a1+b1+a2b2+…+anbn)2≤(a12+a22+…+an2)(612+b22+…+bn2),当且仅当a1/b1=a2/b2=…=an/bn时等号成立.文稿给出的证明简要如下:     

一道数学竞赛题的推广

设 a1,a2 ,… ,an和 b1,b2 ,… ,bn都是非负实数 ,则　 [( a1+ b1) ( a2 + b2 )… ( an + bn) ]1n ≥　 ( a1a2 … an) 1n + ( b1b2 … bn) 1n.这是第 6 4届普特兰数学竞赛中的一道题目 .本文给出该不等式的一个推广 .推广　设 aij >0 ( i =1 ,2 ,… ,m;j=1 ,2 ,… ,n) ,则( ∑mi=1ai1∑mi=1ai2 …∑mi=1ain) 1n ≥ ∑mi=1( ai1ai2 … ain) 1n,等号当且仅当 as1at1=as2at2=… =asnatn( s,t=1 ,2 ,… ,m;s≠ t)时成立 .证明　由平均不等式知 :1na11∑mi=1ai1+ a12∑mi=1ai2+… + a1n∑mi=1ain≥　a11a12 … a1n∑mi=1ai1∑mi=1ai2 …∑mi=1ai…     

A generalized preconditioned HSS method for non-Hermitian positive definite linear systems

Based on the HSS (Hermitian and skew-Hermitian splitting) and preconditioned HSS methods, we will present a generalized preconditioned HSS method for the large sparse non-Hermitian positive definite linear system. Our method is essentially a two-parameter iteration which can extend the possibility to optimize the iterative process. The iterative sequence produced by our generalized preconditioned HSS method can be proven to be convergent to the unique solution of the linear system. An exact parameter region of convergence for the method is strictly proved. A minimum value for the upper bound of the iterative spectrum is derived, which is relevant to the eigensystem of the products formed by inverse preconditioner and splitting. An efficient preconditioner based on incremental unknowns is presented for the actual implementation of the new method. The optimality and efficiency are effectively testified by some comparisons with numerical results.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

求解二维三温能量方程的基于AMG预条件子的Krylov子空间迭代法

本文对一类二维三温能量方程的实际应用问题，建立了一种半粗化的代数多重网格法（SAMG），进而得到了以该SAMG方法为预条件子的Krylov子空间迭代法。数值实验结果表明，该方法对求解二维三温能量方程的实际问题是十分有效和健壮的。     

基于分数阶扩散方程的离散线性代数方程组迭代方法研究

本文构建一类双参数拟Toeplitz分裂（TQTS）迭代方法求解变系数非定常空间分数阶扩散方程.TQTS迭代法是基于QTS迭代法引入双参技术建立而成,通过选取适当的参数使迭代矩阵谱半径变得更小,从而有效提升收敛的速度.然后对TQTS迭代法进行收敛性分析,获得相应的收敛区域,并对迭代法中涉及的参数进行讨论,获得使迭代矩阵谱半径上界达到最小的最优参数的表达式.最后通过数值仿真实验验证TQTS迭代法的有效性,实验结果表明TQTS迭代法改进效果十分突出,在迭代时间和步数上均有明显的减小.     

A convergence analysis of nonlinear implicit iterative method for nonlinear ill-posed problems

Implicit iterative method acquires good effect in solving linear ill-posed problems. We have ever applied the idea of implicit iterative method to solve nonlinear ill-posed problems, under the restriction that α is appropriate large, we proved the monotonicity of iterative error and obtained the convergence and stability of iterative sequence, numerical results show that the implicit iterative method for nonlinear ill-posed problems is efficient. In this paper, we analyze the convergence and stability of the corresponding nonlinear implicit iterative method when α_k are determined by Hanke criterion.     

Monotone iterative sequences for nonlinear boundary value problems of fractional order

In this paper we extend the maximum principle and the method of upper and lower solutions to boundary value problems with the Caputo fractional derivative. We establish positivity and uniqueness results for the problem. We then introduce two well-defined monotone sequences of upper and lower solutions which converge uniformly to the actual solution of the problem. A numerical iterative scheme is introduced to obtain an accurate approximate solution for the problem. The accuracy and efficiency of the new approach are tested through two examples.     

NEWTON迭代法的一个改进

从N EW TON迭代法和中值定理“中值点”的渐近性出发,给出了N EW TON迭代法的一个改进.研究表明,本文定理对于探讨迭代法的改进有着十分重要的作用.     

On Global Convergence and Approximate Iteration of the Linear Approximation Method for Solving Variational Inequalities

This paper is concerned with the linear approximation method (i.e. the iterative method in which a sequence of vectors is generated by solving certain linearized subproblems) for solving the variational inequality. The global convergent iterative process is proposed by applying the continuation method, and the related problems are discussed. A convergent result is obtained for the approximation iteration (i.e. the iterative method in which a sequence of vectors is generated by solving certain linearized subproblems approximately).     

用于求根问题的一个基于Thiele连分式的四阶收敛的迭代方法

利用截断的Thiele连分式,本文给出了一个求解非线性单变量方程的单步迭代方法,并证明了所提出的迭代方法具有四阶收敛性.最后,本文通过一些数值例子说明了所提出的方法的有效性和表现.     

Various Newton-type iterative methods for solving nonlinear equations

The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.