含高次逆幂的矩阵方程对称解的双迭代算法

本文研究了在控制理论和随机滤波等领域中遇到的一类含高次逆幂的矩阵方程的等价矩阵方程对称解的数值计算问题.采用牛顿算法求等价矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立了求这类矩阵方程对称解的双迭代算法,数值算例验证了双迭代算法是有效的.     

A modified Newton direction for unconstrained optimization

In this article, a modification on Newton's direction for solving problems of unconstrained optimization is presented. As it is known, a major disadvantage of Newton's method is its slowness or non-convergence for the initial point not being close to optima's neighbourhood. The proposed method generally guarantees the decrement of the norm of the gradient or the value of the objective function at every iteration, contributing to the efficiency of Newton's method. The quadratic convergence of the proposed iterative scheme and the enlargement of the radius of convergence area are proved. The proposed algorithm has been implemented and tested on several well-known test functions.     

一类Riccati矩阵方程广义自反解的双迭代算法

本文研究了一类Riccati矩阵方程广义自反解的数值计算问题.利用牛顿算法将Riccati矩阵方程的广义自反解问题转化为线性矩阵方程的广义自反解或者广义自反最小二乘解问题,再利用修正共轭梯度法计算后一问题,获得了求Riccati矩阵方程的广义自反解的双迭代算法.拓宽了求解非线性矩阵方程的迭代算法.数值算例表明双迭代算法是有效的.     

Iterative operator‐splitting methods for nonlinear differential equations and applications

In this article, we consider iterative operator‐splitting methods for nonlinear differential equations with bounded and unbounded operators. The main feature of the proposed idea is the embedding of Newton's method for solving the split parts of the nonlinear equation at each step. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator‐splitting methods by providing improved results and convergence rates. We apply our results to deposition processes. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1026–1054, 2011     

On a Newton-Kurchatov-type Iterative Process

Newton's method and Kurchatov's method are iterative processes known for their fast speed of convergence. We construct from both methods an iterative method to approximate solutions of nonlinear equations given by a nondifferentiable operator, and we study its semilocal convergence in Banach spaces. Finally, we consider several applications of this new iterative process.     

A Parameterized Class of Complex Nonsymmetric Algebraic Riccati Equations

In this paper, by introducing a definition of parameterized comparison matrix of a given complex square matrix, the solvability of a parameterized class of complex nonsymmetric algebraic Riccati equations (NAREs) is discussed. The existence and uniqueness of the extremal solutions of the NAREs is proved. Some classical numerical methods can be applied to compute the extremal solutions of the NAREs, mainly including the Schur method, the basic fixed-point iterative methods, Newton's method and the doubling algorithms. Furthermore, the linear convergence of the basic fixed-point iterative methods and the quadratic convergence of Newton's method and the doubling algorithms are also shown. Moreover, some concrete parameter selection strategies in complex number field for the doubling algorithms are also given. Numerical experiments demonstrate that our numerical methods are effective.     

An efficient method for fractional nonlinear differential equations by quasi‐Newton's method and simplified reproducing kernel method

An efficient method for nonlinear fractional differential equations is proposed in this paper. This method consists of 2 steps. First, we linearize the nonlinear operator equation by quasi‐Newton's method, which is based on Fréchet derivative. Then we solve the linear fractional differential equations by the simplified reproducing kernel method. The convergence of the quasi‐Newton's method is discussed for the general nonlinear case as well. Finally, some numerical examples are presented to illustrate accuracy, efficiency, and simplicity of the method.     

Kepler equation and accelerated Newton method

We study the efficiency of the accelerated Newton method (Garlach, SIAM Rev. 36 (1994) 272–276) for several orders of convergence versus Danby's method for the resolution of Kepler's equation; we find that the cited method of order three is competitive with Danby's method and the classical Newton's method. We also generalize the accelerated Newton method for the resolution of system of algebraic equations, obtaining a formula of order three and a proof of its convergence; its application to several examples shows that its efficiency is greater than Newton's method.     

