Jacobi rational approximation and spectral method for differential equations of degenerate type

We introduce an orthogonal system on the half line, induced by Jacobi polynomials. Some results on the Jacobi rational approximation are established, which play important roles in designing and analyzing the Jacobi rational spectral method for various differential equations, with the coefficients degenerating at certain points and growing up at infinity. The Jacobi rational spectral method is proposed for a model problem appearing frequently in finance. Its convergence is proved. Numerical results demonstrate the efficiency of this new approach.

     

A rational approximation and its applications to nonlinear partial differential equations on the whole line

An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach.     

Newton iteration for partial differential equations and the approximation of the identity

It is known that the critical condition which guarantees quadratic convergence of approximate Newton methods is an approximation of the identity condition. This requires that the composition of the numerical inversion of the Fréchet derivative with the derivative itself approximate the identity to an accuracy calibrated by the residual. For example, the celebrated quadratic convergence theorem of Kantorovich can be proven when this holds, subject to regularity and stability of the derivative map. In this paper, we study what happens when this condition is not evident a priori but is observed a posteriori. Through an in-depth example involving a semilinear elliptic boundary value problem, and some general theory, we study the condition in the context of dual norms, and the effect upon convergence. We also discuss the connection to Nash iteration.     

Stability analysis for fractional‐order partial differential equations by means of space spectral time Adams‐Bashforth Moulton method

In this article, a new numerical scheme space Spectral time Fractional Adam Bashforth Moulton method for the solution of fractional partial differential equations is offered. The proposed method is obtained by modifying, in a suitable way; the spectral technique and the method of lines. The attention is focused on the stability properties and hence an elegant stability analysis for the current approach is also provided. Finally, two examples are presented to illustrate the effectiveness of the reported method. Obtained results confirm the convergence and spectral accuracy of the proposed method in both space and time. In addition, a comparison with the existing studies is also made as a limiting case of the considered problem at the end and found in good agreement.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 34: 19–29, 2018     

Bernstein series solution of linear second‐order partial differential equations with mixed conditions

The purpose of this study is to present a new collocation method for numerical solution of linear PDEs under the most general conditions. The method is given with a priori error estimate. By using the residual correction procedure, the absolute error can be estimated. Also, one can specify the optimal truncation limit n, which gives better result in any norm ∥ ∥ . Finally, the effectiveness of the method is illustrated in some numerical experiments. Numerical results are consistent with the theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.     

Irrational approximations and their applications to partial differential equations in exterior domains<Superscript>,</Superscript>

A family of orthogonal systems of irrational functions on the semi-infinite interval is introduced. The proposed orthogonal systems are based on Jacobi polynomials through an irrational coordinate transform. This family of orthogonal systems offers great flexibility to match a wide range of asymptotic behaviors at infinity. Approximation errors by the basic orthogonal projection and various other orthogonal projections related to partial differential equations in unbounded domains are established. As an example of applications, a Galerkin approximation using the proposed irrational functions to an exterior problem is analyzed and implemented. Numerical results in agreement with our theoretical estimates are presented. The work of J.S. is supported in part by NSF Grants DMS-0311915, DMS-0509665 and Shanghai E-Institute for Computational Science.     

A spectral element method using the modal basis and its application in solving second‐order nonlinear partial differential equations

We present a high‐order spectral element method (SEM) using modal (or hierarchical) basis for modeling of some nonlinear second‐order partial differential equations in two‐dimensional spatial space. The discretization is based on the conforming spectral element technique in space and the semi‐implicit or the explicit finite difference formula in time. Unlike the nodal SEM, which is based on the Lagrange polynomials associated with the Gauss–Lobatto–Legendre or Chebyshev quadrature nodes, the Lobatto polynomials are used in this paper as modal basis. Using modal bases due to their orthogonal properties enables us to exactly obtain the elemental matrices provided that the element‐wise mapping has the constant Jacobian. The difficulty of implementation of modal approximations for nonlinear problems is treated in this paper by expanding the nonlinear terms in the weak form of differential equations in terms of the Lobatto polynomials on each element using the fast Fourier transform (FFT). Utilization of the Fourier interpolation on equidistant points in the FFT algorithm and the enough polynomial order of approximation of the nonlinear terms can lead to minimize the aliasing error. Also, this approach leads to finding numerical solution of a nonlinear differential equation through solving a system of linear algebraic equations. Numerical results for some famous nonlinear equations illustrate efficiency, stability and convergence properties of the approximation scheme, which is exponential in space and up to third‐order in time. Copyright © 2014 John Wiley & Sons, Ltd.     

Delayed perturbation of Mittag‐Leffler functions and their applications to fractional linear delay differential equations

In this paper, we propose a delayed perturbation of Mittag‐Leffler type matrix function, which is an extension of the classical Mittag‐Leffler type matrix function and delayed Mittag‐Leffler type matrix function. With the help of the delayed perturbation of Mittag‐Leffler type matrix function, we give an explicit formula of solutions to linear nonhomogeneous fractional delay differential equations.     

