Solution of Initial-Boundary Value Problems: Method of Moving Modes

Methods for solving problems of mathematical physics can be divided into the following four classes. Analytical methods (the method of separation of variables, the method of characteristics, the method of Green's functions, etc.) methods have a relatively low degree of universality, i.e. focused on solving rather narrow classes of problems. Approximate analytical methods (projection, variational methods, small parameter method, operational methods, various iterative methods) are more versatile than analytical ones. Numerical methods (finite difference method, direct method, control volume method, finite element method, etc.) are very universal methods. Probabilistic methods (Monte Carlo methods) are highly versatile. Can be used to calculate discontinuous solutions. However, they require large amounts of calculations and, as a rule, they lose with the computational complexity of the above methods when solving such problems to which these methods are applicable. Comparing methods for solving problems of mathematical physics, it is impossible to give unconditional primacy to any of them. Any of them may be the best for solving problems of a certain class. The proposed method of moving nodes for boundary value problems of differential equations combines a combination of numerical and analytical methods. In this case, we can obtain, on the one hand, an approximately analytical solution of the problem, which is not related to the methods listed above. On the other hand, this method allows one to obtain compact discrete approximations of the original problem. Note that obtaining an approximately analytical solution of differential equations is based on numerical methods. The nature of numerical methods also allows obtaining an approximate analytical expression for solving differential equations

• | Author: Umurdin Dalabaev
• | Publisher: de Gruyter
• | Publication Date: Jun 02, 2025
• | Number of Pages: 00133 pages
• | Binding: Hardback or Cased Book
• | ISBN-10: 3111304396
• | ISBN-13: 9783111304397