Collocation method with Lagrange polynomials for variable-order time-fractional advection–diffusion problems

In this study, we proposed a numerical technique to solve a class of variable-order time-fractional advection–diffusion equations (VOTFADEs) by applying an operational matrix of differentiation based on fractional-order Lagrange polynomials (FOLPs). The variable-order fractional derivative is assumed to be Caputo's derivative. Using the operational matrix and collocation method, the advection–diffusion equation can be reduced to an algebraic system of equations that can be solved using Newton's iterative method. Error analysis also has been carried out for the proposed method. The current approach is simple to use and computer oriented and provides highly accurate approximate solutions. The effectiveness and accuracy of the proposed method are demonstrated using a few numerical examples.     

Numerical solution of nonlinear stochastic Itô‐Volterra integral equations driven by fractional Brownian motion

In this paper, an efficient numerical technique is applied to provide the approximate solution of nonlinear stochastic Itô‐Volterra integral equations driven by fractional Brownian motion with Hurst parameter . The proposed method is based on the operational matrices of modification of hat functions (MHFs) and the collocation method. In this approach, by approximating functions that appear in the integral equation by MHFs and using Newton's‐Cotes points, nonlinear integral equation is transformed to nonlinear system of algebraic equations. This nonlinear system is solved by using Newton's numerical method, and the approximate solution of integral equation is achieved. Some theorems related to error estimate and convergence analysis of the suggested scheme are also established. Finally, 2 illustrative examples are included to confirm applicability, efficiency, and accuracy of the proposed method. It should be noted that this scheme can be used to solve other appropriate problems, but some modifications are required.     

Mesh‐independent convergence of the modified inexact Newton method for a second order non‐linear problem

In this paper, we consider an inexact Newton method applied to a second order non‐linear problem with higher order non‐linearities. We provide conditions under which the method has a mesh‐independent rate of convergence. To do this, we are required, first, to set up the problem on a scale of Hilbert spaces and second, to devise a special iterative technique which converges in a higher than first order Sobolev norm. We show that the linear (Jacobian) system solved in Newton's method can be replaced with one iterative step provided that the initial non‐linear iterate is accurate enough. The closeness criteria can be taken independent of the mesh size. Finally, the results of numerical experiments are given to support the theory. Published in 2005 by John Wiley & Sons, Ltd.     

Numerical solution of nonlinear partial quadratic integro‐differential equations of fractional order via hybrid of block‐pulse and parabolic functions

In this paper, an effective numerical approach based on a new two‐dimensional hybrid of parabolic and block‐pulse functions (2D‐PBPFs) is presented for solving nonlinear partial quadratic integro‐differential equations of fractional order. Our approach is based on 2D‐PBPFs operational matrix method together with the fractional integral operator, described in the Riemann–Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations, which greatly simplifies the problem. By using Newton's iterative method, this system is solved, and the solution of fractional nonlinear partial quadratic integro‐differential equations is achieved. Convergence analysis and an error estimate associated with the proposed method is obtained, and it is proved that the numerical convergence order of the suggested numerical method is O(h³) . The validity and applicability of the method are demonstrated by solving three numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the exact solutions much easier.     

Bivariate spline method for numerical solution of steady state Navier–Stokes equations over polygons in stream function formulation

We use the bivariate spline finite elements to numerically solve the steady state Navier–Stokes equations. The bivariate spline finite element space we use in this article is the space of splines of smoothness r and degree 3r over triangulated quadrangulations. The stream function formulation for the steady state Navier–Stokes equations is employed. Galerkin's method is applied to the resulting nonlinear fourth‐order equation, and Newton's iterative method is then used to solve the resulting nonlinear system. We show the existence and uniqueness of the weak solution in H²(Ω) of the nonlinear fourth‐order problem and give an estimate of how fast the numerical solution converges to the weak solution. The Galerkin method with C¹ cubic splines is implemented in MATLAB. Our numerical experiments show that the method is effective and efficient. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 147–183, 2000     

