Search

The document is a preface to the Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2022 (ICNAAM-2022). The conference aims to bring together leading scientists in the field of Numerical and Applied Mathematics and attract high-quality research papers. The selection of papers included in the volume was based on an international peer review process. The preface expresses gratitude to the Scientific Committee, organizers, invited speakers, and others involved in the conference. It also mentions the inclusion of the Proceedings in the AIP Conference Proceedings series. The document provides information about the conference details, the European Society of Computational Methods in Sciences and Engineering (ESCMSE), and the categories of membership in the society. [Extracted from the article]

Linear programming is one of the basic concepts to further study in applied mathematics and optimization. If the constraints of the linear programming problem form a convex region, then the problem must have an optimal solution. Cube is convex and, in terms of geometry, cube is very special. Cube has some special properties that all edges are congruent and also the all sides are congruent. Other special properties of the cube are related to orthogonality and parallelism. This paper discus linear programming problems with cube constraints. This research is study literature research to describe linear programming problems with cube constraints on geometrical angle. Considering the peculiarities of a cube, this linear programming problem must have an optimal solution. The results show the following points: 1) A cube is a convex polyhedron; 2) The steps for solving linear programming with cube constraints are analogous to the steps for solving linear programming in two dimensions using the graphical method, finding all the vertices of the cube and calculating the value of the objective function at all of the vertices, and then determining the vertex point that produces the optimal value; 3) The problem can have a unique solution (vertex) or have infinitely many solutions (the points along the edges or on the side planes of the cube). [ABSTRACT FROM AUTHOR]

Graph theory can be said as one of the branches of applied mathematics that is currently developing. A problem can be explained in detail by simplifying it with graph theory. This paper concerns with graphs that are used in everyday life as a network system to describe parts of a structure in order to make it simpler and easier to understand. The network flow system is then applied in many disciplines, including applied mathematics, computer science, operations research, management, and engineering. [ABSTRACT FROM AUTHOR]

The paper summarizes the experience of teaching the academic English course to Russian students engaged in spaceflight dynamics studies at the Keldysh Institute of Applied Mathematics (KIAM) of RAS. Prerequisites for the course, methodological principles of teaching and some features of the course, as well as its perspectives, are described. [ABSTRACT FROM AUTHOR]

In this paper, bibliometric analysis of scientific literature published during the period 1996-2020 in.the field of Applied Mathematics has been presented using Scopus linked SCImago country ranking database. Further, India's contribution at global level is highlighted in particular using key bibliometric indicators namely document published, citations (external/self) and citations per document along with their annual corresponding growth to validate the findings. India is growing exponentially and contributing 2.5% to global research output with average 11.63% of annual corresponding growth. In addition, citations (external/self) and citations per document show average annual corresponding growth within ±5%. The outcomes of this study could foster new policies and the improvement in existing policies for various research activities especially for India. [ABSTRACT FROM AUTHOR]

This document is a preface to the Proceedings of the International Conference on Frontiers in Industrial and Applied Mathematics (FIAM) 2022. The conference was organized and hosted by the Department of Mathematics at the Central University of Haryana, India. The objective of the conference was to present and discuss new research findings in the field of industrial and applied mathematics. The conference included 18 technical sessions and 30 invited talks, with 95 selected papers presented by researchers from India and foreign countries. The organizers express gratitude to the sponsors and participants for their contributions to the success of the event. [Extracted from the article]

In this paper we present a numerical study of two streamwise supersonic vortices interaction. A pair of vortices was generated by two coaxial straight wings with sharp leading and trailing edges. Mach number of incoming flow was M∞ = 3. Two configurations are considered: a pair of co-rotating vortices and a pair of counter-rotating vortices. In the case of counter-rotating vortices the wings attack angle was 10 degrees. In the case of co-rotating vortices the attack angle of one of the wings was 10 degrees, the attack angle of other one was -10 degrees. Numerical data were obtained in the domain of 10 wing chords downstream from a wings axis by a computational model based on the URANS equations with SA turbulence model. Numerical simulations were performed on the hybrid supercomputing system K-60 at the Keldysh Institute of Applied Mathematics RAS using the developed software package ARES for 3D turbulent flows modeling on high performance computing systems. This work is a continuation of the series of author's works dedicated to the supersonic wingtip vortices. [ABSTRACT FROM AUTHOR]

