Modified two-grid method for solving coupled Navier-Stokes/Darcy model based on Newton iteration

A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the error estimate is given, which shows that the same order of accuracy can be achieved as solving the system directly in the fine mesh when h = H2. Both theoretical analysis and numerical experiments illustrate the efficiency of the algorithm for solving the coupled problem.

A two-grid algorithm based on Newton iteration for the stream function form of the Navier-Stokes equations

In this paper, we propose a two-grid algorithm for solving the stream function formulation of the stationary Navies-Stokes equations. The algorithm is constructed by reducing the original system to one small, nonlinear system on the coarse mesh space and two similar linear systems （with same stiffness matrix but different right-hand side） on the fine mesh space. The convergence analysis and error estimation of the algorithm are given for the case of conforming elements. Furthermore, the Mgorithm produces a numerical solution with the optimal asymptotic H^2-error. Finally, we give a numerical illustration to demonstrate the effectiveness of the two-grid algorithm for solving the Navier-Stokes equations.

A Novel Method of Newton Iteration in Complex Field and Lattice Search for Locating Partial Discharges in Transformers

在变压器局部放电特高频定位的多传感器时间差测量中不可避免地存在误差,这往往导致时间差方程组在实数域内无解。为了得到时间差方程组的最优近似解,提出了复数域牛顿迭代网格搜索方法。该方法在复数域内进行迭代;当迭代结果为实数时就将其作为定位结果;当迭代结果为复数时,以其实部为中心点坐标,在该点周围局部区域内采用网格搜索法计算最优近似解。通过在变压器上开展试验检验了该方法的可行性和准确性。研究表明,在一定时间误差下,在实数域采用牛顿迭代法计算时不收敛,而在复数域可以收敛,平均定位误差为0.20 m。复数域牛顿迭代网格搜索方法能够在一定时间误差下求解时间差方程组,给出最优近似解,实现局部放电定位。

Non-Linear Localization Algorithm Based on Newton Iterations

In order to improve the performance of time difference of arrival(TDOA)localization,a nonlinear least squares algorithm is proposed in this paper.Firstly,based on the criterion of the minimized sum of square error of time difference of arrival,the location estimation is expressed as an optimal problem of a non-linear programming.Then,an initial point is obtained using the semi-definite programming.And finally,the location is extracted from the local optimal solution acquired by Newton iterations.Simulation results show that when the number of anchor nodes is large,the performance of the proposed algorithm will be significantly better than that of semi-definite programming approach with the increase of measurement noise.

New conditions of stability and convergence of Stokes and Newton iterations for Navier-Stokes equations

This paper considers Stokes and Newton iterations to solve stationary Navier- Stokes equations based on the finite element discretization. We obtain new sufficient conditions of stability and convergence for the two iterations. Specifically, when 0 〈 σ =N｜｜f｜｜-1/v2≤1/√2＋1 , the Stokes iteration is stable and convergent, where N is defined in the paper. When 0 〈 σ ≤5/11, the Newton iteration is stable and convergent. This work gives a more accurate admissible range of data for stability and convergence of the two schemes, which improves the previous results. A numerical test is given to verify the theory.

ANCIENT CHINESE ALGORITHM: THE YING BUZU SHU (METHOD OF SURPLUS AND DEFICIENCY)VS NEWTON ITERATION METHOD

Air exploratory discussion of an ancient Chinese algorithm, the Ying Buzu Shu, in about 2nd century BC, known as the rule of double false position in the West is given. In addition to pointing out that the rule of double false position is actually a translation version of the ancient Chinese algorithm, a comparison with well-known Newton iteration method is also made. If derivative is introduced, the ancient Chinese algorithm reduces to the Newton method. A modification of the ancient Chinese algorithm is also proposed, and some of applications to nonlinear oscillators are illustrated.

New Approach for the Inversion of Structured Matrices via Newton’s Iteration

Newton’s iteration is a fundamental tool for numerical solutions of systems of equations. The well-known iteration ?rapidly refines a crude initial approximation X0?to the inverse of a general nonsingular matrix. In this paper, we will extend and apply this method to n× n?structured matrices M?, in which matrix multiplication has a lower computational cost. These matrices can be represented by their short generators which allow faster computations based on the displacement operators tool. However, the length of the generators is tend to grow and the iterations do not preserve matrix structure. So, the main goal is to control the growth of the length of the short displacement generators so that we can operate with matrices of low rank and carry out the computations much faster. In order to achieve our goal, we will compress the computed approximations to the inverse to yield a superfast algorithm. We will describe two different compression techniques based on the SVD and substitution and we will analyze these approaches. Our main algorithm can be applied to more general classes of structured matrices.

LONG-TERM RIGOROUS NUMERICAL INTEGRATION OF NAVIER-STOKES EQUATION BY NEWTON-GMRES ITERATION

The recent result of an orbit continuation algorithm has provided a rigorous method for long-term numerical integration of an orbit on the unstable manifold of a periodic solution.This algorithm is matrix-free and employs a combination of the Newton-Raphson method and the Krylov subspace method.Moreover,the algorithm adopts a multiple shooting method to address the problem of orbital instability due to long-term numerical integration.The algorithm is described through computing the extension of unstable manifold of a recomputed Nagata′s lowerbranch steady solution of plane Couette flow,which is an example of an exact coherent state that has recently been studied in subcritical transition to turbulence.

