求解对流扩散方程的Haar小波方法

本文用Haar小波求解对流扩散方程，将满足初始和边界条件的常系数偏微分方程简化为较简单的代数方程组进行求解．实例说明了这种方法具有收敛速度快和计算容易的特点，同时又避免了用Daubechies小波求解微分方程需要计算相关系数的麻烦．本文所使用的方法可以求解一般的微（积）分方程．     

Free vibration of non-uniform Euler–Bernoulli beam under various supporting conditions using Chebyshev wavelet collocation method

This paper proposes operational matrix of rth integration of Chebyshev wavelets. A general procedure of this matrix is given. Operational matrix of rth integration is taken as rth power of operational matrix of first integration in literature. But, this study removes this disadvantage of Chebyshev wavelets method. Free vibration problems of non-uniform Euler–Bernoulli beam under various supporting conditions are investigated by using Chebyshev Wavelet Collocation Method. The proposed method is based on the approximation by the truncated Chebyshev wavelet series. A homogeneous system of linear algebraic equations has been obtained by using the Chebyshev collocation points. The determinant of coefficients matrix is equated to the zero for nontrivial solution of homogeneous system of linear algebraic equations. Hence, we can obtain ith natural frequencies of the beam and the coefficients of the approximate solution of Chebyshev wavelet series that satisfied differential equation and boundary conditions. Mode shapes functions corresponding to the natural frequencies can be obtained by normalizing of approximate solutions. The computed results well fit with the analytical and numerical results as in the literature. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation method is quite good even for small number of grid points.     

Compactly supported wavelet and the numerical solution of the vlasov equation

A new scheme for solving the Vlasov equation using a compactly supported wavelets basis is proposed. We use a numerical method which minimizes the numerical diffusion and conserves a reasonable time computing cost. So we introduce a representation in a compactly supported wavelet of the derivative operator. This method makes easy and simple the computation of the coefficients of the matrix representing the operator. This allows us to solve the two equations which result from the splitting technique of the main Vlasov equation. Some numerical results are exposed using different numbers of wavelets.     

A Taylor matrix method for the solution of a two-dimensional linear hyperbolic equation

A Taylor matrix method is proposed for the numerical solution of the two-space-dimensional linear hyperbolic equation. This method transforms the equation into a matrix equation and the unknown of this equation is a Taylor coefficients matrix. Solutions are easily acquired by using this matrix equation, which corresponds to a system of linear algebraic equations. As a result, the finite Taylor series approach with three variables is obtained. The accuracy of the proposed method is demonstrated with one example.     

A new Euler matrix method for solving systems of linear Volterra integral equations with variable coefficients

This article develops an efficient solver based on collocation points for solving numerically a system of linear Volterra integral equations (VIEs) with variable coefficients. By using the Euler polynomials and the collocation points, this method transforms the system of linear VIEs into the matrix equation. The matrix equation corresponds to a system of linear equations with the unknown Euler coefficients. A small number of Euler polynomials is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for solving VIEs with variable coefficients.     

Wavelet method for a class of fractional convection-diffusion equation with variable coefficients

A wavelet method to the solution for a class of space–time fractional convection-diffusion equation with variable coefficients is proposed, by which combining Haar wavelet and operational matrix together and dispersing the coefficients efficaciously. The original problem is translated into Sylvester equation and computation became convenient. The numerical example shows that the method is effective.     

Circulant Wavelet Preconditioners for Solving Elliptic Differential Equations and Boundary Integral Equations

In this paper is discussed solving an elliptic equation and a boundary integral equation of the second kind by representation of compactly supported wavelets. By using wavelet bases and the Galerkin method for these equations, we obtain a stiff sparse matrix that can be ill-conditioned. Therefore, we have to introduce an operator which maps every sparse matrix to a circulant sparse matrix. This class of circulant matrices is a class of preconditioners in a Banach space. Based on having some properties in the spectral theory for this class of matrices, we conclude that the circulant matrices are a good class of preconditioners for solving these equations. We called them circulant wavelet preconditioners (CWP). Therefore, a class of algorithms is introduced for rapid numerical application.     

An exponential matrix method for solving systems of linear differential equations