In this paper we study asymptotic properties of solutions of nonlinear dynamic systems on time scales of the form yΔ(t) = f(t, y(t)), where f: 핋 x ℝn → ℝn, and 핋 is a time scale. For a given set Ω ⊂ 핋 x ℝn, we formulate conditions for function f which guarantee that at least one solution y of the above system stays in Ω. Unlike previous papers, we assume the set Ω in more general shape or we formulate the conditions guaranteeing an existence of bounded solution in easier and better verifiable form. Thanks to this, we can find a wider range of equations with bounded solutions. The example illustrating this type of equations is added. [ABSTRACT FROM AUTHOR]

The eigenvalue of a dynamical system can be used to determine the stability of such system. In general, the eigenvalues will form two kinds of spectrum, i.e. the continuous and point spectra. This paper will presents two methods for determining the spectrum of eigenvalues, i.e., the Sturm-Liouville Theory and the Evans function. In this paper we use the Fisher-Kolmogorov-Petrovsky--Pischunov equation, as well as the Newton Raphson and Runge Kutta methods for numerical calculations. [ABSTRACT FROM AUTHOR]

In this paper we study the asymptotic behavior of the Hausdorff distance between Heaviside function and the Epsilon and Omega distribution functions, introduced in [24], [28]. Investigations of "saturation to the horizontal asymptote a = 1, in the Hausdorff sense" is important for professionals working in the field of financial mathematics. We prove precise bound d = ln m m + O (1 m) . One of the most significant goals of any insurance risk activity is to achieve a satisfactory model for the probability distribution of the total claim amount. The estimates for the value of the best Hausdorff approximation of Heaviside function by fixed cumulative distribution function give more insight on the parameters in the strategy "Insurance responsibility". The results are relevant for applied insurance mathematics. Numerical examples using CAS Mathematica, illustrating our results are given. [ABSTRACT FROM AUTHOR]

In the present paper, the initial value problem for the third order partial differential equations with time delay in a Hilbert space with self-adjoint positive definite operator is investigated. The main theorem on stability of this problem is established. The application of this theorem is presented. [ABSTRACT FROM AUTHOR]

The second edition of the symposium on Mathematical Problems in Engineering focuses on new results of engineering researches carried out by using mathematical techniques. The aim of the Session is to collect relevant papers dealing with important approaches of applied mathematics, which have relevance to the engineering in the field of Computer Engineering, Engineering Applications of Aerospace and Intelligent Transportation Systems in order to create new collaborations between mathematicians and engineers. Papers are characterized by innovative models, methods and approaches that can found practical application to the engineering field or by new useful application of existing models to solve engineering problems. [ABSTRACT FROM AUTHOR]

The paper presents approaches to implementation of solution of discrete dynamical system of mutually repelling particles. Two platforms: a single-thread JAVA process and parallelized CUDA C solution, are employed for the dynamical simulation. Qualities of both platforms are discussed and explained as their performance when solving two proposed interaction laws is compared. [ABSTRACT FROM AUTHOR]

This paper presents a short survey on the recent result in the area of exact controllability of selected types of second order semilinear infinite dimensional dynamical systems. In particular, it shows the current state of knowledge in the area of trajectory controllability, boundry controllability and impulsive controllability, all for deterministic systems. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of some properties of the Laguerre transform.We define new properties of the Laguerre transform in a weighted L2-space. Moreover, we present some results concerning the action of this integral transform over some class of polynomials. [ABSTRACT FROM AUTHOR]

Probabilistic Evolution Approach (PEA) is a method recently developed for the solution of explicit ODEs. There is now a comprehensive knowledge accumulation for PEA. It is well known that the PEA truncation approximants converge to a unique limit representing the solution of the considered ODE in a finite region of the complex planes of the unknowns. The complement of the union of these regions to entire complex plane(s) is the subject of analytic continuation. In this paper we focus on this issue for the Van der Pol Equation. Paper gives the importance rather to the formalism and conceptuality. True implementations are left to future works. [ABSTRACT FROM AUTHOR]

