Search results for: differential algebraic systems
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 10400

Search results for: differential algebraic systems

10370 Development of Extended Trapezoidal Method for Numerical Solution of Volterra Integro-Differential Equations

Authors: Fuziyah Ishak, Siti Norazura Ahmad

Abstract:

Volterra integro-differential equations appear in many models for real life phenomena. Since analytical solutions for this type of differential equations are hard and at times impossible to attain, engineers and scientists resort to numerical solutions that can be made as accurately as possible. Conventionally, numerical methods for ordinary differential equations are adapted to solve Volterra integro-differential equations. In this paper, numerical solution for solving Volterra integro-differential equation using extended trapezoidal method is described. Formulae for the integral and differential parts of the equation are presented. Numerical results show that the extended method is suitable for solving first order Volterra integro-differential equations.

Keywords: accuracy, extended trapezoidal method, numerical solution, Volterra integro-differential equations

Procedia PDF Downloads 393
10369 Constructing White-Box Implementations Based on Threshold Shares and Composite Fields

Authors: Tingting Lin, Manfred von Willich, Dafu Lou, Phil Eisen

Abstract:

A white-box implementation of a cryptographic algorithm is a software implementation intended to resist extraction of the secret key by an adversary. To date, most of the white-box techniques are used to protect block cipher implementations. However, a large proportion of the white-box implementations are proven to be vulnerable to affine equivalence attacks and other algebraic attacks, as well as differential computation analysis (DCA). In this paper, we identify a class of block ciphers for which we propose a method of constructing white-box implementations. Our method is based on threshold implementations and operations in composite fields. The resulting implementations consist of lookup tables and few exclusive OR operations. All intermediate values (inputs and outputs of the lookup tables) are masked. The threshold implementation makes the distribution of the masked values uniform and independent of the original inputs, and the operations in composite fields reduce the size of the lookup tables. The white-box implementations can provide resistance against algebraic attacks and DCA-like attacks.

Keywords: white-box, block cipher, composite field, threshold implementation

Procedia PDF Downloads 127
10368 Graph Similarity: Algebraic Model and Its Application to Nonuniform Signal Processing

Authors: Nileshkumar Vishnav, Aditya Tatu

Abstract:

A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction.

Keywords: graph signal processing, algebraic signal processing, graph similarity, isospectral graphs, nonuniform signal processing

Procedia PDF Downloads 318
10367 Optimal Control of Volterra Integro-Differential Systems Based on Legendre Wavelets and Collocation Method

Authors: Khosrow Maleknejad, Asyieh Ebrahimzadeh

Abstract:

In this paper, the numerical solution of optimal control problem (OCP) for systems governed by Volterra integro-differential (VID) equation is considered. The method is developed by means of the Legendre wavelet approximation and collocation method. The properties of Legendre wavelet accompany with Gaussian integration method are utilized to reduce the problem to the solution of nonlinear programming one. Some numerical examples are given to confirm the accuracy and ease of implementation of the method.

Keywords: collocation method, Legendre wavelet, optimal control, Volterra integro-differential equation

Procedia PDF Downloads 356
10366 Investigation of Different Conditions to Detect Cycles in Linearly Implicit Quantized State Systems

Authors: Elmongi Elbellili, Ben Lauwens, Daan Huybrechs

Abstract:

The increasing complexity of modern engineering systems presents a challenge to the digital simulation of these systems which usually can be represented by differential equations. The Linearly Implicit Quantized State System (LIQSS) offers an alternative approach to traditional numerical integration techniques for solving Ordinary Differential Equations (ODEs). This method proved effective for handling discontinuous and large stiff systems. However, the inherent discrete nature of LIQSS may introduce oscillations that result in unnecessary computational steps. The current oscillation detection mechanism relies on a condition that checks the significance of the derivatives, but it could be further improved. This paper describes a different cycle detection mechanism and presents the outcomes using LIQSS order one in simulating the Advection Diffusion problem. The efficiency of this new cycle detection mechanism is verified by comparing the performance of the current solver against the new version as well as a reference solution using a Runge-Kutta method of order14.

