A fast numerical method for solving coupled Burgers' equations

A new fast numerical scheme is proposed for solving time‐dependent coupled Burgers' equations. The idea of operator splitting is used to decompose the original problem into nonlinear pure convection subproblems and diffusion subproblems at each time step. Using Taylor's expansion, the nonlinearity in convection subproblems is explicitly treated by resolving a linear convection system with artificial inflow boundary conditions that can be independently solved. A multistep technique is proposed to rescue the possible instability caused by the explicit treatment of the convection system. Meanwhile, the diffusion subproblems are always self‐adjoint and coercive at each time step, and they can be efficiently solved by some existing preconditioned iterative solvers like the preconditioned conjugate galerkin method, and so forth. With the help of finite element discretization, all the major stiffness matrices remain invariant during the time marching process, which makes the present approach extremely fast for the time‐dependent nonlinear problems. Finally, several numerical examples are performed to verify the stability, convergence and performance of the new method.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1823–1838, 2017     

An efficient predictor-corrector method for solving nonlinear equations

This paper proposes an efficient continuation method for solving nonlinear equations. The proposed method belongs to a class of predictor-corrector methods and uses modified Euler's predictors in order that larger step-sizes may be accepted. Some numerical results show that the method obtains a solution with less computational effort than the ordinary Euler's method, especially when the starting point is far from the solution.     

A decoupling two-grid method for the time-dependent Poisson-Nernst-Planck equations

Numerical Algorithms - We study a two-grid strategy for decoupling the time-dependent Poisson-Nernst-Planck equations describing the mass concentration of ions and the electrostatic potential. The...     

A Kantorovich-type analysis for a fast iterative method for solving nonlinear equations

We revisit a fast iterative method studied by us in [I.K. Argyros, On a two-point Newton-like method of convergent order two, Int. J. Comput. Math. 88 (2) (2005) 219-234] to approximate solutions of nonlinear operator equations. The method uses only divided differences of order one and two function evaluations per step. This time we use a simpler Kantorovich-type analysis to establish the quadratic convergence of the method in the local as well as the semilocal case. Moreover we show that in some cases our method compares favorably, and can be used in cases where other methods using similar information cannot [S. Amat, S. Busquier, V.F. Candela, A class of quasi-Newton generalized Steffensen's methods on Banach spaces, J. Comput. Appl. Math. 149 (2) (2002) 397-406; D. Chen, On the convergence of a class of generalized Steffensen's iterative procedures and error analysis, Int. J. Comput. Math. 31 (1989) 195-203]. Numerical examples are provided to justify the theoretical results.     

A two-grid discretization method for decoupling systems of partial differential equations

In this paper, we propose a two-grid finite element method for solving coupled partial differential equations, e.g., the Schrödinger-type equation. With this method, the solution of the coupled equations on a fine grid is reduced to the solution of coupled equations on a much coarser grid together with the solution of decoupled equations on the fine grid. It is shown, both theoretically and numerically, that the resulting solution still achieves asymptotically optimal accuracy.

     

A two-grid method with expanded mixed element for nonlinear reaction-diffusion equations

Expanded mixed finite element approximation of nonlinear reaction-diffusion equations is discussed. The equations considered here are used to model the hydrologic and bio-geochemical phenomena. To linearize the mixed-method equations, we use a two-grid method involving a small nonlinear system on a coarse gird of size H and a linear system on a fine grid of size h. Error estimates are derived which demonstrate that the error is O(△t + h k+1 + H 2k+2 d/2 ) (k ≥ 1), where k is the degree of the approximating space for the primary variable and d is the spatial dimension. The above estimates are useful for determining an appropriate H for the coarse grid problems.     

An efficient method for solving difference systems for elliptic differential equations

A method for solving systems of linear algebraic equations arising in connection with the approximation of boundary value problems for elliptic partial differential equations is proposed. This method belongs to the class of conjugate directions method applied to a preliminary transformed system of equations. A model example is used to explain the idea underlying this method and to investigate it. Results of numerical experiments that confirm the method’s efficiency are discussed.     

A systematic method for solving differential-difference equations

A systematic method for searching travelling-wave solutions to differential-difference equations (DDEs) is proposed in the paper. First of all, we introduce Bäcklund transformations for the standard Riccati equation which generate new exact solutions by using its simple and known solutions. Then we introduce a kind of formal polynomial solutions to DDEs and further determine the explicit forms by applying the balance principle. Finally, we work out exact solutions of the DDEs via substituting the form solutions and solving over-determined algebraic equations with the help of Maple. As illustrative examples, we obtain the travelling-wave solutions of the (2 + 1)-dimensional Toda lattice equation, the discrete modified KdV (mKdV) equation, respectively.     