Application of Richardson extrapolation to the numerical solution of partial differential equations

Richardson extrapolation is a methodology for improving the order of accuracy of numerical solutions that involve the use of a discretization size h. By combining the results from numerical solutions using a sequence of related discretization sizes, the leading order error terms can be methodically removed, resulting in higher order accurate results. Richardson extrapolation is commonly used within the numerical approximation of partial differential equations to improve certain predictive quantities such as the drag or lift of an airfoil, once these quantities are calculated on a sequence of meshes, but it is not widely used to determine the numerical solution of partial differential equations. Within this article, Richardson extrapolation is applied directly to the solution algorithm used within existing numerical solvers of partial differential equations to increase the order of accuracy of the numerical result without referring to the details of the methodology or its implementation within the numerical code. Only the order of accuracy of the existing solver and certain interpolations required to pass information between the mesh levels are needed to improve the order of accuracy and the overall solution accuracy. Using the proposed methodology, Richardson extrapolation is used to increase the order of accuracy of numerical solutions of the linear heat and wave equations and of the nonlinear St. Venant equations in one‐dimension. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity

In this paper, we study the existence of solutions for noncoercive mixed equilibrium problems which are described by the sum of a maximal monotone bifunction and a pseudomonotone (or quasimonotone) bifunction in the sense of Brézis. Our approach is based on recession analysis and on recent results established by the authors for the existence of solutions of mixed equilibrium problems under pseudomonotone perturbations. As an application, we study the existence of solutions for nonlinear evolution equations associated with a noncoercive time-dependent pseudomonotone (or quasimonotone) operator.     

The relationships between some types of partial differential equations and ordinary differential equations as well as their applications

In this article, we establish some relationships between several types of partial differential equations and ordinary differential equations. One application of these relationships is that we can get the exact values of the blowup time and the blowup rate of the solution to a partial differential equation by solving an ordinary differential equation. Another application of these relationships is that we can give the estimates for the spatial integration (or mean value) of the solution to a partial differential equation. We also obtain the lower and upper bounds for the blowup time of the solution to a parabolic equation with weighted function and space‐time integral in the nonlinear term.     

An efficient numerical approach to solve a class of variable‐order fractional integro‐partial differential equations

The main purpose of this work is to investigate an initial boundary value problem related to a suitable class of variable order fractional integro‐partial differential equations with a weakly singular kernel. To discretize the problem in the time direction, a finite difference method will be used. Then, the Sinc‐collocation approach combined with the double exponential transformation is employed to solve the problem in each time level. The proposed numerical algorithm is completely described and the convergence analysis of the numerical solution is presented. Finally, some illustrative examples are given to demonstrate the pertinent features of the proposed algorithm.     

Bernstein modal basis: Application to the spectral Petrov‐Galerkin method for fractional partial differential equations

In the spectral Petrov‐Galerkin methods, the trial and test functions are required to satisfy particular boundary conditions. By a suitable linear combination of orthogonal polynomials, a basis, that is called the modal basis, is obtained. In this paper, we extend this idea to the nonorthogonal dual Bernstein polynomials. A compact general formula is derived for the modal basis functions based on dual Bernstein polynomials. Then, we present a Bernstein‐spectral Petrov‐Galerkin method for a class of time fractional partial differential equations with Caputo derivative. It is shown that the method leads to banded sparse linear systems for problems with constant coefficients. Some numerical examples are provided to show the efficiency and the spectral accuracy of the method.     

A Jacobi spectral Galerkin method for the integrated forms of fourth‐order elliptic differential equations

This article analyzes the solution of the integrated forms of fourth‐order elliptic differential equations on a rectilinear domain using a spectral Galerkin method. The spatial approximation is based on Jacobi polynomials P (x), with α, β ∈ (?1, ∞) and n the polynomial degree. For α = β, one recovers the ultraspherical polynomials (symmetric Jacobi polynomials) and for α = β = ?½, α = β = 0, the Chebyshev of the first and second kinds and Legendre polynomials respectively; and for the nonsymmetric Jacobi polynomials, the two important special cases α = ?β = ±½ (Chebyshev polynomials of the third and fourth kinds) are also recovered. The two‐dimensional version of the approximations is obtained by tensor products of the one‐dimensional bases. The various matrix systems resulting from these discretizations are carefully investigated, especially their condition number. An algebraic preconditioning yields a condition number of O(N), N being the polynomial degree of approximation, which is an improvement with respect to the well‐known condition number O(N⁸) of spectral methods for biharmonic elliptic operators. The numerical complexity of the solver is proportional to N^d+1 for a d‐dimensional problem. This operational count is the best one can achieve with a spectral method. The numerical results illustrate the theory and constitute a convincing argument for the feasibility of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Efficient numerical methods for boundary data and right‐hand side reconstructions in elliptic partial differential equations