Keywords: numerical integration, quantized state systems, ordinary differential equations, stiffness, cycle detection, simulation

Procedia PDF Downloads 23
10365 On Direct Matrix Factored Inversion via Broyden's Updates

Authors: Adel Mohsen

Abstract:

A direct method based on the good Broyden's updates for evaluating the inverse of a nonsingular square matrix of full rank and solving related system of linear algebraic equations is studied. For a matrix A of order n whose LU-decomposition is A = LU, the multiplication count is O (n3). This includes the evaluation of the LU-decompositions of the inverse, the lower triangular decomposition of A as well as a “reduced matrix inverse”. If an explicit value of the inverse is not needed the order reduces to O (n3/2) to compute to compute inv(U) and the reduced inverse. For a symmetric matrix only O (n3/3) operations are required to compute inv(L) and the reduced inverse. An example is presented to demonstrate the capability of using the reduced matrix inverse in treating ill-conditioned systems. Besides the simplicity of Broyden's update, the method provides a mean to exploit the possible sparsity in the matrix and to derive a suitable preconditioner.

Keywords: Broyden's updates, matrix inverse, inverse factorization, solution of linear algebraic equations, ill-conditioned matrices, preconditioning

Procedia PDF Downloads 450
10364 Reduction of Differential Column Shortening in Tall Buildings

Authors: Hansoo Kim, Seunghak Shin

Abstract:

The differential column shortening in tall buildings can be reduced by improving material and structural characteristics of the structural systems. This paper proposes structural methods to reduce differential column shortening in reinforced concrete tall buildings; connecting columns with rigidly jointed horizontal members, using outriggers, and placing additional reinforcement at the columns. The rigidly connected horizontal members including outriggers reduce the differential shortening between adjacent vertical members. The axial stiffness of columns with greater shortening can be effectively increased by placing additional reinforcement at the columns, thus the differential column shortening can be reduced in the design stage. The optimum distribution of additional reinforcement can be determined by applying a gradient based optimization technique.

Keywords: column shortening, long-term behavior, optimization, tall building

Procedia PDF Downloads 220
10363 Existence Result of Third Order Functional Random Integro-Differential Inclusion

Authors: D. S. Palimkar

Abstract:

The FRIGDI (functional random integrodifferential inclusion) seems to be new and includes several known random differential inclusions already studied in the literature as special cases have been discussed in the literature for various aspects of the solutions. In this paper, we prove the existence result for FIGDI under the non-convex case of multi-valued function involved in it.Using random fixed point theorem of B. C. Dhage and caratheodory condition. This result is new to the theory of differential inclusion.

Keywords: caratheodory condition, random differential inclusion, random solution, integro-differential inclusion

Procedia PDF Downloads 434
10362 Integral Image-Based Differential Filters

Authors: Kohei Inoue, Kenji Hara, Kiichi Urahama

Abstract:

We describe a relationship between integral images and differential images. First, we derive a simple difference filter from conventional integral image. In the derivation, we show that an integral image and the corresponding differential image are related to each other by simultaneous linear equations, where the numbers of unknowns and equations are the same, and therefore, we can execute the integration and differentiation by solving the simultaneous equations. We applied the relationship to an image fusion problem, and experimentally verified the effectiveness of the proposed method.

Keywords: integral images, differential images, differential filters, image fusion

Procedia PDF Downloads 473
10361 Numerical Solution of Space Fractional Order Linear/Nonlinear Reaction-Advection Diffusion Equation Using Jacobi Polynomial

Authors: Shubham Jaiswal

Abstract:

During modelling of many physical problems and engineering processes, fractional calculus plays an important role. Those are greatly described by fractional differential equations (FDEs). So a reliable and efficient technique to solve such types of FDEs is needed. In this article, a numerical solution of a class of fractional differential equations namely space fractional order reaction-advection dispersion equations subject to initial and boundary conditions is derived. In the proposed approach shifted Jacobi polynomials are used to approximate the solutions together with shifted Jacobi operational matrix of fractional order and spectral collocation method. The main advantage of this approach is that it converts such problems in the systems of algebraic equations which are easier to be solved. The proposed approach is effective to solve the linear as well as non-linear FDEs. To show the reliability, validity and high accuracy of proposed approach, the numerical results of some illustrative examples are reported, which are compared with the existing analytical results already reported in the literature. The error analysis for each case exhibited through graphs and tables confirms the exponential convergence rate of the proposed method.

Keywords: space fractional order linear/nonlinear reaction-advection diffusion equation, shifted Jacobi polynomials, operational matrix, collocation method, Caputo derivative

Procedia PDF Downloads 416
10360 Reduced Differential Transform Methods for Solving the Fractional Diffusion Equations

Authors: Yildiray Keskin, Omer Acan, Murat Akkus

Abstract:

In this paper, the solution of fractional diffusion equations is presented by means of the reduced differential transform method. Fractional partial differential equations have special importance in engineering and sciences. Application of reduced differential transform method to this problem shows the rapid convergence of the sequence constructed by this method to the exact solution. The numerical results show that the approach is easy to implement and accurate when applied to fractional diffusion equations. The method introduces a promising tool for solving many fractional partial differential equations.

Keywords: fractional diffusion equations, Caputo fractional derivative, reduced differential transform method, partial

Procedia PDF Downloads 490
10359 Extension and Closure of a Field for Engineering Purpose

Authors: Shouji Yujiro, Memei Dukovic, Mist Yakubu

Abstract:

Fields are important objects of study in algebra since they provide a useful generalization of many number systems, such as the rational numbers, real numbers, and complex numbers. In particular, the usual rules of associativity, commutativity and distributivity hold. Fields also appear in many other areas of mathematics; see the examples below. When abstract algebra was first being developed, the definition of a field usually did not include commutativity of multiplication, and what we today call a field would have been called either a commutative field or a rational domain. In contemporary usage, a field is always commutative. A structure which satisfies all the properties of a field except possibly for commutativity, is today called a division ring ordivision algebra or sometimes a skew field. Also non-commutative field is still widely used. In French, fields are called corps (literally, body), generally regardless of their commutativity. When necessary, a (commutative) field is called corps commutative and a skew field-corps gauche. The German word for body is Körper and this word is used to denote fields; hence the use of the blackboard bold to denote a field. The concept of fields was first (implicitly) used to prove that there is no general formula expressing in terms of radicals the roots of a polynomial with rational coefficients of degree 5 or higher. An extension of a field k is just a field K containing k as a subfield. One distinguishes between extensions having various qualities. For example, an extension K of a field k is called algebraic, if every element of K is a root of some polynomial with coefficients in k. Otherwise, the extension is called transcendental. The aim of Galois Theory is the study of algebraic extensions of a field. Given a field k, various kinds of closures of k may be introduced. For example, the algebraic closure, the separable closure, the cyclic closure et cetera. The idea is always the same: If P is a property of fields, then a P-closure of k is a field K containing k, having property, and which is minimal in the sense that no proper subfield of K that contains k has property P. For example if we take P (K) to be the property ‘every non-constant polynomial f in K[t] has a root in K’, then a P-closure of k is just an algebraic closure of k. In general, if P-closures exist for some property P and field k, they are all isomorphic. However, there is in general no preferable isomorphism between two closures.

Keywords: field theory, mechanic maths, supertech, rolltech

Procedia PDF Downloads 340
10358 Existence Theory for First Order Functional Random Differential Equations

Authors: Rajkumar N. Ingle

Abstract:

In this paper, the existence of a solution of nonlinear functional random differential equations of the first order is proved under caratheodory condition. The study of the functional random differential equation has got importance in the random analysis of the dynamical systems of universal phenomena. Objectives: Nonlinear functional random differential equation is useful to the scientists, engineers, and mathematicians, who are engaged in N.F.R.D.E. analyzing a universal random phenomenon, govern by nonlinear random initial value problems of D.E. Applications of this in the theory of diffusion or heat conduction. Methodology: Using the concepts of probability theory, functional analysis, generally the existence theorems for the nonlinear F.R.D.E. are prove by using some tools such as fixed point theorem. The significance of the study: Our contribution will be the generalization of some well-known results in the theory of Nonlinear F.R.D.E.s. Further, it seems that our study will be useful to scientist, engineers, economists and mathematicians in their endeavors to analyses the nonlinear random problems of the universe in a better way.