This paper presents an exponential matrix method for the solutions of systems of high‐order linear differential equations with variable coefficients. The problem is considered with the mixed conditions. On the basis of the method, the matrix forms of exponential functions and their derivatives are constructed, and then by substituting the collocation points into the matrix forms, the fundamental matrix equation is formed. This matrix equation corresponds to a system of linear algebraic equations. By solving this system, the unknown coefficients are determined and thus the approximate solutions are obtained. Also, an error estimation based on the residual functions is presented for the method. The approximate solutions are improved by using this error estimation. To demonstrate the efficiency of the method, some numerical examples are given and the comparisons are made with the results of other methods. Copyright © 2012 John Wiley & Sons, Ltd.     

Numerical solution of nonlinear fractional-order Volterra integro-differential equations by SCW

Fractional calculus is an extension of derivatives and integrals to non-integer orders and has been widely used to model scientific and engineering problems. In this paper, we describe the fractional derivative in the Caputo sense and give the second kind Chebyshev wavelet (SCW) operational matrix of fractional integration. Then based on above results we propose the SCW operational matrix method to solve a kind of nonlinear fractional-order Volterra integro-differential equations. The main characteristic of this approach is that it reduces the integro-differential equations into a nonlinear system of algebraic equations. Thus, it can simplify the problem of fractional order equation solving. The obtained numerical results indicate that the proposed method is efficient and accurate for this kind equations.     

Efficient numerical algorithm for solving the gravimetry problem of finding a lateral density in a layer: Parallel implementation

The paper is devoted to developing the new time- and memory-efficient algorithm BiCGSTABmem for solving the inverse gravimetry problem of determination of a variable density in a layer using the gravitational data. The problem is in solving the linear Fredholm integral equation of the first kind. After discretization of the domain and approximation of the integral operator, this problem is reduced to solving a large system of linear algebraic equations. It is shown that the matrix of coefficients is the Toeplitz-block-Toeplitz one in the case of the horizontal layer. For calculating and storing the elements of this matrix, we construct an efficient method, which significantly reduces the required memory and time. For the case of the curvilinear layer, we construct a method for approximating the parts of the matrix by a Toeplitz-block-Toeplitz one. This allows us to exploit the same efficient method for storing and processing the coefficient matrix in the case of a curvilinear layer. To solve the system of linear equations, we constructed the parallel algorithm on the basis of the stabilized biconjugated gradient method with using the Toeplitz-block-Toeplitz structure of the matrix. We implemented the BiCGSTAB and BiCGSTABmem algorithms for the Uran cluster supercomputer using the hybrid MPI + OpenMP technology. A model problem with synthetic data was solved for a large grid. It was shown that the new BiCGSTABmem algorithm reduces the computation time in comparison with the BiCGSTAB. Scalability of the parallel algorithm was studied.     

A numerical approach to solve the model of an electromechanical system

In this paper, the model of an electromechanical system, which is a system of linear differential equations, is studied. Haar wavelet collocation method (HWCM) is applied for finding the approximate solution of the model. HWCM reduces the system of the model into a matrix‐vector form that contains the unknown Haar coefficients, and these coefficients are easily calculated. To demonstrate the validity and applicability of HWCM, numerical solutions of the system for different parameter values in the system are presented. The obtained results demonstrate the efficiency and accuracy of the method. All of the computations are performed via a program written in Mathematica.     

Legendre polynomial solutions of high-order linear Fredholm integro-differential equations

In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to matrix equations, by means of collocation points on the interval [−1, 1], which corresponding to systems of linear algebraic equations with Legendre coefficients. Thus, by solving the matrix equation, Legendre coefficients and polynomial approach are obtained. Also examples that illustrate the pertinent features of the method are presented and by using the error analysis, the results are discussed.     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

求解非线性Black-Scholes模型的自适应小波精细积分法

针对非线性Black-Scholes方程,基于quasi-Shannon小波函数给出了一种求解非线性偏微分方程的自适应多尺度小波精细积分法.该方法首先利用插值小波理论构造了用于逼近连续函数的多尺度小波插值算子,利用该算子可以将非线性Black-Scholes方程自适应离散为非线性常微分方程组;然后将用于求解常微分方程组的精细积分法和小波变换的动态过程相结合,并利用非线性处理技术(如同伦分析技术)可有效求解非线性Black-Scholes方程.数值结果表明了该方法在数值精度和计算效率方面的优越性.     

