Complexity of fredholm equations of the second kind with kernels from anisotropic classes of differentiable functions

We establish the exact order of complexity of the approximate solution of Fredholm equations with periodic kernels with dominant mixed partial derivative.     

Optimization of algorithms for the approximate solution of the Volterra equations with infinitely differentiable kernels

For the Volterra equations with analytic kernels, we establish the exact power order of complexity of their approximate solutions and show that the optimal power order is realized by the method of simple iterations based on the use of information in the form of the values of kernels and free terms at certain points. In addition, for the Volterra equations with infinitely differentiable kernels, we determine the minimal order of the error of direct methods and construct a method which realizes this order.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 11, pp. 1534–1545, November, 1994.The work was supported by the Foundation for Fundamental Researches of the Ukrainian State Committee on Science and Technology.     

Conditions for the existence of a solution of a system of differential equations close to an approximate solution

We consider nonautonomous systems of differential equations and state conditions for the existence of an exact solution in a neighborhood of an approximate one by analyzing the linear system of the first approximation in a neighborhood of the constructed approximate solution. We present conditions for the existence of a bounded solution of a linear inhomogeneous system of differential equations.     

Rational interpolation and approximate solution of integral equations

In the space of continuous periodic functions, we construct interpolation rational operators, use them to obtain quadrature formulas with positive coefficients which are exact on rational trigonometric functions of order 2n, and suggest an algorithm for an approximate solution of integral equations of the second kind. We estimate the accuracy of the approximate solution via the best trigonometric rational approximations to the kernel and the right-hand side of the integral equation.     

Optimal methods for specifying information in the solution of integral equations with analytic kernels

We determine the exact order of the minimum radius of information in the logarithmic scale for Fredholm integral equations of the second kind with periodic analytic kernels and free terms. We show that the information complexity of the solution of Fredholm equations with analytic kernels is greater in order than the complexity of the approximation of analytic functions. This distinguishes the analytic case from the case of finite smoothness.     

On Optimization of Direct Methods of Solving Weakly Singular Integral Equations

We find the exact order of optimal accuracy of adaptive direct methods for the approximate solution of integral equations with potential-type kernels and for Peierls integral equations arising in transport theory. Moreover, for these equations we indicate the adaptive direct method of optimal order.     

Adaptive Wavelet Methods for Elliptic Operator Equations with Nonlinear Terms

We present an adaptive wavelet method for the numerical solution of elliptic operator equations with nonlinear terms. This method is developed based on tree approximations for the solution of the equations and adaptive fast reconstruction of nonlinear functionals of wavelet expansions. We introduce a constructive greedy scheme for the construction of such tree approximations. Adaptive strategies of both continuous and discrete versions are proposed. We prove that these adaptive methods generate approximate solutions with optimal order in both of convergence and computational complexity when the solutions have certain degree of Besov regularity.     

Convergence of the homotopy perturbation method for partial differential equations

In this paper, we introduce a homotopy perturbation method to obtain exact solutions to some linear and nonlinear partial differential equations. This method is a powerful device for solving a wide variety of problems. Using the homotopy perturbation method, it is possible to find the exact solution or an approximate solution of the problem. Convergence of the method is proved. Some examples such as Burgers’, Schrödinger and fourth order parabolic partial differential equations are presented, to verify convergence hypothesis, and illustrating the efficiency and simplicity of the method.     

Homotopy analysis method for solving the MHD flow over a non-linear stretching sheet

The problem of the boundary layer flow of an incompressible viscous fluid over a non-linear stretching sheet is considered. Homotopy analysis method (HAM) is applied in order to obtain analytical solution of the governing nonlinear differential equations. The obtained results are finally compared through the illustrative graphs with the exact solution and an approximate method. The compression shows that the HAM is very capable, easy-to-use and applicable technique for solving differential equations with strong nonlinearity. Moreover, choosing a suitable value of none–zero auxiliary parameter as well as considering enough iteration would even lead us to the exact solution so HAM can be widely used in engineering too.     

ADM-Padé technique for the nonlinear lattice equations

ADM-Padé technique is a combination of Adomian decomposition method (ADM) and Padé approximants. We solve two nonlinear lattice equations using the technique which gives the approximate solution with higher accuracy and faster convergence rate than using ADM alone. Bell-shaped solitary solution of Belov–Chaltikian (BC) lattice and kink-shaped solitary solution of the nonlinear self-dual network equations (SDNEs) are presented. Comparisons are made between approximate solutions and exact solutions to illustrate the validity and the great potential of the technique.     

