求动点轨迹方程最简捷的四种方法

求符合某种条件的动点轨迹方程，实际上就是利用已知的点的坐标之间的运动规律去寻找变量间的关系.求轨迹方程的常规思路，就是想方设法地把题目中的几何问题转化为代数方程问题来解决.     

求复数模的最值的常用策略

复数的模是复数中的重要概念之一 ,复数ｚ的模 |ｚ|是其对应点Ｚ到原点的距离 (复数模的几何意义 ) .复数模的最值问题既是复数问题中的一个重点 ,也是一个难点 .其最常用的策略有 :用函数思想、方程思想可将问题转化为代数法或三角法 ,用数形结合思想可将问题转化为几何法 ,用重要的不等式公式可将问题转化为不等式法 .下面我们就来分别举例说明这几种策略 .1　用代数法求最值用代数法求复数模的最值 ,在这里是指把问题转化为求代数中的最值问题来解决 .例 1　已知复数ｚ满足 |ｚ - (2 + 3ｉ) | + |ｚ -(2 - 3ｉ) | =4 ,试求 |ｚ|的最值 .…     

USSOR优于SOR,SSOR的收敛区域

对于SSOR与SOR的渐近收敛速度的比较,有下面的一些结果。 (a)当A为非奇异的M-矩阵,Woznicki[1]证明了,ρ(S_w~A)≤户((?)_w~A)<1,(?)ω∈(0,1)且(?)V=卢(B~A)∈(0,1)。 (b)当A为3—循环不可约的H—矩阵,Neumann[2]证明了,对每个(?):=卢(|B~A|)∈(0,r_3),r_3≈0.418192802是方程17r~3+r~3—r—1=0在区间(0,1)内的唯一正根,则存在ω(A)=2/(1+(?))的一个邻域Ω_(w(a)),满足     

投入产出技术在计划平衡中的理论与应用

在用投入产出技术作计划平衡时，目前一般采用最终产品法、总产品法及国民收入法等．本文从理论上研究了这些方法的可行性问题，并在此基础上提出一个较理想的综合法．最后附有实例并说明综合法的现实意义．     

正项级数敛散性的一个判别法

基于正项级数的比较判别法和p-级数的敛散性,给出一个与D’Alembert判别法和Cauchy判别法平行的判别正项级数敛散性的方法.并通过实例对所给判别法的可行性进行检验,发现它是已有方法的一个有效补充.     

谈谈5在运算中的规律

众所周知，5是123456789九个自然数中的一个，排行第5，无论是顺数还是倒数，5的位置总是居中，因此5乘任意数的积．就是任意数减一半，任意数除5的商，就是任意数本身加一半，不用计算，一目了然。故有妙算“折半法”的美称。笔者出于好奇的心理，把5在运算中的一些规律，加以整理，介绍给大家。     

浅谈数学辅导课的教学

数学辅导课无疑是数学教学的一个重要环节。因此,如何搞好数学辅导课的教学,这是广大教师普遍关心的一个热门话题。数学辅导课除用于根据课堂教学、作业评改、师生谈心等反馈渠道获取的信息对学生作必要的全体纠误、部分矫枉、个别面批以外,大可不必把它作为课     

一个无理不等式的简证及推广

<正>题目已知a,b∈R⁺,且a+b=1,求证:（a²+1）^1/2+（b²+1）^1/2≥5^1/2.《中学数学》《中学数学教学参考》等数学杂志曾用放缩法、几何法、向量法、不等式法等十多种方法对此题作了精彩证明,读后令人折     

二次函数涉面积 构线辅助巧转化

与二次函数相关的综合性解答题已是各省、市中考数学的必考题型,特别是涉及到几何图形面积最值的问题,是难点,也是易错点.本文中以如何构造辅助线转化问题为导向,详细介绍了铅垂高法、平行线法、割补形法、三角函数法这四种解决二次函数面积最大值问题的方法,使复杂问题简单化,从而为渗透数学思想、发展核心素养奠定基础.     

新的辅助方程法构造KdV方程的行波解