Legendre Wavelets Direct Method for the Numerical Solution of Time-Fractional Order Telegraph Equations

In this paper, a Legendre wavelet collocation method for solving a class of time-fractional order telegraph equation defined by Caputo sense is discussed. Fractional integral formula of a single Legendre wavelet in the Riemann–Liouville sense is derived by means of shifted Legendre polynomials. The main characteristic behind this approach is that it reduces equations to those of solving a system of algebraic equations which greatly simplifies the problem. The convergence analysis and error analysis of the proposed method are investigated. Several examples are presented to show the applicability and accuracy of the proposed method.     

Error bounds for numerical solutions of ordinary differential equations

Summary An a posteriori error bound, for an approximate solution of a system of ordinary differential equations, is derived as the solution of a Riccati equation. The coefficients of the Riccati equation depend on an eigenvalue of a matrix related to a Jacobian matrix, on a Lipschitz constant for the Jacobian matrix, and on the approximation defect. An upper bound is computable as the formal solution of a sequence of Riccati equations with constant coefficients. This upper bound may sometimes be used to control step length in a numerical method.     

Three dimensional elastodynamics of 2D quasicrystals: The derivation of the time-dependent fundamental solution

The time-dependent differential equations of elasticity for 2D quasicrystals with general structure of anisotropy (dodecagonal, octagonal, decagonal, pentagonal, hexagonal, triclinic) are considered in the paper. These equations are written in the form of a vector partial differential equation of the second order with symmetric matrix coefficients. The fundamental solution (matrix) is defined for this vector partial differential equation. A new method of the numerical computation of values of the fundamental solution is suggested. This method consists of the following: the Fourier transform with respect to space variables is applied to vector equation for the fundamental solution. The obtained vector ordinary differential equation has matrix coefficients depending on Fourier parameters. Using the matrix computations a solution of the vector ordinary differential equation is numerically computed. Finally, applying the inverse Fourier transform numerically we find the values of the fundamental solution. Computational examples confirm the robustness of the suggested method for 2D quasicrystals with arbitrary type of anisotropy.     

A collocation method based on Bernoulli operational matrix for numerical solution of generalized pantograph equation

This paper presents a direct solution technique for solving the generalized pantograph equation with variable coefficients subject to initial conditions, using a collocation method based on Bernoulli operational matrix of derivatives. Only small dimension of Bernoulli operational matrix is needed to obtain a satisfactory result. Numerical results with comparisons are given to confirm the reliability of the proposed method for generalized pantograph equations.     

Laguerre polynomial approach for solving linear delay difference equations

This paper presents a numerical method for the approximate solution of mth-order linear delay difference equations with variable coefficients under the mixed conditions in terms of Laguerre polynomials. The aim of this article is to present an efficient numerical procedure for solving mth-order linear delay difference equations with variable coefficients. Our method depends mainly on a Laguerre series expansion approach. This method transforms linear delay difference equations and the given conditions into matrix equation which corresponds to a system of linear algebraic equation. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer algebraic system Maple.     

On a Sparse Representation of an n-Dimensional Laplacian in Wavelet Coordinates

Important parts of adaptive wavelet methods are well-conditioned wavelet stiffness matrices and an efficient approximate multiplication of quasi-sparse stiffness matrices with vectors in wavelet coordinates. Therefore it is useful to develop a well-conditioned wavelet basis with respect to which both the mass and stiffness matrices are sparse in the sense that the number of nonzero elements in each column is bounded by a constant. Consequently, the stiffness matrix corresponding to the n-dimensional Laplacian in the tensor product wavelet basis is also sparse. Then a matrix–vector multiplication can be performed exactly with linear complexity. In this paper, we construct a wavelet basis based on Hermite cubic splines with respect to which both the mass matrix and the stiffness matrix corresponding to a one-dimensional Poisson equation are sparse. Moreover, a proposed basis is well-conditioned on low decomposition levels. Small condition numbers for low decomposition levels and a sparse structure of stiffness matrices are kept for any well-conditioned second order partial differential equations with constant coefficients; furthermore, they are independent of the space dimension.