Communications on Applied Nonlinear Analysis
Author:
Publisher:
Published: 2006
Total Pages: 486
ISBN-13:
DOWNLOAD EBOOKPosts
Applied Nonlinear Analysis and Soft Computing
Author: Hemen Dutta
Publisher: Springer Nature
Published: 2023-07-20
Total Pages: 433
ISBN-13: 9811980543
DOWNLOAD EBOOKThe volume contains original research papers as the Proceedings of the International Conference on Applied Nonlinear Analysis and Soft Computing (ANASC 2020), held at Gauhati University, Guwahati, India, on 22-23 December, 2020. It focuses on current research topics in applied analysis including nonlinearity, soft computing and related areas. It primarily includes topics related to pattern recognition, reaction-diffusion problem, decision making problems, inventory model, predator-prey model, logistic models, wave problems, problems in Magnetohydrodynamics, cosmological model, harmonic functions, graphs, shapes, etc. Researchers, educators, scientist and professionals interested in recent developments in applied analysis including nonlinearity aspects and soft computing should be benefited from this volume.
Integral Inequalities and Generalized Convexity
Author: Shashi Kant Mishra
Publisher: CRC Press
Published: 2023-09-18
Total Pages: 531
ISBN-13: 1000952096
DOWNLOAD EBOOKThe book covers several new research findings in the area of generalized convexity and integral inequalities. Integral inequalities using various type of generalized convex functions are applicable in many branches of mathematics such as mathematical analysis, fractional calculus, and discrete fractional calculus. The book contains integral inequalities of Hermite-Hadamard type, Hermite- Hadamard-Fejer type and majorization type for the generalized strongly convex functions. It presents Hermite-Hadamard type inequalities for functions defined on Time scales. Further, it provides the generalization and extensions of the concept of preinvexity for interval-valued functions and stochastic processes, and give Hermite-Hadamard type and Ostrowski type inequalities for these functions. These integral inequalities are utilized in numerous areas for the boundedness of generalized convex functions. Features: Covers Interval-valued calculus, Time scale calculus, Stochastic processes – all in one single book Numerous examples to validate results Provides an overview of the current state of integral inequalities and convexity for a much wider audience, including practitioners Applications of some special means of real numbers are also discussed The book is ideal for anyone teaching or attending courses in integral inequalities along with researchers in this area.
Contributions to Nonlinear Analysis
Author: Thierry Cazenave
Publisher: Springer Science & Business Media
Published: 2007-08-10
Total Pages: 516
ISBN-13: 3764374012
DOWNLOAD EBOOKThis paper is concerned with the existence and uniform decay rates of solutions of the waveequation with a sourceterm and subject to nonlinear boundary damping ? ? u ?? u =|u| u in ? ×(0,+?) ? tt ? ? ? ? u=0 on ? ×(0,+?) 0 (1. 1) ? ? u+g(u)=0 on ? ×(0,+?) ? t 1 ? ? ? ? 0 1 u(x,0) = u (x); u (x,0) = u (x),x? ? , t n where ? is a bounded domain of R ,n? 1, with a smooth boundary ? = ? ?? . 0 1 Here, ? and ? are closed and disjoint and ? represents the unit outward normal 0 1 to ?. Problems like (1. 1), more precisely, ? u ?? u =?f (u)in? ×(0,+?) ? tt 0 ? ? ? ? u=0 on ? ×(0,+?) 0 (1. 2) ? ? u =?g(u )?f (u)on? ×(0,+?) ? t 1 1 ? ? ? ? 0 1 u(x,0) = u (x); u (x,0) = u (x),x? ? , t were widely studied in the literature, mainly when f =0,see[6,13,22]anda 1 long list of references therein. When f =0and f = 0 this kind of problem was 0 1 well studied by Lasiecka and Tataru [15] for a very general model of nonlinear functions f (s),i=0,1, but assuming that f (s)s? 0, that is, f represents, for i i i each i, an attractive force.
Introduction to Recognition and Deciphering of Patterns
Author: Michael A. Radin
Publisher: CRC Press
Published: 2020-08-09
Total Pages: 174
ISBN-13: 1000078558
DOWNLOAD EBOOKIntroduction to Recognition and Deciphering of Patterns is meant to acquaint STEM and non-STEM students with different patterns, as well as to where and when specific patterns arise. In addition, the book teaches students how to recognize patterns and distinguish the similarities and differences between them. Patterns, such as weather patterns, traffic patterns, behavioral patterns, geometric patterns, linguistic patterns, structural patterns, digital patterns, and the like, emerge on an everyday basis, . Recognizing patterns and studying their unique traits are essential for the development and enhancement of our intuitive skills and for strengthening our analytical skills. Mathematicians often apply patterns to get acquainted with new concepts--a technique that can be applied across many disciplines. Throughout this book we explore assorted patterns that emerge from various geometrical configurations of squares, circles, right triangles, and equilateral triangles that either repeat at the same scale or at different scales. The book also analytically examines linear patterns, geometric patterns, alternating patterns, piecewise patterns, summation-type patterns and factorial-type patterns. Deciphering the details of these distinct patterns leads to the proof by induction method, and the book will also render properties of Pascal’s triangle and provide supplemental practice in deciphering specific patterns and verifying them. This book concludes with first-order recursive relations: describing sequences as recursive relations, obtaining the general solution by solving an initial value problem, and determining the periodic traits. Features • Readily accessible to a broad audience, including those with limited mathematical background • Especially useful for students in non-STEM disciplines, such as psychology, sociology, economics and business, as well as for liberal arts disciplines and art students.
Impulsive Differential Equations and Inclusions
Author: Mouffak Benchohra
Publisher: Hindawi Publishing Corporation
Published: 2006
Total Pages: 381
ISBN-13: 977594550X
DOWNLOAD EBOOKApplied Nonlinear Analysis
Author: V. Lakshmikantham
Publisher: Elsevier
Published: 2014-05-12
Total Pages: 747
ISBN-13: 1483272060
DOWNLOAD EBOOKApplied Nonlinear Analysis contains the proceedings of an International Conference on Applied Nonlinear Analysis, held at the University of Texas at Arlington, on April 20-22, 1978. The papers explore advances in applied nonlinear analysis, with emphasis on reaction-diffusion equations; optimization theory; constructive techniques in numerical analysis; and applications to physical and life sciences. In the area of reaction-diffusion equations, the discussions focus on nonlinear oscillations; rotating spiral waves; stability and asymptotic behavior; discrete-time models in population genetics; and predator-prey systems. In optimization theory, the following topics are considered: inverse and ill-posed problems with application to geophysics; conjugate gradients; and quasi-Newton methods with applications to large-scale optimization; sequential conjugate gradient-restoration algorithm for optimal control problems with non-differentiable constraints; differential geometric methods in nonlinear programming; and equilibria in policy formation games with random voting. In the area of constructive techniques in numerical analysis, numerical and approximate solutions of boundary value problems for ordinary and partial differential equations are examined, along with finite element analysis and constructive techniques for accretive and monotone operators. In addition, the book explores turbulent fluid flows; stability problems for Hopf bifurcation; product integral representation of Volterra equations with delay; weak solutions of variational problems, nonlinear integration on measures; and fixed point theory. This monograph will be helpful to students, practitioners, and researchers in the field of mathematics.
Semi-Infinite Fractional Programming
Author: Ram U. Verma
Publisher: Springer
Published: 2017-10-24
Total Pages: 298
ISBN-13: 9811062560
DOWNLOAD EBOOKThis book presents a smooth and unified transitional framework from generalised fractional programming, with a finite number of variables and a finite number of constraints, to semi-infinite fractional programming, where a number of variables are finite but with infinite constraints. It focuses on empowering graduate students, faculty and other research enthusiasts to pursue more accelerated research advances with significant interdisciplinary applications without borders. In terms of developing general frameworks for theoretical foundations and real-world applications, it discusses a number of new classes of generalised second-order invex functions and second-order univex functions, new sets of second-order necessary optimality conditions, second-order sufficient optimality conditions, and second-order duality models for establishing numerous duality theorems for discrete minmax (or maxmin) semi-infinite fractional programming problems. In the current interdisciplinary supercomputer-oriented research environment, semi-infinite fractional programming is among the most rapidly expanding research areas in terms of its multi-facet applications empowerment for real-world problems, which may stem from many control problems in robotics, outer approximation in geometry, and portfolio problems in economics, that can be transformed into semi-infinite problems as well as handled by transforming them into semi-infinite fractional programming problems. As a matter of fact, in mathematical optimisation programs, a fractional programming (or program) is a generalisation to linear fractional programming. These problems lay the theoretical foundation that enables us to fully investigate the second-order optimality and duality aspects of our principal fractional programming problem as well as its semi-infinite counterpart.
Digital Communications Using Chaos and Nonlinear Dynamics
Author: Jia-Ming Liu
Publisher: Springer Science & Business Media
Published: 2006-11-22
Total Pages: 392
ISBN-13: 038729788X
DOWNLOAD EBOOKThis book provides a summary of the research conducted at UCLA, Stanford University, and UCSD over the last ?ve years in the area of nonlinear dyn- ics and chaos as applied to digital communications. At ?rst blush, the term “chaotic communications” seems like an oxymoron; how could something as precise and deterministic as digital communications be chaotic? But as this book will demonstrate, the application of chaos and nonlinear dynamicstocommunicationsprovidesmanypromisingnewdirectionsinareas of coding, nonlinear optical communications, and ultra-wideband commu- cations. The eleven chapters of the book summarize many of the promising new approaches that have been developed, and point the way to new research directions in this ?eld. Digital communications techniques have been continuously developed and re?ned for the past ?fty years to the point where today they form the heart of a multi-hundred billion dollar per year industry employing hundreds of thousands of people on a worldwide basis. There is a continuing need for transmission and reception of digital signals at higher and higher data rates. There are a variety of physical limits that place an upper limit on these data rates, and so the question naturally arises: are there alternative communi- tion techniques that can overcome some of these limitations? Most digital communications today is carried out using electronic devices that are essentially “linear,” and linear system theory has been used to c- tinually re?ne their performance. In many cases, inherently nonlinear devices are linearized in order to achieve a certain level of linear system performance.
Approximate Solutions of Common Fixed-Point Problems
Author: Alexander J. Zaslavski
Publisher: Springer
Published: 2016-06-30
Total Pages: 457
ISBN-13: 3319332554
DOWNLOAD EBOOKThis book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space“/p> · dynamic string-averaging version of the proximal algorithm · common fixed point problems in metric spaces · common fixed point problems in the spaces with distances of the Bregman type · a proximal algorithm for finding a common zero of a family of maximal monotone operators · subgradient projections algorithms for convex feasibility problems in Hilbert spaces