Keywords: Random Fixed Point Theorem, functional random differential equation, N.F.R.D.E., universal random phenomenon

Procedia PDF Downloads 462
10357 Geometric and Algebraic Properties of the Eigenvalues of Monotone Matrices

Authors: Brando Vagenende, Marie-Anne Guerry

Abstract:

For stochastic matrices of any order, the geometric description of the convex set of eigenvalues is completely known. The purpose of this study is to investigate the subset of the monotone matrices. This type of matrix appears in contexts such as intergenerational occupational mobility, equal-input modeling, and credit ratings-based systems. Monotone matrices are stochastic matrices in which each row stochastically dominates the previous row. The monotonicity property of a stochastic matrix can be expressed by a nonnegative lower-order matrix with the same eigenvalues as the original monotone matrix (except for the eigenvalue 1). Specifically, the aim of this research is to focus on the properties of eigenvalues of monotone matrices. For those matrices up to order 3, there already exists a complete description of the convex set of eigenvalues. For monotone matrices of order at least 4, this study gives, through simulations, more insight into the geometric description of their eigenvalues. Furthermore, this research treats in a geometric and algebraic way the properties of eigenvalues of monotone matrices of order at least 4.

Keywords: eigenvalues of matrices, finite Markov chains, monotone matrices, nonnegative matrices, stochastic matrices

Procedia PDF Downloads 41
10356 Global Stability Of Nonlinear Itô Equations And N. V. Azbelev's W-method

Authors: Arcady Ponosov., Ramazan Kadiev

Abstract:

The work studies the global moment stability of solutions of systems of nonlinear differential Itô equations with delays. A modified regularization method (W-method) for the analysis of various types of stability of such systems, based on the choice of the auxiliaryequations and applications of the theory of positive invertible matrices, is proposed and justified. Development of this method for deterministic functional differential equations is due to N.V. Azbelev and his students. Sufficient conditions for the moment stability of solutions in terms of the coefficients for sufficiently general as well as specific classes of Itô equations are given.

Keywords: asymptotic stability, delay equations, operator methods, stochastic noise

Procedia PDF Downloads 187
10355 Optimal Capacitor Placement in Distribution Systems

Authors: Sana Ansari, Sirus Mohammadi

Abstract:

In distribution systems, shunt capacitors are used to reduce power losses, to improve voltage profile, and to increase the maximum flow through cables and transformers. This paper presents a new method to determine the optimal locations and economical sizing of fixed and/or switched shunt capacitors with a view to power losses reduction and voltage stability enhancement. General Algebraic Modeling System (GAMS) has been used to solve the maximization modules using the MINOS optimization software with Linear Programming (LP). The proposed method is tested on 33 node distribution system and the results show that the algorithm suitable for practical implementation on real systems with any size.

Keywords: power losses, voltage stability, radial distribution systems, capacitor

Procedia PDF Downloads 619
10354 Toward Subtle Change Detection and Quantification in Magnetic Resonance Neuroimaging

Authors: Mohammad Esmaeilpour

Abstract:

One of the important open problems in the field of medical image processing is detection and quantification of small changes. In this poster, we try to investigate that, how the algebraic decomposition techniques can be used for semiautomatically detecting and quantifying subtle changes in Magnetic Resonance (MR) neuroimaging volumes. We mostly focus on the low-rank values of the matrices achieved from decomposing MR image pairs during a period of time. Besides, a skillful neuroradiologist will help the algorithm to distinguish between noises and small changes.

Keywords: magnetic resonance neuroimaging, subtle change detection and quantification, algebraic decomposition, basis functions