基于两步正则化Gauss-Newton迭代算法的ECT图像重建

电容层析成像(ECT)技术求解图像重建问题属于非线性问题,并且存在严重的不适定性。为提高图像重建精度,提出了一种基于两步正则化Gauss-Newton迭代算法的ECT图像重建方法。针对标准正则化Gauss-Newton迭代算法在图像重建中存在的不收敛问题,引入了两步迭代方法;改进了正则化矩阵,提高了解估计的精确度;考虑到Gauss-Newton算法对迭代初值的依赖性,加入了同伦算法。最后,进行仿真和静态实验,并与线性反投影(LBP)算法、Landweber算法、Tikhonov正则化算法进行对比。结果表明,该方法可有效提高图像重建精度。

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.

Parametric Iteration Method for Solving Linear Optimal Control Problems

This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.

A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.

A Newton type iterative method for heat-conduction inverse problems

An inverse problem for identification of the coefficient in heat-conduction equation is considered. After reducing the problem to a nonlinear ill-posed operator equation, Newton type iterative methods are considered. The implicit iterative method is applied to the linearized Newton equation, and the key step in the process is that a new reasonable a posteriori stopping rule for the inner iteration is presented. Numerical experiments for the new method as well as for Tikhonov method and Bakushikskii method are given, and these results show the obvious advantages of the new method over the other ones.

Special Relativity’s “Newtonization” in Complex “Para-Space”: The Two Theories Equivalence Question

Complex model, say C3, of “para-space” as alternative to the real M4 Minkowski space-time for both relativistic and classical mechanics was shortly introduced as reference to our previous works on that subject. The actual aim, however, is an additional analysis of the physical and para-physical phenomena’ behavior as we formally transport observable mechanical phenomena [motion] to non-real interior of the complex domain. As it turns out, such procedure, when properly set, corresponds to transition from relativistic to more classic (or, possibly, just classic) kind of the motion. This procedure, we call the “Newtonization of relativistic physical quantities and phenomena”, first of all, includes the mechanical motion’s characteristics in the C3. The algebraic structure of vector spaces was imposed and analyzed on both: the set of all relativistic velocities and on the set of the corresponding to them “Galilean” velocities. The key point of the analysis is realization that, as a matter of fact, the relativistic theory and the classical are equivalent at least as for the kinematics. This conclusion follows the fact that the two defined structures of topological vector spaces i.e., the structure imposed on sets of all relativistic velocities and the structure on set of all “Galilean” velocities, are both diffeomorphic in their topological parts and are isomorphic as the vector spaces. As for the relativistic theory, the two approaches: the hyperbolic (“classical” SR) with its four-vector formalism and Euclidean, where SR is modeled by the complex para-space C3, were analyzed and compared.

Newton, Halley, Pell and the Optimal Iterative High-Order Rational Approximation of √<span style='margin-left:-2px;margin-right:2px;border-top:1px solid black'>N</span>

In this paper we examine single-step iterative methods for the solution of the nonlinear algebraic equation f (x) = x2 - N = 0 , for some integer N, generating rational approximations p/q that are optimal in the sense of Pell’s equation p2 - Nq2 = k for some integer k, converging either alternatingly or oppositely.

A Nonstationary Halley’s Iteration Method by Using Divided Differences Formula

This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and second orders instead of the derivatives of (1).

Application of He’s Variational Iteration Method for the Analytical Solution of Space Fractional Diffusion Equation

Spatially fractional order diffusion equations are generalizations of classical diffusion equations which are increasingly used in modeling practical super diffusive problems in fluid flow, finance and others areas of application. This paper presents the analytical solutions of the space fractional diffusion equations by variational iteration method (VIM). By using initial conditions, the explicit solutions of the equations have been presented in the closed form. Two examples, the first one is one-dimensional and the second one is two-dimensional fractional diffusion equation, are presented to show the application of the present techniques. The present method performs extremely well in terms of efficiency and simplicity.

A SIGNIFICANT IMPROVEMENT ON NEWTON’S ITERATIVE METHOD

For solving nonlinear and transcendental equation f(x)=0 , a singnificant improvement on Newton's method is proposed in this paper. New “Newton Like” methods are founded on the basis of Liapunov's methods of dynamic system. These new methods preserve quadratic convergence and computational efficiency of Newton's method, and remove the monotoneity condition imposed on f(x):f′(x)≠0 .

On the Deepest Fallacy in the History of Mathematics: The Denial of the Postulate about the Approximation Nature of a Simple-Iteration Method and Iterative Derivation of Cramer’s Formulas

Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonstrated. We present a theorem and its proof that confirms the possibility to obtain the finite process and imposes the requirement for the matrix of SLAE. This matrix must be unipotent, i.e. all its eigenvalues to be equal to 1. An example of transformation of SLAE given analytically to the form with a unipotent matrix is presented. It is shown that splitting the unipotent matrix into identity and nilpotent ones results in Cramer’s analytical formulas in a finite number of iterations.

A Comparative Study of Variational Iteration Method and He-Laplace Method

In this paper, variational iteration method and He-Laplace method are used to solve the nonlinear ordinary and partial differential equations. Laplace transformation with the homotopy perturbation method is called He-Laplace method. A comparison is made among variational iteration method and He-Laplace. It is shown that, in He-Laplace method, the nonlinear terms of differential equation can be easily handled by the use of He’s polynomials and provides better results.