On the exact degree of complexity of a class of operator equations of the second kind in a Hilbert space

The exact exponent of complexity is found for approximate solutions of a certain class of operator equations in a Hilbert space. A method for information setup and the algorithm for realization of this optimal degree are presented. As a consequence, we find the exact exponent of complexity for approximate solutions of Fredholm integral equations of the second kind whose kernels and free terms include square integrable -derivatives.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 7, pp. 893–903, July, 1994.     

Polyharmonic functions in structures of exact solutions in the elasticity theory

We introduce an asymptotic algorithm that allows us to construct both approximate and exact solutions to a set of equations in the linear elasticity theory. The exact solutions are expressed by polynomials in one of coordinates, while their coefficients include polyharmonic functions that depend on two other coordinates. For the sake of ordering of solutions, one can associate every exact solution with the number of the asymptotic approximation.     

长水波近似方程组的新精确解

依据齐次平衡法的思想 ,首先提出了求非线性发展方程精确解的新思路 ,这种方法通过改变待定函数的次序 ,优势是使求解的复杂计算得到简化 .应用本文的思路 ,可得到某些非线性偏微分方程的新解 .其次我们给出了长水波近似方程组的一些新精确解 ,其中包括椭圆周期解 ,我们推广了有关长波近似方程的已有结果 .     

Optimization of adaptive direct algorithms for approximate solution of integral equation

The concern of this paper is to study the optimization of adaptive direct algorithms for approximate solution of the second kind Fredholm integral equations. We derive the exact order of the problem with integral kernels belonging to the Besov classes. Furthermore, we also present an almost optimal adaptive direct algorithm for above equation class.     

Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem

We investigate a global complexity bound of the Levenberg–Marquardt Method (LMM) for nonsmooth equations. The global complexity bound is an upper bound to the number of iterations required to get an approximate solution that satisfies a certain condition. We give sufficient conditions under which the bound of the LMM for nonsmooth equations is the same as smooth cases. We also show that it can be reduced under some regularity assumption. Furthermore, by applying these results to nonsmooth equations equivalent to the nonlinear complementarity problem (NCP), we get global complexity bounds for the NCP. In particular, we give a reasonable bound when the mapping involved in the NCP is a uniformly P-function.     

多元积分方程自适应解法的最优化

In this paper it was considered that problem of optimization of adaptive direct algorithm of approximate solution of integral equations. For the Fredholm integral equations of second kind with kernels belonging to Besov classes there is determined the exact order of the error of an optimal adaptive direct algorithm and a algorithm for realizing it is indicated.     

Integral equations of the third kind with unbounded operators

We consider linear functional equations of the third kind in L ₂ with arbitrary measurable coefficients and unbounded integral operators with kernels satisfying broad conditions. We propose methods for reducing these equations by linear continuous invertible transformations either to equivalent integral equations of the first kind with nuclear operators or to equivalent integral equations of the second kind with quasidegenerate Carleman kernels. To the integral equations obtained after the reduction, one can apply various exact and approximate methods of solution; in particular, the two approximate methods developed in this article.     

Exact and approximate pulsed beam solutions of Maxwell's equations

An exact solution of Maxwell's equations is constructed which represents a pulse of finite energy propagating along a given axis. To simplify the computation of such a pulse, an approximate solution is constructed as a superposition of solutions of the paraxial equation. This approximation is vectorial in nature and satisfies the divergence-free condition. The difference between the exact and approximate solutions is estimated relative to the total energy transfer of the exact solution.     

A rational approximation based on Bernstein polynomials for high order initial and boundary values problems

We introduce a new method to solve high order linear differential equations with initial and boundary conditions numerically. In this method, the approximate solution is based on rational interpolation and collocation method. Since controlling the occurrence of poles in rational interpolation is difficult, a construction which is found by Floater and Hormann [1] is used with no poles in real numbers. We use the Bernstein series solution instead of the interpolation polynomials in their construction. We find that our approximate solution has better convergence rate than the one found by using collocation method. The error of the approximate solution is given in the case of the exact solution f ∈ C^d+2[a, b].     

Modification of a method of generalized separation of variables for the solution of multidimensional integral equations

We describe a method of generalized separation of variables for the solution of multidimensional integral equations and its modification minimizing the deviation of an approximate solution from the exact one. The convergence of the modified method is proved. A comparison of methods on the basis of numerical results is presented.