On the variational iteration method and other iterative techniques for nonlinear differential equations

The purpose of this study is to develop a numerical method for bifurcation analysis of nonlinear partial differential equations, based on the reduction of partial differential equations to ordinary ones, using the Kolmogorov-Arnold theorem. Methods. This paper describes a method for reducing partial differential equations to ordinary ones using the Kolmogorov-Arnold theorem, as well as methods for the bifurcation analysis of nonlinear boundary value problems for ordinary differential equations. Results. The paper presents a new method for solving and bifurcation analysis of nonlinear boundary value problems for partial differential equations, which allow variational formulation. The method was applied to a nonlinear two-dimensional Bratu problem with Dirichlettype boundary conditions. Conclusion. A new method of bifurcation analysis for nonlinear partial differential equations has been developed. Specifically, a method has been proposed for reducing partial different equations to ordinary equations, which allows the use of the developed apparatus of bifurcation analysis for boundary value problems of ordinary differential equations. This method allows conducting bifurcation analysis for arbitrary nonlinear partial differential equations.

The Green’s function is widely used in solving boundary value problems for differential equations, to which many mathematical and physical problems are reduced. In particular, solutions of partial differential equations by the Fourier method are reduced to boundary value problems for ordinary differential equations. Using the Green's function for a homogeneous problem, one can calculate the solution of an inhomogeneous differential equation. Knowing the Green's function makes it possible to solve a whole class of problems of finding eigenvalues in quantum field theory. The developed method for constructing the Green’s function of boundary value problems for ordinary linear differential equations is described. An algorithm and program for calculating the Green's function of boundary value problems for differential equations of the second and third orders in an explicit analytical form are presented. Examples of computing the Green's function for specific boundary value problems are given. The fundamental system of solutions of ordinary differential equations with singular points needed to construct the Green's function is calculated in the form of generalized power series with the help of the developed programs in the Maple environment. An algorithm is developed for constructing the Green's function in the form of power series for second-order and third-order differential equations with given boundary conditions. Compiled work programs in the Maple environment for calculating the Green functions of arbitrary boundary value problems for differential equations of the second and third orders. Calculations of the Green's function for specific third-order boundary value problems using the developed program are presented. The obtained approximate Green’s function is compared with the known expressions of the exact Green’s function and very good agreement is found

The mathematical modeling of numerous real-world applications results in hierarchical optimization problems with two decision makers where at least one of them has to solve an optimal control problem of ordinary or partial differential equations. Such models are referred to as bilevel optimal control problems. Here, we first review some different features of bilevel optimal control including important applications, existence results, solution approaches, and optimality conditions. Afterwards, we focus on a specific problem class where parameters appearing in the objective functional of an optimal control problem of partial differential equations have to be reconstructed. After verifying the existence of solutions, necessary optimality conditions are derived by exploiting the optimal value function of the underlying parametric optimal control problem in the context of a relaxation approach.

A method for constructing a solution for some systems of first-order quasilinear partial differential equations is presented. The type of equations can either be hyperbolic or elliptic. The method is based on the application of the generalized hodograph method, which allows us to write the solution in an implicit form. There is a system of first-order linear partial differential equations that is used for commuting flows in the generalized hodograph method. We discover an analogy between the commuting flows and divided differences for the Hermite polynomial. This analogy allows us to obtain an explicit representation for commuting flows. The introduction of new (Lagrangian) variables, which are conserved on the characteristics of the original system, suggests a way to transform the solution of the Cauchy problem for first-order quasilinear partial differential equations to the solution of the Cauchy problem for ordinary differential equations. Numerical, and in some cases analytical, integration of the Cauchy problem makes it possible to construct explicit solutions of the problem on the level lines (isochrons) of the implicit solution. The method proposed is significantly different from the grid method, finite element method, finite volume method, and, in fact, is more precise. The error of the solution can arise only at the last stage in the numerical integration of the Cauchy problem for ordinary differential equations. Moreover, the method allows us to obtain multivalued solutions, in particular, to study the process of wave breaking in hyperbolic systems. Particular cases of the equations considered here describe diffusion-free approximation in a wide range of mass transport processes in multicomponent mixtures, such as electrophoresis, chromatography, centrifugation. As a simple example, the solution of the electrophoresis problem (separation multicomponent mixture to individual component) is presented.KeywordsGeneralized hodograph methodCommuting flowsDivided differenceMathematical Subject Classification (2000)35L4535L4035L65

“The last decade has seen such a deluge of papers on the numerical solution of the initial value problems for ordinary differential equations that it is quite impracticable to list, far less to summarize, all the contributions.” These are the opening words of J. D. Lambert’s paper [54] in the State of the Art 1976 Conference Proceedings. In spite of such a disclaimer, the paper succeeds in presenting, in less than fifty large-print pages, a unified view of all that, at the time of its writing, was known on numerical initial-value problems (IVP) for ordinary differential equations (ODEs). Ten years later, the subject was just too big and although the State of the Art 1986 Conference [50] featured three ODE speakers (J.D. Lambert, A.R. Curtis and G. Wanner), their combined contributions are very far from surveying all the numerical ODE field.