Procedia PDF Downloads 443
10353 On the Zeros of the Degree Polynomial of a Graph

Authors: S. R. Nayaka, Putta Swamy

Abstract:

Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained.

Keywords: degree polynomial, regular graph, minimum and maximum degree, graph operations

Procedia PDF Downloads 215
10352 Comprehensive Investigation of Solving Analytical of Nonlinear Differential Equations at Chemical Reactions to Design of Reactors by New Method “AGM”

Authors: Mohammadreza Akbari, Pooya Soleimani Besheli, Reza khalili, Sara Akbari, Davood Domiri Ganji

Abstract:

In this symposium, our aims are accuracy, capabilities and power at solving of the complicate non-linear differential at the reaction chemical in the catalyst reactor (heterogeneous reaction). Our purpose is to enhance the ability of solving the mentioned nonlinear differential equations at chemical engineering and similar issues with a simple and innovative approach which entitled ‘’Akbari-Ganji's Method’’ or ‘’AGM’’. In this paper we solve many examples of nonlinear differential equations of chemical reactions and its investigate. The chemical reactor with the energy changing (non-isotherm) in two reactors of mixed and plug are separately studied and the nonlinear differential equations obtained from the reaction behavior in these systems are solved by a new method. Practically, the reactions with the energy changing (heat or cold) have an important effect on designing and function of the reactors. This means that possibility of reaching the optimal conditions of operation for the maximum conversion depending on nonlinear nature of the reaction velocity toward temperature, results in the complexity of the operation in the reactor. In this case, the differential equation set which governs the reactors can be obtained simultaneous solution of mass equilibrium and energy and temperature changing at concentration.

Keywords: new method (AGM), nonlinear differential equation, tubular and mixed reactors, catalyst bed

Procedia PDF Downloads 351
10351 Investigate and Solving Analytic of Nonlinear Differential at Vibrations (Earthquake)and Beam-Column, by New Approach “AGM”

Authors: Mohammadreza Akbari, Pooya Soleimani Besheli, Reza Khalili, Sara Akbari

Abstract:

In this study, we investigate building structures nonlinear behavior also solving analytic of nonlinear differential at vibrations. As we know most of engineering systems behavior in practical are non- linear process (especial at structural) and analytical solving (no numerical) these problems are complex, difficult and sometimes impossible (of course at form of analytical solving). In this symposium, we are going to exposure one method in engineering, that can solve sets of nonlinear differential equations with high accuracy and simple solution and so this issue will emerge after comparing the achieved solutions by Numerical Method (Runge-Kutte 4th) and exact solutions. Finally, we can proof AGM method could be created huge evolution for researcher and student (engineering and basic science) in whole over the world, because of AGM coding system, so by using this software, we can analytical solve all complicated linear and nonlinear differential equations, with help of that there is no difficulty for solving nonlinear differential equations.

Keywords: new method AGM, vibrations, beam-column, angular frequency, energy dissipated, critical load

Procedia PDF Downloads 353
10350 Going beyond Elementary Algebraic Identities: The Expectation of a Gifted Child, an Indian Scenario

Authors: S. R. Santhanam

Abstract:

A gifted child is one who gives evidence of creativity, good memory, rapid learning. In mathematics, a teacher often comes across some gifted children and they exhibit the following characteristics: unusual alertness, enjoying solving problems, getting bored on repetitions, self-taught, going beyond what teacher taught, ask probing questions, connecting unconnected concepts, vivid imagination, readiness for research work, perseverance of a topic. There are two main areas of research carried out on them: 1)identifying gifted children, 2) interacting and channelizing them. A lack of appropriate recognition will lead the gifted child demotivated. One of the main findings is if proper attention and nourishment are not given then it leads a gifted child to become depressed, underachieving, fail to reach their full potential and sometimes develop negative attitude towards school and study. After identifying them, a mathematics teacher has to develop them into a fall fledged achiever. The responsibility of the teacher is enormous. The teacher has to be resourceful and patient. But interacting with them one finds a lot of surprises and awesomeness. The elementary algebraic identities like (a+b)(a-b)=a²-b², expansion of like (a+b)²(a-b)² and others are taught to students, of age group 13-15 in India. An average child will be satisfied with a single proof and immediate application of these identities. But a gifted child expects more from the teacher and at one stage after a little training will surpass the teacher also. In this short paper, the author shares his experience regarding teaching algebraic identities to gifted children. The following problem was given to a set of 10 gifted children of the specified age group: If a natural number ‘n’ to expressed as the sum of the two squares, will 2n also be expressed as the sum of two squares? An investigation has been done on what multiples of n satisfying the criterion. The attempts of the gifted children were consolidated and conclusion was drawn. A second problem was given to them as: can two natural numbers be found such that the difference of their square is 3? After a successful solution, more situations were analysed. As a third question, the finding of the sign of an algebraic expression in three variables was analysed. As an example: if a,b,c are real and unequal what will be sign of a²+4b²+9c²-4ab-12bc-6ca? Apart from an expression as a perfect square what other methods can be employed to prove an algebraic expression as positive negative or non negative has been analysed. Expressions like 4x²+2y²+13y²-2xy-4yz-6zx were given, and the children were asked to find the sign of the expression for all real values of x,y and z. In all investigations, only basic algebraic identities were used. As a next probe, a divisibility problem was initiated. When a,b,c are natural numbers such that a+b+c is at least 6, and if a+b+c is divisible by 6 then will 6 divide a³+b³+c³. The gifted children solved it in two different ways.

Keywords: algebraic identities, gifted children, Indian scenario, research

Procedia PDF Downloads 158
10349 Comparing Numerical Accuracy of Solutions of Ordinary Differential Equations (ODE) Using Taylor's Series Method, Euler's Method and Runge-Kutta (RK) Method

Authors: Palwinder Singh, Munish Sandhir, Tejinder Singh

Abstract:

The ordinary differential equations (ODE) represent a natural framework for mathematical modeling of many real-life situations in the field of engineering, control systems, physics, chemistry and astronomy etc. Such type of differential equations can be solved by analytical methods or by numerical methods. If the solution is calculated using analytical methods, it is done through calculus theories, and thus requires a longer time to solve. In this paper, we compare the numerical accuracy of the solutions given by the three main types of one-step initial value solvers: Taylor’s Series Method, Euler’s Method and Runge-Kutta Fourth Order Method (RK4). The comparison of accuracy is obtained through comparing the solutions of ordinary differential equation given by these three methods. Furthermore, to verify the accuracy; we compare these numerical solutions with the exact solutions.

Keywords: Ordinary differential equations (ODE), Taylor’s Series Method, Euler’s Method, Runge-Kutta Fourth Order Method

Procedia PDF Downloads 320
10348 Weak Solutions Of Stochastic Fractional Differential Equations

Authors: Lev Idels, Arcady Ponosov

Abstract:

Stochastic fractional differential equations have recently attracted considerable attention, as they have been used to model real-world processes, which are subject to natural memory effects and measurement uncertainties. Compared to conventional hereditary differential equations, one of the advantages of fractional differential equations is related to more realistic geometric properties of their trajectories that do not intersect in the phase space. In this report, a Peano-like existence theorem for nonlinear stochastic fractional differential equations is proven under very general hypotheses. Several specific classes of equations are checked to satisfy these hypotheses, including delay equations driven by the fractional Brownian motion, stochastic fractional neutral equations and many others.

Keywords: delay equations, operator methods, stochastic noise, weak solutions

Procedia PDF Downloads 167
10347 Incomplete Existing Algebra to Support Mathematical Computations

Authors: Ranjit Biswas

Abstract:

The existing subject Algebra is incomplete to support mathematical computations being done by scientists of all areas: Mathematics, Physics, Statistics, Chemistry, Space Science, Cosmology etc. even starting from the era of great Einstein. A huge hidden gap in the subject ‘Algebra’ is unearthed. All the scientists today, including mathematicians, physicists, chemists, statisticians, cosmologists, space scientists, and economists, even starting from the great Einstein, are lucky that they got results without facing any contradictions or without facing computational errors. Most surprising is that the results of all scientists, including Nobel Prize winners, were proved by them by doing experiments too. But in this paper, it is rigorously justified that they all are lucky. An algebraist can define an infinite number of new algebraic structures. The objective of the work in this paper is not just for the sake of defining a distinct algebraic structure, but to recognize and identify a major gap of the subject ‘Algebra’ lying hidden so far in the existing vast literature of it. The objective of this work is to fix the unearthed gap. Consequently, a different algebraic structure called ‘Region’ has been introduced, and its properties are studied.

Keywords: region, ROR, RORR, region algebra

Procedia PDF Downloads 20
10346 Solving Ill-Posed Initial Value Problems for Switched Differential Equations

Authors: Eugene Stepanov, Arcady Ponosov

Abstract:

To model gene regulatory networks one uses ordinary differential equations with switching nonlinearities, where the initial value problem is known to be well-posed if the trajectories cross the discontinuities transversally. Otherwise, the initial value problem is usually ill-posed, which lead to theoretical and numerical complications. In the presentation, it is proposed to apply the theory of hybrid dynamical systems, rather than switched ones, to regularize the problem. 'Hybridization' of the switched system means that one attaches a dynamic discrete component ('automaton'), which follows the trajectories of the original system and governs its dynamics at the points of ill-posedness of the initial value problem making it well-posed. The construction of the automaton is based on the classification of the attractors of the specially designed adjoint dynamical system. Several examples are provided in the presentation, which support the suggested analysis. The method can also be of interest in other applied fields, where differential equations contain switchings, e.g. in neural field models.

Keywords: hybrid dynamical systems, ill-posed problems, singular perturbation analysis, switching nonlinearities

Procedia PDF Downloads 155
10345 Numerical Solution of Porous Media Equation Using Jacobi Operational Matrix

Authors: Shubham Jaiswal

Abstract:

During modeling of transport phenomena in porous media, many nonlinear partial differential equations (NPDEs) encountered which greatly described the convection, diffusion and reaction process. To solve such types of nonlinear problems, a reliable and efficient technique is needed. In this article, the numerical solution of NPDEs encountered in porous media is derived. Here Jacobi collocation method is used to solve the considered problems which convert the NPDEs in systems of nonlinear algebraic equations that can be solved using Newton-Raphson method. The numerical results of some illustrative examples are reported to show the efficiency and high accuracy of the proposed approach. The comparison of the numerical results with the existing analytical results already reported in the literature and the error analysis for each example exhibited through graphs and tables confirms the exponential convergence rate of the proposed method.

Keywords: nonlinear porous media equation, shifted Jacobi polynomials, operational matrix, spectral collocation method

Procedia PDF Downloads 406
10344 Q-Efficient Solutions of Vector Optimization via Algebraic Concepts

Authors: Elham Kiyani

Abstract:

In this paper, we first introduce the concept of Q-efficient solutions in a real linear space not necessarily endowed with a topology, where Q is some nonempty (not necessarily convex) set. We also used the scalarization technique including the Gerstewitz function generated by a nonconvex set to characterize these Q-efficient solutions. The algebraic concepts of interior and closure are useful to study optimization problems without topology. Studying nonconvex vector optimization is valuable since topological interior is equal to algebraic interior for a convex cone. So, we use the algebraic concepts of interior and closure to define Q-weak efficient solutions and Q-Henig proper efficient solutions of set-valued optimization problems, where Q is not a convex cone. Optimization problems with set-valued maps have a wide range of applications, so it is expected that there will be a useful analytical tool in optimization theory for set-valued maps. These kind of optimization problems are closely related to stochastic programming, control theory, and economic theory. The paper focus on nonconvex problems, the results are obtained by assuming generalized non-convexity assumptions on the data of the problem. In convex problems, main mathematical tools are convex separation theorems, alternative theorems, and algebraic counterparts of some usual topological concepts, while in nonconvex problems, we need a nonconvex separation function. Thus, we consider the Gerstewitz function generated by a general set in a real linear space and re-examine its properties in the more general setting. A useful approach for solving a vector problem is to reduce it to a scalar problem. In general, scalarization means the replacement of a vector optimization problem by a suitable scalar problem which tends to be an optimization problem with a real valued objective function. The Gerstewitz function is well known and widely used in optimization as the basis of the scalarization. The essential properties of the Gerstewitz function, which are well known in the topological framework, are studied by using algebraic counterparts rather than the topological concepts of interior and closure. Therefore, properties of the Gerstewitz function, when it takes values just in a real linear space are studied, and we use it to characterize Q-efficient solutions of vector problems whose image space is not endowed with any particular topology. Therefore, we deal with a constrained vector optimization problem in a real linear space without assuming any topology, and also Q-weak efficient and Q-proper efficient solutions in the senses of Henig are defined. Moreover, by means of the Gerstewitz function, we provide some necessary and sufficient optimality conditions for set-valued vector optimization problems.

