A computational method for large‐scale differential symmetric Stein equation

We propose a numerical method for solving large‐scale differential symmetric Stein equations having low‐rank right constant term. Our approach is based on projection the given problem onto a Krylov subspace then solving the low dimensional matrix problem by using an integration method, and the original problem solution is built by using obtained low‐rank approximate solution. Using the extended block Arnoldi process and backward differentiation formula (BDF), we give statements of the approximate solution and corresponding residual. Some numerical results are given to show the efficiency of the proposed method.     

A modified variable time step method for solving ice melting problem

A modified numerical method was used by authors for solving 1D Stefan problem. In this paper a modified method is proposed with difference formulae and different methods of calculating the variable time step, which are deduced from Taylor series expansions of different conditions at the boundary. Also an extrapolation formula for the solution at the first point at the right of the computational domain is proposed. The numerical results are compared with those obtained from other methods.     

Numerical scheme for solving system of fractional partial differential equations with Volterra‐type integral term through two‐dimensional block‐pulse functions

In the current study, an approximate scheme is established for solving the fractional partial differential equations (FPDEs) with Volterra integral terms via two‐dimensional block‐pulse functions (2D‐BPFs). According to the definitions and properties of 2D‐BPFs, the original problem is transformed into a system of linear algebra equations. By dispersing the unknown variables for these algebraic equations, the numerical solutions can be obtained. Besides, the proof of the convergence of this system is given. Finally, several numerical experiments are presented to test the feasibility and effectiveness of the proposed method.     

Uzawa methods for a class of block three‐by‐three saddle‐point problems

In this work, we consider numerical methods for solving a class of block three‐by‐three saddle‐point problems, which arise from finite element methods for solving time‐dependent Maxwell equations and some other applications. The direct extension of the Uzawa method for solving this block three‐by‐three saddle‐point problem requires the exact solution of a symmetric indefinite system of linear equations at each step. To avoid heavy computations at each step, we propose an inexact Uzawa method, which solves the symmetric indefinite linear system in some inexact way. Under suitable assumptions, we show that the inexact Uzawa method converges to the unique solution of the saddle‐point problem within the approximation level. Two special algorithms are customized for the inexact Uzawa method combining the splitting iteration method and a preconditioning technique, respectively. Numerical experiments are presented, which demonstrated the usefulness of the inexact Uzawa method and the two customized algorithms.     

A Jacobi–Davidson method for two‐real‐parameter nonlinear eigenvalue problems arising from delay‐differential equations

The critical delays of a delay‐differential equation can be computed by solving a nonlinear two‐parameter eigenvalue problem. The solution of this two‐parameter problem can be translated to solving a quadratic eigenvalue problem of squared dimension. We present a structure preserving QR‐type method for solving such quadratic eigenvalue problem that only computes real‐valued critical delays; that is, complex critical delays, which have no physical meaning, are discarded. For large‐scale problems, we propose new correction equations for a Newton‐type or Jacobi–Davidson style method, which also forces real‐valued critical delays. We present three different equations: one real‐valued equation using a direct linear system solver, one complex valued equation using a direct linear system solver, and one Jacobi–Davidson style correction equation that is suitable for an iterative linear system solver. We show numerical examples for large‐scale problems arising from PDEs. Copyright © 2012 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.     

A linearization‐based approach of homotopy analysis method for non‐linear time‐fractional parabolic PDEs

In this paper, a novel approach, namely, the linearization‐based approach of homotopy analysis method, to analytically treat non‐linear time‐fractional PDEs is proposed. The presented approach suggests a new optimized structure of the homotopy series solution based on a linear approximation of the non‐linear problem. A comparative study between the proposed approach and standard homotopy analysis approach is illustrated by solving two examples involving non‐linear time‐fractional parabolic PDEs. The performed numerical simulations demonstrate that the linearization‐based approach reduces the computational complexity and improves the performance of the homotopy analysis method.     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems

In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low‐dimensional differential Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.     

Numerical solution of two‐dimensional parabolic equation subject to nonstandard boundary specifications using the pseudospectral Legendre method

In this research, the problem of solving the two‐dimensional parabolic equation subject to a given initial condition and nonlocal boundary specifications is considered. A technique based on the pseudospectral Legendre method is proposed for the numerical solution of the studied problem. Several examples are given and the numerical results are shown to demonstrate the efficiently of the newly proposed method. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.     

On an optimal method for solving an inverse Stefan problem

An algorithm optimal in order is proposed for solving an inverse Stefan problem. We also give some exact estimates of accuracy of this method.     

A new Taylor collocation method for nonlinear Fredholm‐Volterra integro‐differential equations

The aim of this article is to present an efficient numerical procedure for solving nonlinear integro‐differential equations. Our method depends mainly on a Taylor expansion approach. This method transforms the integro‐differential equation and the given conditions into the matrix equation which corresponds to a system of nonlinear algebraic equations with unkown Taylor coefficients. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer program written in Maple10. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

New implementation of radial basis functions for solving Burgers‐Fisher equation

In this article, we consider the problem of solving Burgers‐Fisher equation. The approximate solution is found using the radial basis functions collocation method. Also for solving of the resulted nonlinear system of equations, we proposed a predictor corrector method based on the fixed point iterations. The numerical tests show that this method is accurate and efficient for finding a closed form approximation of the solution of nonlinear partial differential equations. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 248–262, 2012     

Numerical solution of the one phase 1D fractional Stefan problem using the front fixing method

In this paper, we present a novel numerical scheme to solve a 1D, one‐phase extended Stefan problem with fractional Caputo derivative with respect to time. The proposed method is based on a suitable choice of the new space coordinate for the subdiffusion equation and extends the front‐fixing method to the subdiffusion case. In the final part, examples of numerical results are discussed. Copyright © 2014 John Wiley & Sons, Ltd.     

Numerical solution of a multidimensional two-phase stefan problem

This paper treats a multidimensional two-phase Stefan problem with variable coefficients and mixed type boundary conditions. A numerical method for solving the problem is of fixed domain type, based on a variational inequality formulation of the problem. Numerical solutions are obtained by using piecewise linear finite elements in space and finite difference in time, and by solving a strictly convex minimization problem at each time step. Some computational results are presented.     

A two‐grid stabilization method for solving the steady‐state Navier‐Stokes equations

We formulate a subgrid eddy viscosity method for solving the steady‐state incompressible flow problem. The eddy viscosity does not act on the large flow structures. Optimal error estimates are obtained for velocity and pressure. The numerical illustrations agree completely with the theoretical results. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Solving nonlocal initial‐boundary value problems for parabolic and hyperbolic integro‐differential equations in reproducing kernel hilbert space

This article is concerned with a method for solving nonlocal initial‐boundary value problems for parabolic and hyperbolic integro‐differential equations in reproducing kernel Hilbert space. Convergence of the proposed method is studied under some hypotheses which provide the theoretical basis of the proposed method and some error estimates for the numerical approximation in reproducing kernel Hilbert space are presented. Finally, two numerical examples are considered to illustrate the computation efficiency and accuracy of the proposed method. © 2016 The Authors Numerical Methods for Partial Differential Equations Published by Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 174–198, 2017     

A three‐level linearized finite difference scheme for the camassa–holm equation

The Camassa–Holm (CH) system is a strong nonlinear third‐order evolution equation. So far, the numerical methods for solving this problem are only a few. This article deals with the finite difference solution to the CH equation. A three‐level linearized finite difference scheme is derived. The scheme is proved to be conservative, uniquely solvable, and conditionally second‐order convergent in both time and space in the discrete L_∞ norm. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 451–471, 2014