The paper concerns the problem of local instability of thin facings of a sandwich panel. The classic analytical solutions are compared and examined. The Airy stress function is applied in the case of the state of plane stress and the state of plane strain. Wrinkling stress values are presented. The differences between the results obtained using the differential equations method and energy method are discussed. The relations between core strain energies are presented. [ABSTRACT FROM AUTHOR]

In this paper, we present a comprehensive study of Santilli's epoch making discoveries of isonumbers and their isoduals along with their application to isomechanics and its isodual for matter and antimatter, respectively [1]. [ABSTRACT FROM AUTHOR]

One of the natural questions which often appeared in algebra and analysis whether a map can be defined by its "local" properties. In this paper we consider maps which acts like a derivation on semirings of a special type. [ABSTRACT FROM AUTHOR]

In a recent paper [On Some Unified Integrals, Advances in Comput. Math. and Its Applications, Vol. 1, No. 3, PP. 151-153 (2012)], the author has evaluated three very interesting integrals involving hypergeometric function in terms of gamma function. In this paper, three new unified integrals involving Fox's H-function have been evaluated. By specializing the parameters, we can easily obtain a large number of new and known integrals including one obtained earlier by Garg and Mittal. The results established in this paper are simple, interesting, easily established and may be useful. [ABSTRACT FROM AUTHOR]

Portfolio Optimization (PO) is a problem in Finance, in which investor tries to maximize return and minimize risk by carefully choosing different assets. Expected return and risk are the most important parameters with regard to optimal portfolios. In the simple form PO can be modeled as quadratic programming problem which can be put into equivalent linear form. PO problems with the fuzzy parameters can be solved as multi-objective fuzzy linear programming problem. In this paper we give the solution to such problems with an illustrative example. [ABSTRACT FROM AUTHOR]

The data of real world applications generally cannot be expressed strictly. An efficient way of handling this situation is expressing the data as intervals. Thus this paper focuses on the Interval Fractional Transportation Problem (IFTP) in which all the parameters i.e. cost and preference coefficients of the objective function, supply and demand quantities are expressed as intervals. A Taylor series approach is presented for IFTP by means of the expression of intervals with its left and right limits. Also a numerical example is executed for the linear case to illustrate the procedure. [ABSTRACT FROM AUTHOR]

In this paper, stochastic orthogonal Runge-Kutta Chebyshev methods are dealt with for strong approximations to solutions of Itô stochastic differential equations (SDEs). Recently, strong first order methods for non-commutative Itô SDEs have been proposed by the present authors. It is known that when the number of stages is large, the methods have very large stability domains in mean square (MS) for a scalar linear test equation. On the other hand, Buckwar and Sickenberger (2012) have recently proposed MS stability analyses for systems of Itô SDEs. Our aim is to investigate MS stability properties of these methods and other existing numerical schemes by their approach. [ABSTRACT FROM AUTHOR]

This paper presents the concept of virtual stability, suggested as a fundamental characteristic of complex adaptive systems. A complex adaptive system is in a virtually stable state if, through self-monitoring and adaptive control, it maintains itself in a configuration or state that would otherwise be unstable. The energy expenditure required in order to sustain this condition gains the advantage of greater behavioral flexibility in the face of random environmental contingencies. A toy population model illustrating virtual stability is described. [ABSTRACT FROM AUTHOR]

In this paper, a Bernoulli matrix method is developed to find an approximate solution of high-order linear differential-difference equations with variable coeffcients under the mixed conditions. The solution is obtained in terms of Bernoulli polynomials. [ABSTRACT FROM AUTHOR]

Software networks are directed graphs of dependencies among entities (packages, classes, methods, etc.) found in a software system. These structures are used to study organizational software complexity and evolution. In this paper the prototype of software networks extractor - SNEIPL is described. SNEIPL uses enriched concrete syntax tree (eCST) representation of a source code. The benefit of such representation is that it enables independency of programming language. First experiences using SNEIPL showed that it correctly extracted isomorphic software networks from the source code of two structurally and semantically equivalent programs written in different programming languages. [ABSTRACT FROM AUTHOR]