Furthering research on linear multistep hybrid block methods is essential to enhance accuracy, stability, and efficiency in solving ordinary differential equations, enabling advanced modelling of complex systems across science and engineering for better predictive analysis and real-world applications. In this study, an efficient linear multistep hybrid block method with a single-step and seven off-step points for the direct numerical integration of fifth-order initial value problems (IVPs) in ordinary differential equations (ODEs), eliminating the need for reduction to a system of first-order ODEs is proposed. The method is constructed using a collocation approach at both grid and off-grid points, alongside interpolation at five off-grid points, to approximate the solution via a power series polynomial. The resulting system of equations is solved to obtain the necessary discrete and additional formulae that constitute the block approach. A comprehensive theoretical analysis confirms that the method possesses desirable numerical properties, including a well-defined order, zero stability, consistency, convergence, and absolute stability. Comparative numerical experiments against existing methods demonstrate that the proposed approach achieves superior accuracy and efficiency, making it a promising tool for solving both linear and nonlinear fifth-order ODEs.

This work presents a review and analysis of modern asymptotic methods for analysis of singularly perturbed problems with interior and boundary layers. The central part of the work is a review of the work of the author and his colleagues and disciples. It highlights boundary and initial-boundary value problems for nonlinear elliptic and parabolic partial differential equations, as well as periodic parabolic problems, which are widely used in applications and are called reaction–diffusion and reaction–diffusion–advection equations. These problems can be interpreted as models in chemical kinetics, synergetics, astrophysics, biology, and other fields. The solutions of these problems often have both narrow boundary regions of rapid change and inner layers of various types (contrasting structures, moving interior layers: fronts), which leads to the need to develop new asymptotic methods in order to study them both formally and rigorously. A general scheme for a rigorous study of contrast structures in singularly perturbed problems for partial differential equations, based on the use of the asymptotic method of differential inequalities, is presented and illustrated on relevant problems. The main achievements of this line of studies of partial differential equations are reflected, and the key directions of its development are indicated.

Controllability and feedback systems

The method of finite differences is one of fundamental techniques for solving boundary value problems of ordinary and partial differential equations, where ordinary and partial derivatives are replaced by divided differences.

This article addresses the general problem of establishing upper bounds for the norms of the nth powers of square matrices. The focus is on upper bounds that grow only moderately (or stay constant) where n, or the order of the matrices, increases. The so-called resolvant condition, occuring in the famous Kreiss matrix theorem, is a classical tool for deriving such bounds.Recently the classical upper bounds known to be valid under Kreiss's resolvant condition have been improved. Moreover, generalizations of this resolvant condition have been considered so as to widen the range of applications. The main purpose of this article is to review and extend some of these new developments.The upper bounds for the powers of matrices discussed in this article are intimately connected with the stability analysis of numerical processes for solving initial(-boundary) value problems in ordinary and partial linear differential equations. The article highlights this connection.The article concludes with numerical illustrations in the solution of a simple initial-boundary value problem for a partial differential equation.

We provide a new variational principle and duality for the problem 𝐿𝑢 = ∇𝐺(𝑢), where 𝐿 is selfadjoint and ∇𝐺 is a gradient mapping such that 𝐺 satisfies superquadratic growth conditions. The results obtained can be applied to Dirichlet problems for both ordinary and partial differential equations.

Numerical ranges and stability estimates

Introductory remarks. It is known that the problem of finding solutions of nonlinear functional equations (e.g., nonlinear integral equations, boundary value problems for nonlinear ordinary and partial differential equations, etc.) can be formulated in terms of finding fixed points of a given nonlinear mapping defined on some subset of an infinite dimensional functional space. For compact mappings a general existence theory of fixed points based upon topological arguments has been constructed over a number of decades (associated with the names of Brouwer, Poincar#x00E9;, Lefschetz, Schauder, Leray, Tichonoff, Rothe, Krasnoselsky, Altman, and others). More recently, there has begum a systematic study of fixed points (their existence and actual construction) of various classes of noncompact mappings (Brodski-Milman [2], De Marr [28], Browder [3a, 3b, 5, 6, 4], Kirk 23, Kachurovsky [2l], Edelstein [11,12,13], Belluce-Kirk [1], Gohde [l9, 20], De Prima [l0], Lions and Stampacchia [27], Browder-Petryshyn [8, 9], Kaniel [22], Shinbrot [40], Petryshyn [31, 32, 33, 35, 36], Opial [30], Lees-Schultz [26], de Figueiredo [15, 16], Browder-de Figueiredo [7], Petryshyn-Tucker [37], and others).

A projective Newton method is presented for the numerical solution of semilinear operator equations in Banach spaces and its convergence properties are studied. Applications to boundary value problems for nonlinear ordinary and partial differential equations are discussed

This paper presents a general method to obtain stability inequalities for diskrete analogues of boundary value problems for nonlinear ordinary or partial differential equations. Basically it is shown how monotonicity or symmetry conditions yield stability inequalities if the range of the difference quotients of the nonlinearity in the differential equation would not intersect the spectrum of the linear differential operator. Our approach contains and extends a number of known results of the literature.