Keywords: algebraic interior, Gerstewitz function, vector closure, vector optimization

Procedia PDF Downloads 192
10343 Generalization of Tau Approximant and Error Estimate of Integral Form of Tau Methods for Some Class of Ordinary Differential Equations

Authors: A. I. Ma’ali, R. B. Adeniyi, A. Y. Badeggi, U. Mohammed

Abstract:

An error estimation of the integrated formulation of the Lanczos tau method for some class of ordinary differential equations was reported. This paper is concern with the generalization of tau approximants and their corresponding error estimates for some class of ordinary differential equations (ODEs) characterized by m + s =3 (i.e for m =1, s=2; m=2, s=1; and m=3, s=0) where m and s are the order of differential equations and number of overdetermination, respectively. The general result obtained were validated with some numerical examples.

Keywords: approximant, error estimate, tau method, overdetermination

Procedia PDF Downloads 574
10342 Optimality Conditions for Weak Efficient Solutions Generated by a Set Q in Vector Spaces

Authors: Elham Kiyani, S. Mansour Vaezpour, Javad Tavakoli

Abstract:

In this paper, we first introduce a new distance function in a linear space not necessarily endowed with a topology. The algebraic concepts of interior and closure are useful to study optimization problems without topology. So, we define Q-weak efficient solutions generated by the algebraic interior of a set Q, where Q is not necessarily convex. Studying nonconvex vector optimization is valuable since, for a convex cone K in topological spaces, we have int(K)=cor(K), which means that topological interior of a convex cone K is equal to the algebraic interior of K. Moreover, we used the scalarization technique including the distance function generated by the vectorial closure of a set to characterize these Q-weak efficient solutions. Scalarization is a useful approach for solving vector optimization problems. This technique reduces the optimization problem to a scalar problem which tends to be an optimization problem with a real-valued objective function. For instance, Q-weak efficient solutions of vector optimization problems can be characterized and computed as solutions of appropriate scalar optimization problems. In the convex case, linear functionals can be used as objective functionals of the scalar problems. But in the nonconvex case, we should present a suitable objective function. It is the aim of this paper to present a new distance function that be useful to obtain sufficient and necessary conditions for Q-weak efficient solutions of general optimization problems via scalarization.

Keywords: weak efficient, algebraic interior, vector closure, linear space

Procedia PDF Downloads 195
10341 Closed Form Exact Solution for Second Order Linear Differential Equations

Authors: Saeed Otarod

Abstract:

In a different simple and straight forward analysis a closed-form integral solution is found for nonhomogeneous second order linear ordinary differential equations, in terms of a particular solution of their corresponding homogeneous part. To find the particular solution of the homogeneous part, the equation is transformed into a simple Riccati equation from which the general solution of non-homogeneouecond order differential equation, in the form of a closed integral equation is inferred. The method works well in manyimportant cases, such as Schrödinger equation for hydrogen-like atoms. A non-homogenous second order linear differential equation has been solved as an extra example

Keywords: explicit, linear, differential, closed form

Procedia PDF Downloads 12