Fractional Crank–Nicolson–Galerkin finite element scheme for the time‐fractional nonlinear diffusion equation

This article presents a finite element scheme with Newton's method for solving the time‐fractional nonlinear diffusion equation. For time discretization, we use the fractional Crank–Nicolson scheme based on backward Euler convolution quadrature. We discuss the existence‐uniqueness results for the fully discrete problem. A new discrete fractional Gronwall type inequality for the backward Euler convolution quadrature is established. A priori error estimate for the fully discrete problem in L²(Ω) norm is derived. Numerical results based on finite element scheme are provided to validate theoretical estimates on time‐fractional nonlinear Fisher equation and Huxley equation.     

A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming

ABSTRACT

In this note, we consider three types of problems, H-weighted nearest correlation matrix problem and two types of important doubly non-negative semidefinite programming, derived from the binary integer quadratic programming and maximum cut problem. The dual of these three types of problems is a 3-block separable convex optimization problem with a coupling linear equation constraint. It is known that, the directly extended 3-block alternating direction method of multipliers (ADMM3d) is more efficient than many of its variants for solving these convex optimization, but its convergence is not guaranteed. By choosing initial points properly, we obtain the convergence of ADMM3d for solving the dual of these three types of problems. Furthermore, we simplify the iterative scheme of ADMM3d and show the equivalence of ADMM3d to the 2-block semi-proximal ADMM for solving the dual's reformulation, under these initial conditions.     

Leap-frogging Newton's method

Using Newton's method as an intermediate step, we introduce an iterative method that approximates numerically the solution of f (x) = 0. The method is essentially a leap-frog Newton's method. The order of convergence of the proposed method at a simple root is cubic and the computational efficiency in general is less, but close to that of Newton's method. Like Newton's method, the new method requires only function and first derivative evaluations. The method can easily be implemented on computer algebra systems where high machine precision is available.     

A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing

In this paper, we present a new algorithm to accelerate the Chambolle gradient projection method for total variation image restoration. The new proposed method considers an approximation of the Hessian based on the secant equation. Combined with the quasi‐Cauchy equations and diagonal updating, we can obtain a positive definite diagonal matrix. In the proposed minimization method model, we use the positive definite diagonal matrix instead of the constant time stepsize in Chambolle's method. The global convergence of the proposed scheme is proved. Some numerical results illustrate the efficiency of this method. Moreover, we also extend the quasi‐Newton diagonal updating method to solve nonlinear systems of monotone equations. Performance comparisons show that the proposed method is efficient. A practical application of the monotone equations is shown and tested on sparse signal reconstruction in compressed sensing. Copyright © 2015 John Wiley & Sons, Ltd.     

Error estimate and regularity for the compressible Navier‐Stokes equations by Newton's method

The finite element discretization error estimate and H¹ regularity are shown for the solution generated by Newton's method to the stationary compressible Navier‐Stokes equations by interpreting Newton's method as an equivalent iterative method. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 511–524, 2003     

Bivariate spline method for numerical solution of time evolution Navier‐Stokes equations over polygons in stream function formulation

We use a bivariate spline method to solve the time evolution Navier‐Stokes equations numerically. The bivariate splines we use in this article are in the spline space of smoothness r and degree 3r over triangulated quadrangulations. The stream function formulation for the Navier‐Stokes equations is employed. Galerkin's method is applied to discretize the space variables of the nonlinear fourth‐order equation, Crank‐Nicholson's method is applied to discretize the time variable, and Newton's iterative method is then used to solve the resulting nonlinear system. We show the existence and uniqueness of the weak solution in L₂(0, T; H²(Ω)) ∩ L_∞(0, T; H¹(Ω)) of the 2D nonlinear fourth‐order problem and give an estimate of how fast the numerical solution converges to the weak solution. The C¹ cubic splines are implemented in MATLAB for solving the Navier‐Stokes equations numerically. Our numerical experiments show that the method is effective and efficient. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 776–827, 2003.