带常系数的Cauchy型奇异积分方程的快速方法

Petrov-Galerkin 方法是研究Cauchy型奇异积分方程的最基本的数值方法. 用此方法离散积分方程可得一系数矩阵是稠密的线性方程组. 如果方程组的阶比较大, 则求解此方程组所需要的计算复杂度则会变得很大. 因此, 发展此类方程的快速数值算法就变成了必然. 该文将就对带常系数的Cauchy型奇异积分方程给出一种快速数值方法. 首先用一稀疏矩阵来代替稠密系数矩阵, 其次用数值积分公式离散上述方程组得到其完全离散的形式,然后用多层扩充方法求解此完全离散的线性方程组. 证明经过上述过程得到方程组的逼进解仍然保持了最优阶, 并且整个过程所需要的计算复杂度是拟线性的. 最后通过数值实验证明结论.     

解不适定问题的一种多尺度方法

1 前言 数学物理反问题是应用数学领域中成长和发展最快的领域之一.反问题大多是不适定的.对于不适定问题的解法已有不少的学者进行探索和研究,Tikhonov正则化方法是一种理论上最完备而在实践上行之有效的方法(参见[5,6,7,8,13]).     

Multigrid method for nonlinear integral equations

In this paper, we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equation. The algorithm is mathematically equivalent to Atkinson’s adaptive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson’s adaptive twogrid iteration. In our numerical example, we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid method introduced by Hackbush.     

A minimum of the dispersion of centered discrete random variables

A problem of finding discrete random values and vectors with discrete distributions having a given average value and a minimum dispersion is solved. The vector model is associated with statistical methods of calculating multiple integrals and solving systems of integral equations.     

Discrete Wavelet Petrov–Galerkin Methods

In this paper, we develop a discrete wavelet Petrov–Galerkin method for integral equations of the second kind with weakly singular kernels suitable for solving boundary integral equations. A compression strategy for the design of a fast algorithm is suggested. Estimates for the rate of convergence and computational complexity of the method are provided.     

A meshless local Galerkin method for the numerical solution of Hammerstein integral equations based on the moving least squares technique

In this paper, a computational scheme is proposed to estimate the solution of one- and two-dimensional Fredholm-Hammerstein integral equations of the second kind. The method approximates the solution using the discrete Galerkin method based on the moving least squares (MLS) approach as a locally weighted least squares polynomial fitting. The discrete Galerkin technique for integral equations results from the numerical integration of all integrals in the system corresponding to the Galerkin method. Since the proposed method is constructed on a set of scattered points, it does not require any background meshes and so we can call it as the meshless local discrete Galerkin method. The implication of the scheme for solving two-dimensional integral equations is independent of the geometry of the domain. The new method is simple, efficient and more flexible for most classes of nonlinear integral equations. The error analysis of the method is provided. The convergence accuracy of the new technique is tested over several Hammerstein integral equations and obtained results confirm the theoretical error estimates.     

Boundary-value problems for the Helmholtz equation and their discrete mathematical models

We consider boundary-value problems of mathematical diffraction theory and discuss the possibility of reducing them to boundary hypersingular integral equations and solving them numerically. The analytic technique of parametric representations of pseudodifferential and integral operators and the numerical method of discrete singularities are essentially used. We discuss the reasoning in applying this approach to constructing mathematical models of wave diffraction problems and solving them numerically.     

DISCRETE REGULARIZATION FOR OPERATOR EQUATION OF HAMMERSTEIN＇S TYPE

51.IntroductionIn[5]wepresentedamethodofregularizationforsolvingtheoperatorequationofHammerstein'stypewhereboththeoperatorsFZ'X*-XandFI:X-X*arenonlinear,hemicontinuousandmonotone;Xisareflexive,strictlyconvexBanachspacehavingtheE-property,i.e.weakconvergenceandconvergenceofnormsforanysequenceinXfOllowitstrongconvergence,andX*denotestheadjointspaceofX.Obviously,anyuniformlyconvexBanachspacehastheE-property.FromnowonwesupposethatXandX*areuniformlyconvex.Further,forthesakeofsimplicitynorms…     

Discrete multi-projection methods for eigen-problems of compact integral operators

In this paper, a discrete multi-projection method is developed for solving the eigenvalue problem of a compact integral operator with a smooth kernel. We propose a theoretical framework for analysis of the convergence of these methods. The theory is then applied to establish super-convergence results of the corresponding discrete Galerkin method, collocation method and their iterated solutions. Numerical examples are presented to illustrate the theoretical estimates for the error of these methods.     

Convergence of a numerical scheme of the type of the vortex loop method on a closed surface with an approximation to the surface shape

We consider a linear integral equation with a hypersingular integral treated in the sense of the Hadamard finite value. This equation arises when solving the Neumann boundary value problem for the Laplace equation with the use of the representation of the solution in the form of a double layer potential. We study the case in which an exterior or interior boundary value problem is solved in a domain whose boundary is a smooth closed surface and the integral equation is written out on that surface. For the numerical solution of the integral equation, the surface is approximated by spatial polygons whose vertices lie on the surface. We construct a numerical scheme for solving the integral equation on the basis of such an approximation to the surface with the use of quadrature formulas of the type of the method of discrete singularities with regularization. We prove that the numerical solutions converge to the exact solution of the hypersingular integral equation uniformly on the grid.     