In this article, we discuss the application of two important numerical methods, Ritz–Galerkin and Method of Fundamental Solutions (MFS), for solving some inverse problems, arising in the context of two‐dimensional elliptic equations. The main incentive for studying the considered problems is their wide applications in engineering fields. In the previous literature, the use of these methods, particularly MFS for right hand side reconstruction has been limited, partly due to stability concerns. We demonstrate that these diculties may be surmounted if the aforementioned methods are combined with techniques such as dual reciprocity method(DRM). Moreover, we incorporate some iterative regularization techniques. This fact is especially veried by taking into account the noisy data with boundary conditions. In addition, parts of this article are dedicated to the problem of boundary data approximation and the issue of numerical stability, ending with a general discussion on the advantages and disadvantages of various methods. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1995–2026, 2015     

Implicitly enriched Galerkin methods for numerical solutions of fourth‐order partial differential equations containing singularities

Highlights are the following:

• For any integer , we construct ‐continuous partition of unity (PU) functions with flat‐top from B‐spline functions to have numerical solutions of fourth‐order equations with singularities. B‐spline functions are modified to satisfy clamped boundary conditions.
• To handle singularity arising in fourth‐order elliptic differential equations, these modified B‐spline functions are enriched either by introducing enrichment basis functions implicitly through particular geometric mappings or by adding singular basis functions explicitly.
• To show the effectiveness of the proposed implicit enrichment methods (mapping method), the accuracy, the number of degrees of freedom (DOF), and matrix condition numbers are computed and compared in the h‐refinement, the p‐refinement, and the k‐refinement of the approximation space of B‐spline basis functions.

Using Partition of unity (PU) functions with flat‐top, B‐spline functions are modified to satisfy boundary conditions of the fourth‐order equations. Since the standard isogeometric analysis (IGA) as well as the conventional FEM have limitations in handling fourth‐order differential equations containing singularities, we consider two enrichment methods (explicit and implicit) in the framework of the p‐, the k, and the h‐refinements of IGA. We demonstrate that both enrichment methods yield good approximate solutions, but explicit enrichment methods give large (almost singular) matrix condition numbers and face integrating singular functions. Because of these limitations of external enrichment methods, we extensively investigate implicit enrichment methods (mapping methods) that virtually convert fourth‐order elliptic problems with singularities to problems with no influence of the singularities. Effectiveness of the proposed mapping method extensively tested to one‐dimensional fourth‐order equation with singularities. The implicit enrichment (mapping) method is extended to the two‐dimensional cases and test it to fourth‐order partial differential equations on cracked domains.     

A numerical approach for solving weakly singular partial integro‐differential equations via two‐dimensional‐orthonormal Bernstein polynomials with the convergence analysis

In this paper, we develop an efficient matrix method based on two‐dimensional orthonormal Bernstein polynomials (2D‐OBPs) to provide approximate solution of linear and nonlinear weakly singular partial integro‐differential equations (PIDEs). First, we approximate all functions involved in the considerable problem via 2D‐OBPs. Then, by using the operational matrices of integration, differentiation, and product, the solution of Volterra singular PIDEs is transformed to the solution of a linear or nonlinear system of algebraic equations which can be solved via some suitable numerical methods. With a small number of bases, we can find a reasonable approximate solution. Moreover, we establish some useful theorems for discussing convergence analysis and obtaining an error estimate associated with the proposed method. Finally, we solve some illustrative examples by employing the presented method to show the validity, efficiency, high accuracy, and applicability of the proposed technique.     

Generalized fractional‐order Jacobi functions for solving a nonlinear systems of fractional partial differential equations numerically

In this paper, a collocation spectral numerical algorithm is presented for solving nonlinear systems of fractional partial differential equations subject to different types of conditions. A proposed error analysis investigates the convergence of the mentioned algorithm. Some numerical examples confirm the efficiency and accuracy of the method.     

The spectral analysis and exponential stability of a bi‐directional coupled wave‐ODE system

In this paper, an unstable linear time invariant (LTI) ODE system is stabilized exponentially by the PDE compensato—a wave equation with Kelvin‐Voigt (K‐V) damping. Direct feedback connections between the ODE system and wave equation are established: The velocity of the wave equation enters the ODE through the variable v_t(1,t); meanwhile, the output of the ODE is fluxed into the wave equation. It is found that the spectrum of the system operator is composed of two parts: point spectrum and continuous spectrum. The continuous spectrum consists of an isolated point , and there are two branches of asymptotic eigenvalues: the first branch approaches to , and the other branch tends to ?∞. It is shown that there is a sequence of generalized eigenfunctions, which forms a Riesz basis for the Hilbert state space. As a consequence, the spectrum‐determined growth condition and exponential stability of the system are concluded.