The paper reports on an iteration algorithm to compute asymptotic solutions at any order for a wide class of nonlinear
singularly perturbed difference equations.
The document discusses partial differential equations (PDEs) and numerical methods for solving them. It begins by defining PDEs as equations involving derivatives of an unknown function with respect to two or more independent variables. PDEs describe many physical phenomena involving variations across space and time, such as fluid flow, heat transfer, electromagnetism, and weather prediction. The document then focuses on solving elliptic, parabolic, and hyperbolic PDEs numerically using finite difference and finite element methods. It provides examples of discretizing and solving the Laplace, heat, and wave equations to estimate unknown functions.
This document discusses orthogonal functions and polynomial solutions to three specific second order differential equations: the Legendre, Laguerre, and Hermite equations. It shows that polynomial solutions to these equations are orthogonal using Sturm-Liouville theory. This allows functions to be written as Fourier series with respect to the orthogonal polynomial solutions. The Legendre, Laguerre, and Hermite polynomials are explicitly derived and shown to be orthogonal with respect to certain weight functions on their domains.
The document discusses linear partial differential equations (PDEs) with constant coefficients. It defines such PDEs and provides examples. It describes how to find the general solution of homogeneous linear PDEs with constant coefficients by finding the roots of the auxiliary equation. The general solution consists of the complementary function plus a particular integral. Methods for finding the particular integral when the right side consists of powers of x and y are also presented.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document discusses various topics related to differential equations including:
1. Linear differential equations of nth order with constant coefficients and the characteristic equation. The general solution depends on whether the roots of the characteristic equation are real/complex, distinct/multiple.
2. Finding the complementary function and particular integral to get the general solution for a second order differential equation with constant coefficients.
3. Solving simultaneous linear differential equations using the D-operator method and Laplace transform method.
4. Changing dependent and independent variables to solve second order differential equations numerically using an approximation technique similar to the trapezoid rule.
Numerical Solution of Nth - Order Fuzzy Initial Value Problems by Fourth Orde...IOSR Journals
In this paper, a numerical method for Nth - order fuzzy initial value problems (FIVP) based on
Seikkala derivative of fuzzy process is studied. The fourth order Runge-Kutta method based on Centroidal Mean
(RKCeM4) is used to find the numerical solution and the convergence and stability of the method is proved. This
method is illustrated by solving second and third order FIVPs. The results show that the proposed method suits
well to find the numerical solution of Nth – order FIVPs.
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMSTahia ZERIZER
In this article, we study boundary value problems of a large
class of non-linear discrete systems at two-time-scales. Algorithms are given to implement asymptotic solutions for any order of approximation.
The document discusses partial differential equations (PDEs) and numerical methods for solving them. It begins by defining PDEs as equations involving derivatives of an unknown function with respect to two or more independent variables. PDEs describe many physical phenomena involving variations across space and time, such as fluid flow, heat transfer, electromagnetism, and weather prediction. The document then focuses on solving elliptic, parabolic, and hyperbolic PDEs numerically using finite difference and finite element methods. It provides examples of discretizing and solving the Laplace, heat, and wave equations to estimate unknown functions.
This document discusses orthogonal functions and polynomial solutions to three specific second order differential equations: the Legendre, Laguerre, and Hermite equations. It shows that polynomial solutions to these equations are orthogonal using Sturm-Liouville theory. This allows functions to be written as Fourier series with respect to the orthogonal polynomial solutions. The Legendre, Laguerre, and Hermite polynomials are explicitly derived and shown to be orthogonal with respect to certain weight functions on their domains.
The document discusses linear partial differential equations (PDEs) with constant coefficients. It defines such PDEs and provides examples. It describes how to find the general solution of homogeneous linear PDEs with constant coefficients by finding the roots of the auxiliary equation. The general solution consists of the complementary function plus a particular integral. Methods for finding the particular integral when the right side consists of powers of x and y are also presented.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document discusses various topics related to differential equations including:
1. Linear differential equations of nth order with constant coefficients and the characteristic equation. The general solution depends on whether the roots of the characteristic equation are real/complex, distinct/multiple.
2. Finding the complementary function and particular integral to get the general solution for a second order differential equation with constant coefficients.
3. Solving simultaneous linear differential equations using the D-operator method and Laplace transform method.
4. Changing dependent and independent variables to solve second order differential equations numerically using an approximation technique similar to the trapezoid rule.
Numerical Solution of Nth - Order Fuzzy Initial Value Problems by Fourth Orde...IOSR Journals
In this paper, a numerical method for Nth - order fuzzy initial value problems (FIVP) based on
Seikkala derivative of fuzzy process is studied. The fourth order Runge-Kutta method based on Centroidal Mean
(RKCeM4) is used to find the numerical solution and the convergence and stability of the method is proved. This
method is illustrated by solving second and third order FIVPs. The results show that the proposed method suits
well to find the numerical solution of Nth – order FIVPs.
SOLVING BVPs OF SINGULARLY PERTURBED DISCRETE SYSTEMSTahia ZERIZER
In this article, we study boundary value problems of a large
class of non-linear discrete systems at two-time-scales. Algorithms are given to implement asymptotic solutions for any order of approximation.
Let f(z) be a function continuous at a point z0.
To show that f(z) is also continuous at z0, we need to show:
limz→z0 f(z) = f(z0)
Since f(z) is given to be continuous at z0, by the definition of continuity:
limz→z0 f(z) = f(z0)
Therefore, if f(z) is continuous at a point z0, it automatically satisfies the condition for continuity at z0. Hence, f(z) is also continuous at z0.
So in summary, if a function f(z) is continuous at a
An approach to Fuzzy clustering of the iris petals by using Ac-meansijsc
This paper proposes a definition of a fuzzy partition element based on the homomorphism between type-1 fuzzy sets and the three-valued Kleene algebra. A new clustering method
based on the C-means algorithm, using the defined partition, is presented in this paper, which will
be validated with the traditional iris clustering problem by measuring its petals.
This document provides an overview of Floquet theory and periodic differential equations. It begins by introducing periodic differential equations and framing their solution in terms of spectral theory and eigenvalue problems. It then covers key results of Floquet theory, including that any periodic differential equation has a non-trivial solution that is periodic up to a constant multiplier. The document defines Hill's equation and shows how general periodic differential equations can be transformed into this form. It concludes by examining cases for the discriminant of Hill's equation that determine the nature of the solutions.
This document discusses Newton's method for solving systems of nonlinear equations. It begins by introducing Newton's method in one dimension and extending it to multiple dimensions using a Jacobian matrix. It then proves that under certain conditions, Newton's method will converge quadratically to the solution. An example is provided to illustrate computing the Jacobian and using Newton's method. The document also discusses shooting methods for solving boundary value problems by converting them into initial value problems through an initial guess of a boundary condition.
This presentation gives the basic idea about the methods of solving ODEs
The methods like variation of parameters, undetermined coefficient method, 1/f(D) method, Particular integral and complimentary functions of an ODE
11.solution of a singular class of boundary value problems by variation itera...Alexander Decker
1) The document proposes an effective methodology called the variation iteration method to find solutions to singular second order linear and nonlinear boundary value problems.
2) The variation iteration method constructs a sequence of correction functionals to iteratively solve the boundary value problem. It is shown that the limit of the convergent iterative sequence obtained from this method is the exact solution.
3) The convergence of the iterative sequence generated by the variation iteration method is analyzed. It is established that the sequence converges to the exact solution under certain continuity conditions on the problem functions.
The document is an introduction to ordinary differential equations prepared by Ahmed Haider Ahmed. It defines key terms like differential equation, ordinary differential equation, partial differential equation, order, degree, and particular and general solutions. It then provides methods for solving various types of first order differential equations, including separable, homogeneous, exact, linear, and Bernoulli equations. Specific examples are given to illustrate each method.
The document provides an overview of first order differential equations and methods for solving them. It discusses linear equations and introduces the method of variation of parameters for finding the general solution to a linear ODE. It also covers exact equations and defines an exact differential equation as one that can be written as M(x,y)dx + N(x,y)dy = 0, where M and N are functions of both x and y and satisfy ∂M/∂y = ∂N/∂x. Examples are provided to demonstrate solving techniques.
This document provides a summary of a project report on bifurcation analysis and its applications. It discusses key concepts in nonlinear systems such as equilibrium points, stability, linearization, and bifurcations including saddle node, transcritical, pitchfork and Hopf bifurcations. Examples are given to illustrate each type of bifurcation. Population models involving competition and prey-predator interactions are also discussed. The document outlines the contents which cover preliminary remarks, local theory of nonlinear systems, different types of bifurcations, and applications to population models.
The document discusses numerical methods for solving ordinary differential equations (ODEs), including Taylor's series method and Picard's method. It provides examples of applying Taylor's series method to approximate solutions of first order ODEs at different values of x to 4-5 decimal places of accuracy. The examples given include solving ODEs with initial conditions and computing solutions at multiple x values by taking terms from the Taylor series expansion.
The International Journal of Engineering and Science (The IJES)theijes
The document summarizes a study that uses Painleve analysis to solve a nonlinear partial differential equation (NLPDE). It begins by introducing Painleve analysis and its use in investigating the integrability of NLPDEs. It then outlines the methodology, implementing the Painleve analysis on the Boussinesq equation to obtain its exact traveling wave solution. Specifically, it obtains the exponents and coefficients of the Laurent series, identifies the dominant terms, and truncates the series to define a transformation. This yields an exact solitary wave solution to the Boussinesq equation.
A common fixed point theorem in cone metric spacesAlexander Decker
This academic article summarizes a common fixed point theorem for continuous and asymptotically regular self-mappings on complete cone metric spaces. The theorem extends previous results to cone metric spaces, which generalize metric spaces by replacing real numbers with an ordered Banach space. It proves that under certain contractive conditions, the self-mapping has a unique fixed point. The proof constructs a Cauchy sequence that converges to the fixed point.
Fixed points of contractive and Geraghty contraction mappings under the influ...IJERA Editor
In this paper, we prove the existence of fixed points of contractive and Geraghty contraction maps in complete metric spaces under the influence of altering distances. Our results extend and generalize some of the known results.
Solution of a singular class of boundary value problems by variation iteratio...Alexander Decker
1. The document proposes an effective methodology called the variation iteration method to find solutions to a general class of singular second-order linear and nonlinear boundary value problems.
2. The variation iteration method generates a sequence of correction functionals that converges to the exact solution of the boundary value problem.
3. The author applies the variation iteration method to solve a specific class of boundary value problems and derives the sequence of correction functionals. Convergence of the iterative sequence is also analyzed.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A comparison has been made between approximation of triangular fuzzy systems and the corresponding fuzzy triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular fuzzy numbers are also found.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular
fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to
aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of
triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A
comparison has been made betweenapproximation of triangular fuzzy systems and the corresponding fuzzy
triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular
fuzzy numbers are also found.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular
fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to
aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of
triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A
comparison has been made betweenapproximation of triangular fuzzy systems and the corresponding fuzzy
triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular
fuzzy numbers are also found.
Numerical solution of boundary value problems by piecewise analysis methodAlexander Decker
This document presents a numerical method called Piecewise-Homotopy Analysis Method (P-HAM) for solving fourth-order boundary value problems. P-HAM is based on the Homotopy Analysis Method (HAM) but uses multiple auxiliary parameters, with each parameter applied over a sub-range of the domain for improved accuracy. The document outlines the basic steps of P-HAM, including constructing the zero-order deformation equation and deriving the governing equations. It then applies P-HAM to solve two example problems and compares the results to other numerical methods.
How to Solve a Partial Differential Equation on a surfacetr1987
Familiar techniques of separation of variables and Fourier series can be used to solve a variety of pde based on domains in the plane, however these techniques do not extend naturally to surface problems. Instead we look to take a computational approach. The talk will cover the basics of finite difference and finite element approximations of the one dimensional heat equation and show how to extend these ideas on to surfaces. If time allows, we will show numerical results of an optimal partition problem based on a sphere. No background knowledge of pde or computation is required.
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALESTahia ZERIZER
In this article we study a general model of nonlinear difference equations including small parameters of multiple scales. For two kinds of perturbations, we describe algorithmic methods giving asymptotic solutions to boundary value problems.
The problem of existence and uniqueness of the solution is also addressed.
An Approach For Solving Nonlinear Programming ProblemsMary Montoya
This document presents an approach for solving nonlinear programming problems using measure theory. It begins by transforming a nonlinear programming problem into an optimal control problem by treating the variables as time-varying and integrating the objective and constraint functions. It then solves the optimal control problem using measure theory by representing the control-trajectory pair as a positive Radon measure on the space of trajectories and controls. Finally, it shows that the optimal solution to the transformed optimal control problem provides an approximate optimal solution to the original nonlinear programming problem.
Existance Theory for First Order Nonlinear Random Dfferential Equartioninventionjournals
In this paper, the existence of a solution of nonlinear random differential equation of first order is proved under Caratheodory condition by using suitable fixed point theorem. 2000 Mathematics Subject Classification: 34F05, 47H10, 47H4
Let f(z) be a function continuous at a point z0.
To show that f(z) is also continuous at z0, we need to show:
limz→z0 f(z) = f(z0)
Since f(z) is given to be continuous at z0, by the definition of continuity:
limz→z0 f(z) = f(z0)
Therefore, if f(z) is continuous at a point z0, it automatically satisfies the condition for continuity at z0. Hence, f(z) is also continuous at z0.
So in summary, if a function f(z) is continuous at a
An approach to Fuzzy clustering of the iris petals by using Ac-meansijsc
This paper proposes a definition of a fuzzy partition element based on the homomorphism between type-1 fuzzy sets and the three-valued Kleene algebra. A new clustering method
based on the C-means algorithm, using the defined partition, is presented in this paper, which will
be validated with the traditional iris clustering problem by measuring its petals.
This document provides an overview of Floquet theory and periodic differential equations. It begins by introducing periodic differential equations and framing their solution in terms of spectral theory and eigenvalue problems. It then covers key results of Floquet theory, including that any periodic differential equation has a non-trivial solution that is periodic up to a constant multiplier. The document defines Hill's equation and shows how general periodic differential equations can be transformed into this form. It concludes by examining cases for the discriminant of Hill's equation that determine the nature of the solutions.
This document discusses Newton's method for solving systems of nonlinear equations. It begins by introducing Newton's method in one dimension and extending it to multiple dimensions using a Jacobian matrix. It then proves that under certain conditions, Newton's method will converge quadratically to the solution. An example is provided to illustrate computing the Jacobian and using Newton's method. The document also discusses shooting methods for solving boundary value problems by converting them into initial value problems through an initial guess of a boundary condition.
This presentation gives the basic idea about the methods of solving ODEs
The methods like variation of parameters, undetermined coefficient method, 1/f(D) method, Particular integral and complimentary functions of an ODE
11.solution of a singular class of boundary value problems by variation itera...Alexander Decker
1) The document proposes an effective methodology called the variation iteration method to find solutions to singular second order linear and nonlinear boundary value problems.
2) The variation iteration method constructs a sequence of correction functionals to iteratively solve the boundary value problem. It is shown that the limit of the convergent iterative sequence obtained from this method is the exact solution.
3) The convergence of the iterative sequence generated by the variation iteration method is analyzed. It is established that the sequence converges to the exact solution under certain continuity conditions on the problem functions.
The document is an introduction to ordinary differential equations prepared by Ahmed Haider Ahmed. It defines key terms like differential equation, ordinary differential equation, partial differential equation, order, degree, and particular and general solutions. It then provides methods for solving various types of first order differential equations, including separable, homogeneous, exact, linear, and Bernoulli equations. Specific examples are given to illustrate each method.
The document provides an overview of first order differential equations and methods for solving them. It discusses linear equations and introduces the method of variation of parameters for finding the general solution to a linear ODE. It also covers exact equations and defines an exact differential equation as one that can be written as M(x,y)dx + N(x,y)dy = 0, where M and N are functions of both x and y and satisfy ∂M/∂y = ∂N/∂x. Examples are provided to demonstrate solving techniques.
This document provides a summary of a project report on bifurcation analysis and its applications. It discusses key concepts in nonlinear systems such as equilibrium points, stability, linearization, and bifurcations including saddle node, transcritical, pitchfork and Hopf bifurcations. Examples are given to illustrate each type of bifurcation. Population models involving competition and prey-predator interactions are also discussed. The document outlines the contents which cover preliminary remarks, local theory of nonlinear systems, different types of bifurcations, and applications to population models.
The document discusses numerical methods for solving ordinary differential equations (ODEs), including Taylor's series method and Picard's method. It provides examples of applying Taylor's series method to approximate solutions of first order ODEs at different values of x to 4-5 decimal places of accuracy. The examples given include solving ODEs with initial conditions and computing solutions at multiple x values by taking terms from the Taylor series expansion.
The International Journal of Engineering and Science (The IJES)theijes
The document summarizes a study that uses Painleve analysis to solve a nonlinear partial differential equation (NLPDE). It begins by introducing Painleve analysis and its use in investigating the integrability of NLPDEs. It then outlines the methodology, implementing the Painleve analysis on the Boussinesq equation to obtain its exact traveling wave solution. Specifically, it obtains the exponents and coefficients of the Laurent series, identifies the dominant terms, and truncates the series to define a transformation. This yields an exact solitary wave solution to the Boussinesq equation.
A common fixed point theorem in cone metric spacesAlexander Decker
This academic article summarizes a common fixed point theorem for continuous and asymptotically regular self-mappings on complete cone metric spaces. The theorem extends previous results to cone metric spaces, which generalize metric spaces by replacing real numbers with an ordered Banach space. It proves that under certain contractive conditions, the self-mapping has a unique fixed point. The proof constructs a Cauchy sequence that converges to the fixed point.
Fixed points of contractive and Geraghty contraction mappings under the influ...IJERA Editor
In this paper, we prove the existence of fixed points of contractive and Geraghty contraction maps in complete metric spaces under the influence of altering distances. Our results extend and generalize some of the known results.
Solution of a singular class of boundary value problems by variation iteratio...Alexander Decker
1. The document proposes an effective methodology called the variation iteration method to find solutions to a general class of singular second-order linear and nonlinear boundary value problems.
2. The variation iteration method generates a sequence of correction functionals that converges to the exact solution of the boundary value problem.
3. The author applies the variation iteration method to solve a specific class of boundary value problems and derives the sequence of correction functionals. Convergence of the iterative sequence is also analyzed.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A comparison has been made between approximation of triangular fuzzy systems and the corresponding fuzzy triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular fuzzy numbers are also found.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular
fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to
aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of
triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A
comparison has been made betweenapproximation of triangular fuzzy systems and the corresponding fuzzy
triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular
fuzzy numbers are also found.
AGGREGATION OF OPINIONS FOR SYSTEM SELECTION USING APPROXIMATIONS OF FUZZY NU...mathsjournal
In this article we assume that experts express their view points by way of approximation of Triangular
fuzzy numbers. We take the help of fuzzy set theory concept to model the situation and present a method to
aggregate these approximations of triangular fuzzy numbers to obtain an overall approximation of
triangular fuzzy number for each system and then linear ordering done before the best system is chosen. A
comparison has been made betweenapproximation of triangular fuzzy systems and the corresponding fuzzy
triangular numbers systems. The notions like fuzziness and ambiguity for the approximation of triangular
fuzzy numbers are also found.
Numerical solution of boundary value problems by piecewise analysis methodAlexander Decker
This document presents a numerical method called Piecewise-Homotopy Analysis Method (P-HAM) for solving fourth-order boundary value problems. P-HAM is based on the Homotopy Analysis Method (HAM) but uses multiple auxiliary parameters, with each parameter applied over a sub-range of the domain for improved accuracy. The document outlines the basic steps of P-HAM, including constructing the zero-order deformation equation and deriving the governing equations. It then applies P-HAM to solve two example problems and compares the results to other numerical methods.
How to Solve a Partial Differential Equation on a surfacetr1987
Familiar techniques of separation of variables and Fourier series can be used to solve a variety of pde based on domains in the plane, however these techniques do not extend naturally to surface problems. Instead we look to take a computational approach. The talk will cover the basics of finite difference and finite element approximations of the one dimensional heat equation and show how to extend these ideas on to surfaces. If time allows, we will show numerical results of an optimal partition problem based on a sphere. No background knowledge of pde or computation is required.
NONLINEAR DIFFERENCE EQUATIONS WITH SMALL PARAMETERS OF MULTIPLE SCALESTahia ZERIZER
In this article we study a general model of nonlinear difference equations including small parameters of multiple scales. For two kinds of perturbations, we describe algorithmic methods giving asymptotic solutions to boundary value problems.
The problem of existence and uniqueness of the solution is also addressed.
An Approach For Solving Nonlinear Programming ProblemsMary Montoya
This document presents an approach for solving nonlinear programming problems using measure theory. It begins by transforming a nonlinear programming problem into an optimal control problem by treating the variables as time-varying and integrating the objective and constraint functions. It then solves the optimal control problem using measure theory by representing the control-trajectory pair as a positive Radon measure on the space of trajectories and controls. Finally, it shows that the optimal solution to the transformed optimal control problem provides an approximate optimal solution to the original nonlinear programming problem.
Existance Theory for First Order Nonlinear Random Dfferential Equartioninventionjournals
In this paper, the existence of a solution of nonlinear random differential equation of first order is proved under Caratheodory condition by using suitable fixed point theorem. 2000 Mathematics Subject Classification: 34F05, 47H10, 47H4
PaperNo14-Habibi-IJMA-n-Tuples and ChaoticityMezban Habibi
This document presents theorems and definitions related to n-tuples of operators on a Frechet space and conditions for chaoticity. It begins with definitions of key concepts such as the orbit of a vector under an n-tuple of operators and what it means for an n-tuple to be hypercyclic or for a vector to be periodic. The main results section presents two theorems, the first characterizing when an n-tuple satisfies the hypercyclicity criterion and the second proving conditions under which an n-tuple of weighted backward shifts is chaotic. The second theorem shows the equivalence of an n-tuple being chaotic, hypercyclic with a non-trivial periodic point, having a non-trivial periodic point, and a
The existence of common fixed point theorems of generalized contractive mappi...Alexander Decker
The document presents a common fixed point theorem for a sequence of self maps satisfying a generalized contractive condition in a non-normal cone metric space. It begins with introducing concepts such as cone metric spaces, normal and non-normal cones, and generalized contraction mappings. It then proves the main theorem: if a sequence of self maps {Tn} on a complete cone metric space X satisfies a generalized contractive condition with constants α, β, γ, δ, η, μ ∈ [0,1] such that their sum is less than 1, and x0 ∈ X with xn = Tnxn-1, then the sequence {xn} converges to a unique common fixed point v of the maps
11.fixed point theorem of discontinuity and weak compatibility in non complet...Alexander Decker
The document presents a theorem about fixed points for six self-maps in a non-complete non-Archimedean Menger PM-space. The theorem proves that the six maps have a unique common fixed point under certain conditions, including:
1) The maps satisfy inequality conditions involving probabilistic metric functions.
2) One of the subspaces induced by two of the maps is complete.
3) The pairs of maps are R-weakly compatible.
The proof constructs a Cauchy sequence and uses properties of probabilistic metric functions and the given conditions to show the sequence converges, establishing a common fixed point.
Fixed point theorem of discontinuity and weak compatibility in non complete n...Alexander Decker
The document presents a theorem about fixed points for six self-maps in a non-complete non-Archimedean Menger PM-space. The theorem proves that the six maps have a unique common fixed point under certain conditions, including:
1) The maps satisfy inequality conditions involving probabilistic metric functions.
2) One of the subspaces induced by two of the maps is complete.
3) The pairs of maps are R-weakly compatible.
The proof constructs a Cauchy sequence and uses properties of probabilistic metric spaces and weak compatibility to show the maps have a common fixed point.
This document summarizes a presentation on random entire functions. It discusses three classical families of random entire functions - Gaussian, Rademacher, and Steinhaus entire functions. It presents several theorems regarding inequalities concerning the maximum modulus and zeros of random entire functions. Specifically, it shows that the weighted zero counting function of random entire functions in family Y is close to the logarithm of the maximum modulus function, with an error term that is independent of the probability space. It also establishes an analogy of Nevanlinna's second main theorem for random entire functions in family Y.
This document discusses methods for solving algebraic and transcendental equations. It begins by defining key terms like roots, simple roots, and multiple roots. It then distinguishes between direct and iterative methods. Direct methods provide exact solutions, while iterative methods use successive approximations that converge to the exact root. The document focuses on iterative methods and describes how to obtain initial approximations, including using Descartes' rule of signs and the intermediate value theorem. It also discusses criteria for terminating iterations. One iterative method described in detail is the method of false position, which approximates the curve defined by the equation as a straight line between two points.
This document discusses methods for solving algebraic and transcendental equations. It begins by defining key terms like roots, simple roots, and multiple roots. It then distinguishes between direct and iterative methods. Direct methods provide exact solutions, while iterative methods use successive approximations that converge to the exact root. The document focuses on iterative methods and describes how to obtain initial approximations, including using Descartes' rule of signs and the intermediate value theorem. It also discusses criteria for terminating iterations. One iterative method described in detail is the method of false position, which approximates the curve defined by the equation as a straight line between two points.
Seminar Talk: Multilevel Hybrid Split Step Implicit Tau-Leap for Stochastic R...Chiheb Ben Hammouda
The document describes a multilevel hybrid split-step implicit tau-leap method for simulating stochastic reaction networks. It begins with background on modeling biochemical reaction networks stochastically. It then discusses challenges with existing simulation methods like the chemical master equation and stochastic simulation algorithm. The document introduces the split-step implicit tau-leap method as an improvement over explicit tau-leap for stiff systems. It proposes a multilevel Monte Carlo estimator using this method to efficiently estimate expectations of observables with near-optimal computational work.
https://utilitasmathematica.com/index.php/Index
Utilitas Mathematica journal that publishes original research. This journal publishes mainly in areas of pure and applied mathematics, statistics and others like algebra, analysis, geometry, topology, number theory, diffrential equations, operations research, mathematical physics, computer science,mathematical economics.And it is official publication of Utilitas Mathematica Academy, Canada.
This document presents two theorems that solve new types of nonlinear discrete inequalities involving the maximum of an unknown function over a past time interval. These inequalities are discrete generalizations of Bihari's inequality and can be used to study qualitative properties of solutions to nonlinear difference equations with maxima. Theorem 1 provides an upper bound for the solution in terms of inverse functions, while Theorem 2 uses a simpler integral function but a more complicated upper bound. The inequalities are applied to obtain bounds on solutions to difference equations with maxima.
A Fast Numerical Method For Solving Calculus Of Variation ProblemsSara Alvarez
This document presents a numerical method called differential transform method (DTM) for solving calculus of variation problems. DTM finds the solution of variational problems in the form of a polynomial series without discretization. The method is applied to obtain the solution of the Euler-Lagrange equation arising from variational problems by considering it as an initial value problem. Some examples are presented to demonstrate the efficiency and accuracy of DTM for solving calculus of variation problems.
This lecture discusses dimensionality reduction techniques for big data, specifically the Johnson-Lindenstrauss lemma. It introduces linear sketching as a dimensionality reduction method from n dimensions to t dimensions (where t is logarithmic in n). It then proves the JL lemma, which shows that for t proportional to 1/ε^2, the l2 distances between points are preserved to within a 1±ε factor. As an application, it discusses locality sensitive hashing (LSH) for approximate nearest neighbor search, where points close in distance hash to the same bucket with high probability.
It is a new theory based on an algorithmic approach. Its only element
is called nokton. These rules are precise. The innities are completely
absent whatever the system studied. It is a theory with discrete space
and time. The theory is only at these beginnings.
We use stochastic methods to present mathematically correct representation of the wave function. Informal construction was developed by R. Feynman. This approach were introduced first by H. Doss Sur une Resolution Stochastique de l'Equation de Schrödinger à Coefficients Analytiques. Communications in Mathematical Physics
October 1980, Volume 73, Issue 3, pp 247–264.
Primary intention is to discuss formal stochastic representation of the Schrodinger equation solution with its applications to the theory of demolition quantum measurements.
I will appreciate your comments.
This document discusses Hilbert-Schmidt n-tuples of operators on a Banach space. It presents two main results: 1) the Hypercyclicity Criterion, which provides conditions for an n-tuple of operators to be hypercyclic, and 2) conditions under which an n-tuple of unilateral weighted backward shifts is chaotic or has a non-trivial periodic point. It also references several other works studying properties of n-tuples and hypercyclic operators.
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
This document presents a common fixed point theorem for six self-maps (A, B, S, T, L, M) on a Menger space using the concept of weak compatibility. It proves that if the maps satisfy certain conditions, including being weakly compatible and their images being complete subspaces, then the maps have a unique common fixed point. The proof constructs sequences to show the maps have a coincidence point, then uses weak compatibility and lemmas to show this point is the unique common fixed point.
This document discusses the existence and uniqueness of renormalized solutions to a nonlinear multivalued elliptic problem with homogeneous Neumann boundary conditions and L1 data. Specifically, it considers the problem β(u) - div a(x, Du) ∋ f in Ω, with a(x, Du).η = 0 on ∂Ω, where f is an L1 function. It provides definitions of renormalized solutions and entropy solutions. The main result is the existence and uniqueness of renormalized solutions to this problem, which is proved using a priori estimates and a compactness argument with doubling of variables.
Similar to Nonlinear perturbed difference equations (20)
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
The debris of the ‘last major merger’ is dynamically youngSérgio Sacani
The Milky Way’s (MW) inner stellar halo contains an [Fe/H]-rich component with highly eccentric orbits, often referred to as the
‘last major merger.’ Hypotheses for the origin of this component include Gaia-Sausage/Enceladus (GSE), where the progenitor
collided with the MW proto-disc 8–11 Gyr ago, and the Virgo Radial Merger (VRM), where the progenitor collided with the
MW disc within the last 3 Gyr. These two scenarios make different predictions about observable structure in local phase space,
because the morphology of debris depends on how long it has had to phase mix. The recently identified phase-space folds in Gaia
DR3 have positive caustic velocities, making them fundamentally different than the phase-mixed chevrons found in simulations
at late times. Roughly 20 per cent of the stars in the prograde local stellar halo are associated with the observed caustics. Based
on a simple phase-mixing model, the observed number of caustics are consistent with a merger that occurred 1–2 Gyr ago.
We also compare the observed phase-space distribution to FIRE-2 Latte simulations of GSE-like mergers, using a quantitative
measurement of phase mixing (2D causticality). The observed local phase-space distribution best matches the simulated data
1–2 Gyr after collision, and certainly not later than 3 Gyr. This is further evidence that the progenitor of the ‘last major merger’
did not collide with the MW proto-disc at early times, as is thought for the GSE, but instead collided with the MW disc within
the last few Gyr, consistent with the body of work surrounding the VRM.
Or: Beyond linear.
Abstract: Equivariant neural networks are neural networks that incorporate symmetries. The nonlinear activation functions in these networks result in interesting nonlinear equivariant maps between simple representations, and motivate the key player of this talk: piecewise linear representation theory.
Disclaimer: No one is perfect, so please mind that there might be mistakes and typos.
dtubbenhauer@gmail.com
Corrected slides: dtubbenhauer.com/talks.html
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...Sérgio Sacani
Context. With a mass exceeding several 104 M⊙ and a rich and dense population of massive stars, supermassive young star clusters
represent the most massive star-forming environment that is dominated by the feedback from massive stars and gravitational interactions
among stars.
Aims. In this paper we present the Extended Westerlund 1 and 2 Open Clusters Survey (EWOCS) project, which aims to investigate
the influence of the starburst environment on the formation of stars and planets, and on the evolution of both low and high mass stars.
The primary targets of this project are Westerlund 1 and 2, the closest supermassive star clusters to the Sun.
Methods. The project is based primarily on recent observations conducted with the Chandra and JWST observatories. Specifically,
the Chandra survey of Westerlund 1 consists of 36 new ACIS-I observations, nearly co-pointed, for a total exposure time of 1 Msec.
Additionally, we included 8 archival Chandra/ACIS-S observations. This paper presents the resulting catalog of X-ray sources within
and around Westerlund 1. Sources were detected by combining various existing methods, and photon extraction and source validation
were carried out using the ACIS-Extract software.
Results. The EWOCS X-ray catalog comprises 5963 validated sources out of the 9420 initially provided to ACIS-Extract, reaching a
photon flux threshold of approximately 2 × 10−8 photons cm−2
s
−1
. The X-ray sources exhibit a highly concentrated spatial distribution,
with 1075 sources located within the central 1 arcmin. We have successfully detected X-ray emissions from 126 out of the 166 known
massive stars of the cluster, and we have collected over 71 000 photons from the magnetar CXO J164710.20-455217.
The technology uses reclaimed CO₂ as the dyeing medium in a closed loop process. When pressurized, CO₂ becomes supercritical (SC-CO₂). In this state CO₂ has a very high solvent power, allowing the dye to dissolve easily.
Travis Hills' Endeavors in Minnesota: Fostering Environmental and Economic Pr...Travis Hills MN
Travis Hills of Minnesota developed a method to convert waste into high-value dry fertilizer, significantly enriching soil quality. By providing farmers with a valuable resource derived from waste, Travis Hills helps enhance farm profitability while promoting environmental stewardship. Travis Hills' sustainable practices lead to cost savings and increased revenue for farmers by improving resource efficiency and reducing waste.
The use of Nauplii and metanauplii artemia in aquaculture (brine shrimp).pptxMAGOTI ERNEST
Although Artemia has been known to man for centuries, its use as a food for the culture of larval organisms apparently began only in the 1930s, when several investigators found that it made an excellent food for newly hatched fish larvae (Litvinenko et al., 2023). As aquaculture developed in the 1960s and ‘70s, the use of Artemia also became more widespread, due both to its convenience and to its nutritional value for larval organisms (Arenas-Pardo et al., 2024). The fact that Artemia dormant cysts can be stored for long periods in cans, and then used as an off-the-shelf food requiring only 24 h of incubation makes them the most convenient, least labor-intensive, live food available for aquaculture (Sorgeloos & Roubach, 2021). The nutritional value of Artemia, especially for marine organisms, is not constant, but varies both geographically and temporally. During the last decade, however, both the causes of Artemia nutritional variability and methods to improve poorquality Artemia have been identified (Loufi et al., 2024).
Brine shrimp (Artemia spp.) are used in marine aquaculture worldwide. Annually, more than 2,000 metric tons of dry cysts are used for cultivation of fish, crustacean, and shellfish larva. Brine shrimp are important to aquaculture because newly hatched brine shrimp nauplii (larvae) provide a food source for many fish fry (Mozanzadeh et al., 2021). Culture and harvesting of brine shrimp eggs represents another aspect of the aquaculture industry. Nauplii and metanauplii of Artemia, commonly known as brine shrimp, play a crucial role in aquaculture due to their nutritional value and suitability as live feed for many aquatic species, particularly in larval stages (Sorgeloos & Roubach, 2021).
hematic appreciation test is a psychological assessment tool used to measure an individual's appreciation and understanding of specific themes or topics. This test helps to evaluate an individual's ability to connect different ideas and concepts within a given theme, as well as their overall comprehension and interpretation skills. The results of the test can provide valuable insights into an individual's cognitive abilities, creativity, and critical thinking skills
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
1. Available online at www.isr-publications.com/jnsa
J. Nonlinear Sci. Appl., 11 (2018), 1355–1362
Research Article
Journal Homepage: www.isr-publications.com/jnsa
Nonlinear perturbed difference equations
Tahia Zerizer
Mathematics Department, College of Sciences, Jazan University, Jazan, Kingdom of Saudi Arabia.
Communicated by R. Saadati
Abstract
The paper reports on an iteration algorithm to compute asymptotic solutions at any order for a wide class of nonlinear
singularly perturbed difference equations.
Keywords: Perturbed difference equations, computational methods, boundary value problem, asymptotic expansions, iterative
method.
2010 MSC: 39A10.
c 2018 All rights reserved.
1. Introduction
There is a growing interest in difference equations because of their applications in modern sciences
and computer control. Various researchers have been interested in analyzing the asymptotic behavior of
perturbed difference equations, they proposed methods that can be subdivided into two aspects. The mul-
tiple scales perturbation method for ordinary difference equations introduced in 1977 by Hoppensteadt
and Miranker [2], a formal technique which has been improved by Horssen et al. [8, 12]. The second
method is the singular perturbation method proposed in 1976 by Comstock and Hsiao [1] for a linear
second order equation defined over a finite interval, these authors presented the zeroth order solution
as a composition of an outer solution and a boundary layer correction solution; their method followed the
theory of singular perturbations for ODES. Naidu and Rao [7] have heuristically extended this procedure
to higher order equations and have given a lot of applications to discrete control problems while Jodar
and Morera [3] studied linear systems of second order difference equations. Some particular cases of non-
linear second order equations have been examined by Reinhardt [9] and Suzuki [11]. Kelley [4] studied
a general second order model with a right-end perturbation; his method is given for zeroth and first order
of approximation but higher order approximations have not been made explicitly. In [10, 13], we have
elucidated that we could define homogeneous asymptotic expansions for singularly perturbed difference
Email address: tzerizer@gmail.com; tzerizer@yahoo.fr (Tahia Zerizer)
doi: 10.22436/jnsa.011.12.06
Received: 2018-06-06 Revised: 2018-08-05 Accepted: 2018-09-03
2. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1356
equations bypassing the correction terms and we gave applications to control problems in [14–17]. Re-
cently in [18, 19], we used this homogeneous method for a class of nonlinear equations giving explicitly
asymptotic solutions up to any order. The plan of this paper is to extend this procedure based on Faa Di
Bruno formula [6] and contraction mapping principle, to a wide class of nonlinear singularly-perturbed
difference equations. In the next Section, we introduce a nonlinear model with left-end perturbation, we
describe an iterative algorithm to compute asymptotic solutions of a boundary value problem. Section
3, is reserved to another kind of perturbation said right-end perturbation, an analogous method is briefly
exposed. Finally the paper ends in Section 4 with a concise conclusion.
2. Left end perturbation
Let IN = {0, 1, · · · , N}, N ∈ N∗; N∗ denote the set of positive integers. We assume that (X, . ) is
a Banach space, F(IN, X) is the space of all mappings of IN into X, and the mapping f : F(IN, X)r+1 ×
(−1, 1) × IN → X, is n-differentiable in its arguments. We consider the difference equation
f (x(t), x(t + 1), . . . , x(t + r − 1), εx(t + r), ε, t) = 0, t ∈ IN−r, (2.1)
subject to the multipoint boundary-value conditions
x(0) = α0(ε), x(1) = α1(ε), . . . , x(r − 2) = αr−2(ε), x(N) = β(ε). (2.2)
We assume that for |ε| < δ 1, αk(ε) and β(ε) have the asymptotic representations
αk(ε) = α
(0)
k + εα
(1)
k + · · · + εn
α
(n)
k , β(ε) = β(0)
+ εβ(1)
+ · · · + εn
β(n)
.
In the singularly perturbed model (2.1) the small parameter ε is assigned to the term of highest order,
i.e., x(t + r), in the literature it is called a left-end perturbation. In this section, for the BVP (2.1)-(2.2), we
study the existence and uniqueness of a solution x(t, ε), t ∈ IN, and we show how to compute recursively
the coefficients of its asymptotic development
x(t, ε) = x(t)(0)
+ εx(t)(1)
+ ε2
x(t)(2)
+ · · · + εn
x(t)(n)
+ O(εn+1
). (2.3)
In what follows, we will denote the partial derivative
∂k0+k1+···+kp f(x0,x1,...,xp)
∂x
k0
0 ∂x
k1
1 ···∂x
kp
p
by Dk0
0 Dk1
1 · · · D
kp
p f.
2.1. Reduced Problem
As for the singular perturbation theory of differential equations, it is assumptive that the singular
nature of difference equations containing a small parameter is simply caused by a reduction of its order
when the parameter is canceled. In the reduced problem
f (x(t), x(t + 1), . . . , x(t + r − 1), 0, 0, t) , t = 0, 1, . . . , N − r,
x(0) = α
(0)
0 , x(1) = α
(0)
1 , · · · , x(r − 2) = α
(0)
r−2,
(2.4)
x(N) = β(0)
, (2.5)
the order of the difference equation is equal to r − 1, the problem displays a boundary layer behavior at
the endpoint, i.e., the values x(0), x(1), . . . , x(N − 1), can be calculated regardless of the final condition
(2.5). Seeing that the boundary conditions are uncoupled, we will only have to solve recursively the initial
value problem (2.4). The following hypothesis guarantee that the reduced problem (2.4)-(2.5) has a unique
solution.
H1. Suppose the range of f contains the value 0, and ∀x ∈ X,
Dr−1f (x(t), x(t + 1), . . . , x(t + r − 1), 0, 0, t) = 0, t = 0, 1, . . . , N − r.
Proposition 2.1. If H1 holds, then problem (2.4)-(2.5) has a unique solution.
3. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1357
2.2. Preliminary results
To establish the existence of a solution as well to find approximate solutions, the BVP (2.1)-(2.2) is
converted to a system of equations depending on a parameter by denoting χ = (x(0), x(1), . . . , x(N)), for
x ∈ X, and writing the system (2.1)-(2.2) in the form
F : (−1, 1) × XN+1
−→ XN+1
, F (ε, χ) = 0, (2.6)
where F (ε, χ) = (F0 (ε, χ) , F1 (ε, χ) , . . . , FN (ε, χ)),
Ft (ε, χ) = x(t) − αt(ε), t = 0, . . . , r − 2,
Ft+r−1 (ε, χ) = f (x(t), x(t + 1), . . . , x(t + r − 1), εx(t + r), ε, t) ,
t = 0, . . . , N − r,
FN (ε, χ) = x(N) − β(ε).
Under suitable assumptions, we can apply the classical Implicit Function Theorem [5] to (2.6). If the
hypothesis H1 is satisfied, then for a small parameter ε, we can determine a function
φ(ε) = (φ0(ε), φ1(ε), . . . , φN(ε)),
with same regularity as F, i.e., of class Cn, such that F (ε, φ(ε)) = 0. Therefore,
f(φt(ε), φt+1(ε), . . . , φt+r−1(ε), εφt+r(ε), ε, t) = 0, t = 0, 1, . . . , N − r,
φ0(ε) = α0(ε), φ1(ε) = α1(ε), . . . , φr−2(ε) = αr−2(ε), φN(ε) = β(ε).
(2.7)
For small |ε|, to get an approximate value for the function φt(ε), we use the Taylor/Maclaurin polynomial
expansion
φt(ε) = φt(0) +
ε
1!
dφt
dε
(0) +
ε2
2!
d2φt
dε2
(0) + · · · +
εn
n!
dnφt
dεn
(0) + O(εn+1
), (2.8)
and we apply Faa di Bruno formula [6] to explicitly find the sequential differentiation of (2.7) to be able to
calculate the coefficients of (2.8). For making writing concise, we drop the arguments for f in the following
lemma.
Lemma 2.2. Assume that f satisfies (2.7), and that all the necessary derivatives are defined. Then we have for
n 2,
r−1
l=0
Dlf
∂nφ(ε)
∂εn
+ nDrf
∂n−1φt+r(ε)
∂εn−1
= −
0 1
· · ·
n
Dp0
0 Dp1
1 · · · D
pr+1
r+1 f
×
n! n
i=1(∂iφt(ε)
∂εi )qi0 · · · (∂iφt+r−1(ε)
∂εi )qir−1 (idi−1φt+r(ε)
∂εi−1 + ε∂iφt+r(ε)
∂εi )qir (ε(i))qir+1
n
i=1(i!)ki
n
i=1
r+1
j=0 qij!
,
(2.9)
where the coefficients ki, qij, and pj, i = 0, . . . , 1, i = 0, . . . , 1, are all nonnegative integer solutions of the
Diophantine equations
0
→ k1 + 2k2 + · · · + nkn = n,
i
→ qi0 + qi1 + · · · + qir + qir+1 = ki, i = 1, . . . , n,
pj = q1j + q2j + · · · + qnj, j = 0, 1, . . . , r + 1,
p0 + p1 + · · · + pr+1 = k1 + k2 + · · · + kn,
(2.10)
in 0 · · · n we fix kn = 0; the case kn = 1 is omitted and corresponds to the left side of equation (2.9), and
ε(i)
qir+1
:=
1, i = 1 ∨ qir+1 = 0,
0, i 2 ∧ qir+1 = 0.
4. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1358
Proof. Define φr+1(ε) := ε, we have
diφr+1(ε)
dεi
= ε(i)
=
1, i = 1,
0, i 2.
Expanding Faa Di Bruno’s Formula into (2.8) and noticing that for i 1,
di (εφk+r(ε))
dεi
= i
di−1φk+r(ε)
dεi−1
+ ε
diφk+r(ε)
dεi
,
we obtain (2.9) by arranging the equation (2.10) so that on the left hand side, we have the terms corre-
sponding to k
(0)
n = 1.
2.3. Description of the method
In this section we describe an iterative process giving the coefficients of (2.3). Knowing that the coeffi-
cients of 0th-order approximation are the solution sequence of the reduced problem (2.4)-(2.5), substituting
x(i)
(t + l) :=
1
i!
∂iφt+l
∂εi
(0), t = 0, 1, . . . , N, l = 0, . . . , r (2.11)
into (2.9), we obtain the following. For 1st-order approximation,
Dr−1f0x(1)
(t + r − 1) = −
r−2
l=0
Dlf0x(1)
(t + l) − Drf0x(0)
(t + r) − Dr+1f0, t = 0, . . . , N − r,
x(1)
(0) = α
(1)
0 , x(1)
(1) = α
(1)
1 , . . . , x(1)
(r − 2) = α
(1)
r−2, x(1)
(N) = β(1)
,
(2.12)
where f0 shortly denotes tha value
f(x(0)
(t), x(0)
(t + 1), . . . , x(0)
(t + r − 1), 0, 0, t).
To calculate the coefficients x(1)(0), x(1)(1), . . . , x(1)(N − 1), only the initial values are needed, the final
value x(1)(N) does not serve in this recurrence, but the 0th-order solution found from (2.4)-(2.5) are also
needed. For the 2th-order development, and with the same calculation method as for the previous step,
we have
Dr−1f0x(2)
(t + r − 1)
= −
r−2
l=0
Dlf0x(2)
(t + l) − 2Drf0x(1)
(t + r) − D2
r+1f0
− 2
0 l r−1
DlDrf0x(1)
(t + l)x(0)
(t + r) − D2
rf0 x(0)
(t + r)
2
−
r−1
l=0
D2
lf0 x(1)
(t + l)
2
− 2
0 l r−1
DlDr+1f0x(1)
(t + l)
− 2DrDr+1f0x(0)
(t + r) − 2
0 l<m r−1
DlDmf0x(1)
(t + l)x(1)
(t + m), t = 0, . . . , N − r,
x(2)
(0) = α
(2)
0 , x(2)
(1) = α
(2)
1 , . . . , x(2)
(r − 2) = α
(2)
r−2, x(2)
(N) = β(2)
.
(2.13)
For the nth-order development, using the initial values
x(n)
(0) = α
(n)
0 , x(n)
(1) = α
(n)
1 , . . . , x(n)
(r − 2) = α
(n)
r−2, (2.14)
5. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1359
we have the recurrence formula
Dr−1f0x(n)
(t + r − 1) = −
r−2
l=0
Dlf0x(n)
(t + l) − nDrf0x(n−1)
(t + r)
−
0
· · ·
n
Dp0
0 · · · D
pr+1
r+1 f0
n
i=1(x(i)(t))qi0 · · · (x(i)(t + r − 1))qir−1 (x(i)(t + r))qir (δi)qir+1
n
i=1
r+1
j=0 qij!
,
(2.15)
where in 0 · · · n we fix k
(0)
n = 0, and the final value remains fixed,
x(n)
(N) = β(n)
. (2.16)
Above are the consecutive steps to compute the coeffients that make up the approximate solutions defined
by (2.3). This computation process is confirmed in the following theorem.
Theorem 2.3. If H1 holds, there exists > 0, such that for all |ε| < , the boundary value problem (2.1)-(2.2) has a
unique solution which satisfies (2.3); where x
(0)
k , x
(1)
k , x
(2)
k , and x
(n)
k , are the solutions of (2.4)-(2.5), (2.12), (2.13),
and (2.15)-(2.14)-(2.16), respectively.
Proof. Let ˜χ = (ε, χ), |ε| δ < 1, we introduce the functional F defined by F (˜χ) = (ε, F (˜χ)), and we
denote by DF its jacobian matrix. Obviously DF is invertible at ˜χ(0) = 0, x(0)(0), x(1)(0), . . . , x(N)(0) ,
where x(t)(0), t ∈ IN, is the solution of the reduced problem (2.4)-(2.5), since from H1 we have
det DF ˜χ(0)
=
N−r
i=0
Dr−1f x
(0)
i , x
(0)
i+1, . . . , x
(0)
i+r−1, 0, 0, i = 0.
We can choose ξ > 0 such that, if ˜χ − ˜χ(0) < ξ, we have
DF (˜χ) − DF ˜χ(0)
<
1
2
DF ˜χ(0)
−1
−1
,
resulting from the continuity of DF. We denote = ξ
2 DF ˜χ(0) −1 −1, we can easily verify that the
mapping Φτ(˜χ) = ˜χ − DF ˜χ(0) −1
(F(˜χ) − τ) is a contraction that maps B ˜χ(0), ξ to itself, when |ε| <
and τ < . Therefore Φτ has a unique fixed point ˜χ, which means that for τ fixed, τ < , there exists
a unique ˜χ such that ˜χ − ˜χ(0) < ξ, and τ = F(˜χ), i.e., F is one-to-one from F−1 (B(0, )) into B(0, ).
If |ε| < , obviously (ε, 0, . . . , 0) ∈ B(0, ), there exists a unique (ε, φ(ε)) in B ˜χ(0), ξ , such that
(ε, 0, . . . , 0) = F(ε, φ(ε)), φ(ε) = (φ0(ε), . . . , φN(ε)). We proved that |ε| < , there exists a unique φ(ε)
such that F(ε, φ(ε)) = 0, then the boundary value problem (2.1)-(2.2) has a unique solution. Moreover,
the function φ is Cn (− , ), as are F and F−1, and its derivatives are given in Lemma 2.2.
The iterative problems given above are defined for any order provided f being a smooth function and
the asymptotic developments for the boundary conditions are convergent.
H2. Assume that α
(i)
k
A
δi , β(i) B
δi , A and B are constants.
Theorem 2.4. If assumptions H1 and H2 hold, and f is a smooth function, then there exists > 0, for all |ε| < ,
that the boundary value problem (2.1)-(2.2) has a unique solution xk(ε) = ∞
n=0 εnx
(n)
k , where x
(0)
k , x
(1)
k , x
(2)
k ,
and x
(n)
k , are solutions of (2.4)-(2.5), (2.12), (2.13), and (2.15)-(2.14)-(2.16), respectively.
3. Right end perturbation
In this section, we report on a model said right-end perturbation, the small parameter ε is assigned to
the term of lowest order, i.e., x(t),
f (εx(t), x(t + 1), . . . , x(t + r − 1), x(t + r), ε, t) = 0, t = 0, . . . , N − r, (3.1)
combined with the boundary conditions
6. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1360
x(0) = α(ε), x(N − r + 2) = βr−2(ε), . . . , x(N) = β0(ε), (3.2)
where |ε| < δ 1, and α(ε) and βk(ε) have the asymptotic representations
α(ε) = α(0)
+ εα(1)
+ · · · + εn
α(n)
, βk(ε) = β
(0)
k + εβ
(1)
k + · · · + εn
β
(n)
k .
We indicate directly the results, which are found by a similar technique as in previous section, the modi-
fications required are obvious and are left to the reader. In the reduced problem
x0 = α(0)
, (3.3)
f (0, x(t + 1), . . . , x(t + r − 1), x(t + r), 0, t) = 0, t = 0, 1, . . . , N − r,
x(N − r + 2) = β
(0)
r−2, · · · , x(N − 1) = β
(0)
1 , x(N) = β
(0)
0 ,
(3.4)
involving only the final values, we compute backward the values x1, . . . , xN−r+1, without using (3.3); the
boundary layer behavior is located at the initial value.
H3. Suppose that f has range containing zero, and ∀x ∈ X, we have
D1f(0, x(t + 1), x(t + 2), . . . , x(t + r), 0, t) = 0.
Proposition 3.1. If H3 holds, then (3.3)-(3.4) has a unique solution.
Under some conditions, there exists an open neighborhood V(0) where a function
φ(ε) = (φ0(ε), . . . , φN(ε)) ∈ Cn
(V)
satisfies
f(εφ(t, ε), φ(t + 1, ε), . . . , φ(t + r, ε), ε, t) = 0, t = 0, . . . , N − r,
φ0(ε) = α(ε), φN−r+2(ε) = βr−2(ε), . . . , φN(ε) = β0(ε).
(3.5)
The consecutive derivatives of the equation in (3.5) are given in the following Lemma.
Lemma 3.2. Assume that the functions φk and f satisfy (3.5), and that all the necessary derivatives are defined.
Then we have for n 2,
nD0f
∂n−1φt(ε)
∂εn−1
+
r
l=1
Dlf
∂nφt+l(ε)
∂εn
= −
0 1
· · ·
n
Dp0
0 Dp1
1 · · · D
pr+1
r+1 f
×
n! n
i=1(idi−1φt(ε)
∂εi−1 + ε∂iφt(ε)
∂εi )qi0 · · · (∂iφt+r−1(ε)
∂εi )qir−1 (∂iφt+r(ε)
∂εi )qir (ε(i))qir+1
n
i=1(i!)ki
n
i=1
r+1
j=0 qij!
,
(3.6)
where the coefficients in (3.6) are the solutions of the Diophantine (2.10); in 0 · · · n we fix k
(0)
n = 0, the case
k
(0)
n = 1 corresponds to the left side of equation (3.6).
Therefore, from (2.3), (2.11), and (3.6), we find for the following. For 1st-order development,
x(1)
(a) = α(1)
,
D1f0x(1)
(t + 1) = −
r
l=2
Dlf0x(1)
(t + l) − D0f0x(0)
(t) − Dr+1f0, t = 0, . . . , N − r,
x(1)
(N − r + 2) = β
(1)
r−2, · · · , x(1)
(N − 1) = β
(1)
1 , x(1)
(N) = β
(1)
0 .
(3.7)
7. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1361
For 2nd-order development, we have
x(2)
(0) = α(2)
,
D1f0x(2)
(k + 1) = −
r
l=2
Dlf0x(2)
(t + l) − 2D0f0x(1)
(t)
− D2
r+1f0 − 2
1 l r
D0Dlf0x(0)
(t)x(1)
(t + l) − D2
0f0(x(0)
(t))2
−
r
l=1
D2
lf0(x(1)
(t + l))2
− 2
1 l r
DlDr+1f0x(1)
(t + l)
− 2D0Dr+1f0x(0)
(t)
− 2
1 l<m r
DlDmf0x(1)
(t + l)x(1)
(t + m), k = 0, . . . , N − r,
x(2)
(N − r + 2) = β
(2)
r−2, . . . , x(2)
(N − 1) = β
(2)
1 , x(2)
(N) = β
(2)
0 .
(3.8)
For nth-order order development, n 2, we have
D1f0x(n)
(t + 1) = −
r
l=2
Dlf0x(n)
(t + l) − nD0f0x(n−1)
(t)
−
0
· · ·
n
Dp0
0 · · · D
pr+1
r+1 f0
n
i=1(x(i−1)(t))qi0 · · · (x(i)(t + r − 1))qir−1 (x(i)(t + r))qir (δi)qir+1
n
i=1
r+1
j=0 qij!
,
(3.9)
in 0 · · · n we fix k
(0)
n = 0. In the above recurrence formulas we only use the final values, the initial
values do not serve in the computation process. The iteration is done backward from the final values
x(n)
(N − r + 2) = β
(n)
r−2, . . . , x(n)
(N − 1) = β
(n)
1 , x(n)
(N) = β
(n)
0 , (3.10)
while the initial value remains fixed,
x(n)
(0) = α(n)
. (3.11)
Theorem 3.3. If H3 holds, there exists > 0, such that for all |ε| < , the boundary value problem (3.1)-(3.2) has a
unique solution which satisfies (2.3); the coefficients x
(0)
k , x
(1)
k , x
(2)
k , and x
(n)
k , are the solutions of (3.3)-(3.4), (3.7),
and (3.8), (3.9)-(3.10)-(3.11), respectively.
For a development at any order, we need that the asymptotic developments for the boundary condi-
tions are convergent.
H4. Assume that α(i) A
δi , β
(i)
k
B
δi , A and B are constants.
Theorem 3.4. If H3 and H4 hold, and f is a smooth function, then there exists > 0 such that for all |ε| < ,
the boundary value problem (3.1)-(3.2) has a unique solution which satisfy xk(ε) = ∞
n=0 εnx
(n)
k , where the
coefficients x
(0)
k , x
(1)
k , x
(2)
k , and x
(n)
k are the solution of the problems (3.3)-(3.4), (3.7), (3.8), and (3.9)-(3.10)-(3.11),
respectively.
4. conclusion
In this paper, we consider some boundary value problems related to a large class of singular perturba-
tion models of nonlinear difference equations. We study the existence and uniqueness of the solution and
formulate an iterative process to find approximate asymptotic solutions up to any order by combining Faa
8. T. Zerizer, J. Nonlinear Sci. Appl., 11 (2018), 1355–1362 1362
Di Bruno formula and the contraction mapping principle. The same procedure can be applied to initial
value problems with a left-end perturbation, or final value problems with right-end perturbation. The
singular perturbation theory developed herein shows a possibility to study models with multiple scale
parameters or singularly perturbed discrete-time systems, which may be a future research topic.
References
[1] C. Comstock, G. C. Hsiao, Singular Perturbations for Difference Equations, Rocky Mountain J. Math., 6 (1976), 561–
567. 1
[2] F. C. Hoppensteadt, W. L. Miranker, Multitime methods for systems of difference equations, Studies in Appl. Math., 56
(1977), 273–289. 1
[3] L. Jodar, J. L. Morera, Singular Perturbations for Systems of Difference Equations, Appl. Math. Lett., 3 (1990), 51–54. 1
[4] W. G. Kelley, Singularly perturbed difference equations, J. Differ. Equations Appl., 5 (1999), 97–110. 1
[5] S. G. Krantz, H. R. Parks, The Implicit Function Theorem: History, Theory, and Applications, Birkh¨auser, Boston, (2003).
2.2
[6] R. L. Mishkov, Generalization of the Formula of Faa Di Bruno for a Composite Function with a Vector Argument, Int. J.
Math. Math. Sci., 24 (2000), 481–491. 1, 2.2
[7] D. S. Naidu, A. K. Rao, Singular Perturbation Analysis of Discrete Control Systems, Springer-Verlag, Berlin, (1985). 1
[8] M. Rafei, W. T. Van Horssen, Solving systems of nonlinear difference equations by the multiple scales perturbation method,
Nonlinear Dynam., 69 (2012), 1509–1516. 1
[9] H. J. Reinhardt, On asymptotic expansions in nonlinear, singularly perturbed difference equations, Numer. Funct. Anal.
Optim., 1 (1979), 565–587. 1
[10] T. Sari, T. Zerizer, Perturbations for Linear Difference Equations, J. Math. Anal. Appl., 305 (2005), 43–52. 1
[11] M. Suzuki, Singular perturbation for difference equations, Nonlinear Anal. Theory Methods Appl., 47 (2001), 4083–
4093. 1
[12] W. T. Van Horssen, M. C. ter Brake, On the multiple scales perturbation method for difference equations, Nonlinear
Dynam., 55 (2009), 401–418. 1
[13] T. Zerizer, Perturbation Method for Linear Difference Equations with Small Parameters, Adv. Differ. Equ., 11 (2006),
1–12. 1
[14] T. Zerizer, Perturbation Method for a Class of Singularly Perturbed Systems, Adv. Dyn. Syst. Appl., 9 (2014), 239–248.
1
[15] T. Zerizer, Boundary Value Problems for Linear Singularly Perturbed Discrete Systems, Adv. Dyn. Syst. Appl., 10 (2015),
215–224.
[16] T. Zerizer, Problems for a Linear Two-Time-Scale Discrete Model, Adv. Dyn. Syst. Appl., 10 (2015), 85–96.
[17] T. Zerizer, Boundary Value Problem for a Three-Time-Scale Singularly Perturbed Discrete System, Dyn. Contin. Discrete
Impuls. Syst. Ser. A Math. Anal., 23 (2016), 263–272. 1
[18] T. Zerizer, A Class of Multi-Scales Nonlinear Difference Equations, Appl. Math. Sci., 12 (2018), 911–919. 1
[19] T. Zerizer, A Class of Nonlinear Perturbed Difference Equations, Int. J. Math. Anal., 12 (2018), 235–243. 1