On the solution of discrete bottleneck problems

We consider a class of discrete bottleneck problems which includes bottleneck integral flow problems. It is demonstrated that a problem in this class, with k discrete variables, can be optimized by solving atmost k problems with real valued variables.     

DISCRETE REGULARIZATION FOR OPERATOR EQUATION OF HAMMERSTEIN'S TYPE

The purpose of tthis note is to study a convergence for a method in form of combination of discrete approximations with regularization for solving operator equations of Hammerstein's type in Banach spaces. For illustration, an example in the theory of nonlinear integral equations is given.     

Numerical Treatment of Homogeneous Semi-Markov Processes in Transient Case–a Straightforward Approach

This paper presents the numerical solution of the process evolution equation of a homogeneous semi-Markov process (HSMP) with a general quadrature method. Furthermore, results that justify this approach proving that the numerical solution tends to the evolution equation of the continuous time HSMP are given. The results obtained generalize classical results on integral equation numerical solutions applying them to particular kinds of integral equation systems. A method for obtaining the discrete time HSMP is shown by applying a very particular quadrature formula for the discretization. Following that, the problem of obtaining the continuous time HSMP from the discrete one is considered. In addition, the discrete time HSMP in matrix form is presented and the fact that the solution of the evolution equation of this process always exists is proved. Afterwards, an algorithm for solving the discrete time HSMP is given. Finally, a simple application of the HSMP is given for a real data social security example.     

Regularization of a discrete scheme governing the three-dimensional evolution of a fluid-fluid interface

A regularized discrete scheme is developed that describes the three-dimensional evolution of the interface between fluids with different viscosities and densities in the Leibenzon-Muskat model. The regularization is achieved by smoothing the kernel of the singular integral involved in the differential equation governing the moving interface. The discrete scheme is tested by solving the problem of a drop of one fluid evolving in a translational flow of another.     

A fast solver for integral equations with convolution-type Kernel

This paper studies the data redundancy of the coefficient matrix of the corresponding discrete system which forms a basis for fast algorithms of solving the integral equation whose kernel includes a convolution function factor. We develop lossless matrix compression strategies, which reduce the cost of integral evaluations and the storage to linear complexity, i.e., the same order of the approximation space dimensions. We establish that this algorithm preserves the convergence order of the approximate solution. We also propose a hardware-aware parallel algorithm for these strategies.     

A finite difference scheme for the nonlinear time-fractional partial integro-differential equation

In this paper, a finite difference scheme is proposed for solving the nonlinear time-fractional integro-differential equation. This model involves two nonlocal terms in time, ie, a Caputo time-fractional derivative and an integral term with memory. The existence of numerical solutions is shown by the Leray-Schauder theorem. And we obtain the discrete L₂ stability and convergence with second order in time and space by the discrete energy method. Then the uniqueness of numerical solutions is derived. Moreover, an iterative algorithm is designed for solving the derived nonlinear system. Numerical examples are presented to validate the theoretical findings and the efficiency of the proposed algorithm.     

Radial Schrödinger equation: The spectral problem

Using the integral transformation method involving the investigation of the Laplace transforms of wave functions, we find the discrete spectra of the radial Schrödinger equation with a confining power-growth potential and with the generalized nuclear Coulomb attracting potential. The problem is reduced to solving a system of linear algebraic equations approximately. We give the results of calculating the discrete spectra of the S-states for the Schrödinger equation with a linearly growing confining potential and the nuclear Yukawa potential.     

求解第一类Fredholm积分方程的多层迭代算法

本文先把正则化后的第二类积分方程分解为等价的一对不含积分算子K^*K、仅含积分算子K以及K^*的方程组, 再用截断投影方法离散方程组, 采用多层迭代算法求解截断后的等价方程组, 并给出了后验参数的选择方法, 确保近似解达到最优.与传统全投影方法相比, 减少了积分计算的维数, 保持了最优收敛率. 最后, 算例说明了算法的有效性.     

第一类弱奇异核Fredholm积分方程的数值求解

第一类弱奇异核Fredholm积分方程由于奇异及本质的不适定性,给求解带来很大难度．本文首先利用克雷斯变换将方程转化,并对转化后的方程进行高斯一勒让德离散,得到一离散不适定的线性方程组,结合正则化方法对该类问题进行数值求解．最后给出了数值模拟,验证了本文方法的可行性及有效性．     

The discrete collocation method for nonlinear integral equations

The collocation method for solving linear and nonlinear integralequations results in many integrals which must be evaluatednumerically. In this paper, we give a general framework fordiscrete collocation methods, in which all integrals are replacedby numerical integrals. In some cases, the collocation methodleads to solutions which are superconvergent at the collocationnode points. We consider generalizations of these results, toobtain similar results for discrete collocation solutions. Lastly,we consider a variant due to Kumar and Sloan for the collocationsolution of Hammerstein integral equations.