A direct method for solving integral equations

In this paper we theoretically justify the Bogolyubov-Krylov method for weakly singular integral equations.     

A fast Fourier-Galerkin method for solving integral equations of second kind with weakly singular kernels

We propose in this paper a convenient way to compress the dense matrix representation of a compact integral operator with a weakly singular kernel under the Fourier basis. This compression leads to a sparse matrix with only ${\mathcal{O}}(n\log n)$ number of nonzero entries, where 2n+1 denotes the order of the matrix. Based on this compression strategy, we develop a fast Fourier-Galerkin method for solving second kind integral equations with weakly singular kernels. We prove that the approximate order of the truncated equation remains optimal and that the spectral condition number of the coefficient matrix of the truncated linear system is uniformly bounded. Furthermore, we develop a fast algorithm for solving the corresponding truncated linear system, which preserves the optimal order of the approximate solution with only ${\mathcal{O}}(n\log^{2}n)$ number of multiplications required. Numerical examples complete the paper.     

A fast Fourier-Galerkin method solving boundary integral equations for the Helmholtz equation with exponential convergence

Numerical Algorithms - A boundary integral equation in general form will be considered, which can be used to solve Dirichlet problems for the Helmholtz equation. The goal of this paper is to...     

A fast sweeping method for Eikonal equations

In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics of the corresponding Eikonal equation in a certain direction simultaneously. The method has an optimal complexity of for grid points and is extremely simple to implement in any number of dimensions. Monotonicity and stability properties of the fast sweeping algorithm are proven. Convergence and error estimates of the algorithm for computing the distance function is studied in detail. It is shown that Gauss-Seidel iterations is enough for the distance function in dimensions. An estimation of the number of iterations for general Eikonal equations is also studied. Numerical examples are used to verify the analysis.

     

A two-grid method for finite volume element approximations of second-order nonlinear hyperbolic equations

The two-grid method is studied for solving a two-dimensional second-order nonlinear hyperbolic equation using finite volume element method. The method is based on two different finite element spaces defined on one coarse grid with grid size H and one fine grid with grid size h, respectively. The nonsymmetric and nonlinear iterations are only executed on the coarse grid and the fine grid solution can be obtained in a single symmetric and linear step. It is proved that the coarse grid can be much coarser than the fine grid. A prior error estimate in the H¹-norm is proved to be O(h+H³|lnH|) for the two-grid semidiscrete finite volume element method. With these proposed techniques, solving such a large class of second-order nonlinear hyperbolic equations will not be much more difficult than solving one single linearized equation. Finally, a numerical example is presented to validate the usefulness and efficiency of the method.     

A homotopy continuation method for solving normal equations

In this paper, we present a continuation method for solving normal equations generated byC ² functions and polyhedral convex sets. We embed the normal map into a homotopyH, and study the existence and characteristics of curves inH ¹(0) starting at a specificd point. We prove the convergence of such curves to a solution of the normal equation under some conditions on the polyhedral convex setC and the functionf. We prove that the curve will have finite are length if the normal map, associated with the derivative df(·) and the critical coneK, is coherently oriented at each zero of the normal mapf _c inside a certain ball of ⁿ . © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.This research was performed at the Department of Industrial Engineering, University of Wisconsin-Madison, Madison, WI, USA.     

A Laplace-like method for solving linear difference equations

This paper is concerned with the problem of solving linear difference equations of ordern with constant coefficients and with given initial conditions in which the variable runs not only through the integers but over . The main idea is the introduction of a suitable commutative ring of functions with discrete convolution as multiplication rule which works, although it is not a field. The existence of inverses is studied and, after the introduction of suitable functions, the problem is reduced by means of a Laplace-like relation to an algebraic equation. Examples of application are given. Finally some remarks make the connection with the Operational Calculus of Mikusinski and with the Operational Calculus of Fenyö. The advantages of this method lie in the fact that it is applicable to functions others than the step functions, in its simplicity from the theoretical point of view, in its usefulness even when computation is required and in its formal similarity to the classical treatment of linear differential equations with constant coefficients.     

求解非光滑方程组的三次正则化方法

考虑求解非光滑方程组的三次正则化方法及其收敛性分析.利用信赖域方法的技巧,保证该方法是全局收敛的.在子问题非精确求解和BD正则性条件成立的前提下,分析了非光滑三次正则化方法的局部收敛速度.最后,数值实验结果验证了该算法的有效性.