应用一种新的辅助方程法成功地获得了(1+1)维KdV方程的多个含有参数的精确行波解,所得的解涵盖了已有结果．与其它方法相比,所给出的方法具有简单高效、计算量小、速度快、易于求解等特点．另外,所给的方法还可以用来求解其它的一大类非线性发展方程的精确行波解．     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

Rational Krylov for Nonlinear Eigenproblems,an Iterative Projection Method

In recent papers Ruhe suggested a rational Krylov method for nonlinear eigenproblems knitting together a secant method for linearizing the nonlinear problem and the Krylov method for the linearized problem. In this note we point out that the method can be understood as an iterative projection method. Similarly to the Arnoldi method the search space is expanded by the direction from residual inverse iteration. Numerical methods demonstrate that the rational Krylov method can be accelerated considerably by replacing an inner iteration by an explicit solver of projected problems.     

求解一类非线性方程的改进的平均法

本文研究确定非线性方程一致有效近似解的平均法,得到B方法(Krylov-Bogoliubov method)与KBM方法(Krylov-Bogoliubov-Mitropolski method)的改进形式,通过两个例子与多尺度方法的比较,说明改进的平均法的有效性,从而拓广了平均法的应用范围。     

Accelerated hybrid and shrinking projection methods for variational inequality problems

ABSTRACT

In this paper, we introduce several new extragradient-like approximation methods for solving variational inequalities in Hilbert spaces. Our algorithms are based on Tseng's extragradient method, subgradient extragradient method, inertial method, hybrid projection method and shrinking projection method. Strong convergence theorems are established under appropriate conditions. Our results extend and improve some related results in the literature. In addition, the efficiency of our algorithms is shown through numerical examples which are defined by the hybrid projection methods.     

H least-squares method for the velocity–pressure–stress formulation of Stokes equations

This paper studies the discrete H⁻¹-norm least-squares method for the incompressible Stokes equations based on the velocity–pressure–stress formulation by the least-squares functional defined as the sum of L²-norms and H⁻¹-norm of the residual equations. Some computational experiments by multigrid method and preconditioning conjugate gradient method (PCGM) on this method are shown by taking efficient and β in the discrete solution operator T_h=h²I+βB_h corresponding to the minus one norm. We also propose a new method and compare it with PCGM and multigrid method through the analysis of numerical experiments depending on the choice of β.     

The Runge‐Kutta DG finite element method and the KFVS scheme for compressible flow simulations

This article presents a new type of second‐order scheme for solving the system of Euler equations, which combines the Runge‐Kutta discontinuous Galerkin (DG) finite element method and the kinetic flux vector splitting (KFVS) scheme. We first discretize the Euler equations in space with the DG method and then the resulting system from the method‐of‐lines approach will be discretized using a Runge‐Kutta method. Finally, a second‐order KFVS method is used to construct the numerical flux. The proposed scheme preserves the main advantages of the DG finite element method including its flexibility in handling irregular solution domains and in parallelization. The efficiency and effectiveness of the proposed method are illustrated by several numerical examples in one‐ and two‐dimensional spaces. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A LOCAL MULTILEVEL PRECONDITIONER FOR THE ADAPTIVE MORTAR FINITE ELEMENT METHOD＊

In this paper, we propose a local multilevel preconditioner for the mortar finite element approximations of the elliptic problems. With some mesh assumptions on the interface, we prove that the condition number of the preconditioned systems is independent of the large jump of the coefficients but depends on the mesh levels around the cross points. Some numericM experiments are presented to confirm our theoreticM results.     

An Analogue-difference Method and Application to Induction Motor Models

The paper established a so-called analogue-difference method (ADM) to compute the numerical solutions for boundary value problems of higher-order differential equations, which can be a fundamental method and performs much better than the finite difference method (FDM), even for second-order boundary value problems. Numerical examples and results illustrate the simplicity, efficiency and applicability of the method, which also show that the proposed method has obvious advantages over the methods presented by recent state-of-the-art work for induction motor models.