In this paper we consider landmark-based image registration with compactly supported radial basis functions. Since using globally supported functions, as for example radial basis functions, a single landmark pair change may influence the whole registration result, in 2001 Fornefett et al. introduced the use of Wendland's compactly supported functions to define landmark-based image transformations [6]. Here we propose transformations defined by means of another family of compactly supported radial basis functions, known as Gneiting's functions [7, 5]. Firstly, we briefly review their definitions and properties. Secondly, numerical experiments are presented, where we compare Gneiting's functions with other interpolants. [ABSTRACT FROM AUTHOR]

The idea of this paper is to discuss some problems in coupling of analytical solutions and the finite element method for boundary value problems with a singularity. As an example we consider a problem from fracture mechanics in the plane. [ABSTRACT FROM AUTHOR]

The goal of this paper is to present what we think to be an interesting development of the concept of pivot variable. The inducing pivot variables induce probability measures which may be used to carry out inference. As illustration of this approach we will show how to obtain confidence intervals for the variance components of mixed linear models [ABSTRACT FROM AUTHOR]

In the present paper the two-step difference scheme for the telegraph equation is presented. The convergence estimate for the solution of the difference scheme is established. In applications, the convergence estimates for the solution of difference scheme for the numerical solution of two problems for hyperbolic equations are obtained. The theoretical statements for the solution of this difference scheme are supported by the results of the numerical experiment. [ABSTRACT FROM AUTHOR]

The aim of this paper is to study subsets of real linear n-normed spaces involving lacunary sequence and examine some topological and geometric properties of these sequence spaces. [ABSTRACT FROM AUTHOR]

In this paper, we study the convergence and divergence of the positive solutions of the system of difference equations, xn+1 = axn+yn, yn+1 = bynxn where x0,y0,a,b∈[0∞). [ABSTRACT FROM AUTHOR]

This paper presents a derivative-free nonmonotone hybrid tabu search to compute a solution of overdetermined systems of inequalities and equalities through the global optimization of an appropriate merit function. The proposed algorithm combines global and local searches aiming to reduce computational effort. Preliminary numerical results show the effectiveness of the combined heuristic. [ABSTRACT FROM AUTHOR]

In this paper we introduce some methods on the problem of distinguishing between a center and a focus and the theory of Hopf bifurcation for polynomial systems on the plane, and pose some open problems on the number of limit cycles. [ABSTRACT FROM AUTHOR]

The result of the general theory of the velocity dynamics of time-dependent chaotic billiards, according to the theory of Gelfriech and Turaev (2008), is that the average velocity of an ensemble of particles in a generic time-dependent billiard grows linearly with time [1]. This paper deals with the class of conformally driven time-dependent chaotic billiards which do not satisfy the assumptions of the theory about the properties of a generic system, which is analyzed in details. It is shown why the average velocity of an ensemble of conformally breathing billiards grows as ν∝t1/5. [ABSTRACT FROM AUTHOR]

The problem of finding of the partition dimension for a general graph is an NP-hard problem. Therefore, many studies of partition dimension of graphs are focused on particular classes of graphs. In this paper, we are interested in determining the partition dimension for the resulting graphs produced by the corona product between two graphs. In specific, we consider the partition dimension of the corona graphs K1⊙mKn, Pm⊙K1,n and K1,m⊙Kn where Pm,K1,n and Kn are a path order m, a star order n+1 and a complete graph order n, respectively. [ABSTRACT FROM AUTHOR]

This paper presents an approach which maximizes the profits of Islamic hire-purchase contract named Al-Ijarah Thumma Al-Bai' or AITAB. Details of modus operandi for the AITAB contract and the optimization model for profit sharing ratio determination using stochastic programming is the result of this study. [ABSTRACT FROM AUTHOR]

In this paper, we construct explicitly a multi-centered metric in (n+1)-dimensional static spacetimes which belong to a class of (pseudo)-Riemannian manifolds. Our starting point is to embed an n-dimensional complete manifold into an (n+1)-dimensional manifold which admits a timelike Killing vector. Then, the scalar curvature depends on the Laplace-Beltrami operator of the n-dimensional submanifold. This operator is set to be equals to the linear combination of the Dirac-delta function on the submanifold which can be thought of as remove points on (n+1)-dimensional manifold. Using completeness of the n-dimensional submanifold it can be shown that the solution does indeed exist. As an example we give the explicit form for flat Euclidean geometries, sphere, and hyperbolic geometries. [ABSTRACT FROM AUTHOR]

Over 100 years ago, E. H. Moore (1903), in his presidential address to the Mathematical Association of America, called for a unified mathematics curriculum built around the notion of functions but rejecting a completely axiomatic approach at the secondary level. Moore's address followed a major move to standardize the secondary school curriculum in 1894 in the report of the 'Committee of Ten.' Successive other calls for change and unification came across the decades but until 1989, the United States had little national direction about what the mathematics curriculum either could or should be at the pre-collegiate level. Since 1989, there has been a growing move to establish a national curriculum for the country, but the move continues to struggle. This paper outlines some of the recent history of the movement and suggests some barriers still in the way of achieving it. [ABSTRACT FROM AUTHOR]

This paper presents the results of differential attack on Mini-AES algorithm. The differential trails are constructed using all combinations of propagation ratio without repetition. To give practical results, we implement the key extraction for differential characteristics which have the highest and lowest probability as a comparison. Based on total propagation ratio and complexity resulted, Mini-AES algorithms are vulnerable to differential attack. The best differential characteristic is the differential characteristic using a single active s-box with the propagation ratio of 8 / 16. [ABSTRACT FROM AUTHOR]

For a graph G(V,E), an edge-covering of G is a family of different subgraphs H1,...Hk such that any edge of E belongs to at least one of the subgraphs Hi, 1 ≤ i ≤ k. If every Hi is isomorphic to a given graph H, then G admits an H-covering. Graph G is said to be H-magic if G has an H-covering and there is a total labeling f:V∪E→{1,2,...|V|+|E|} such that for each subgraph H′ = (V′,E′) of G isomorphic to H,ΣνƸV′f(ν)+ΣeƸE′f(e) is fixed constant. Furthermore, if f(V) = }1,2,...|V|{ then G is called H-supermagic. The sum of all vertex and edge labels on H, under a labeling f, is denoted by Σf(H). In this paper we study H-supermagic labeling for some classes of trees such as a double star, a caterpillar, a firecracker and a banana tree. [ABSTRACT FROM AUTHOR]

For any given two graphs G and H, we use the notation F→(G,H) to mean that in any red-blue coloring of the edges of F, the following must hold: F contains either a red subgraph G or a blue subgraph H. A graph F is a Ramsey (G,H)-minimal graph if F→(G,H) but F*↛(G,H) for any proper subgraph F* of F. Let R(G,H) be the class of all Ramsey (G,H)-minimal graphs. In this paper, we derive the properties of graphs belonging to R(3K2,P3). By using these properties we determine all graphs belonging to this class. [ABSTRACT FROM AUTHOR]

In this paper, we present numerical method for solving the Fredholm Integral Equation of the second kind with Cauchy kernel. The weighted Chebyshev polynomials of the second kind are used to approximate the unknown function. Inconstant coefficients are approximated by Chebyshev polynomials of the first kind. Special type of regular integrals are computed analytically. Finally, numerical results show the exactness and accuracy of the numerical method presented. [ABSTRACT FROM AUTHOR]

An f-coloring of graph G(V,E) is a generalized edge-coloring such that every vertex ν in V has at most f(ν) edges colored with a same color. There are many applications of the f-coloring, for instance we can use it in order to solve some scheduling problems and some network design problems. The minimum number of colors needed to f-color G is called an the f-chromatic index of G, denoted by χ′f(G). Any graph G has f-chromatic index equal to Δf(G) or Δf(G)+1, where Δf(G) = maxνƸV{[ceiling_left]d(ν)/f(ν)[ceiling_right]}. G is called in the class-1, denoted by G Ƹ Cf 1, if χ′f(G) = Δf(G); otherwise G is called in the class-2, denoted by G Ƹ Cf 2. In this paper, we show that the corona product of Cn with Sm is in Cf 1. Besides that, we characterize the corona product of Cn with either Wn or Kn based on f-coloring. [ABSTRACT FROM AUTHOR]