39 resultados para Existence theorems.
Resumo:
Mathematics Subject Classification: 26A16, 26A33, 46E15.
Resumo:
2000 Mathematics Subject Classification: Primary 26A24, 26D15; Secondary 41A05
Resumo:
Mathematics Subject Classification: 30B10, 30B30; 33C10, 33C20
Resumo:
Mathematics Subject Classification: 26A33, 34A60, 34K40, 93B05
Resumo:
Mathematics Subject Classification: 45G10, 45M99, 47H09
Resumo:
The main aim of this paper is to obtain fixed point theorems for Kannan and Zamfirescu operators in the presence of cyclical contractive condition. A method for approximation of the fixed points is also provided, for which both a priori and a posteriori error estimates are given. Our results generalize, unify and extend several important fixed points theorems in literature. In order to illustrate the efficiency of our generalizations five significant examples are also given.
Resumo:
This book deals with equations of mathematical physics as the different modifications of the KdV equation, the Camassa-Holm type equations, several modifications of Burger's equation, the Hunter-Saxton equation, conservation laws equations and others. The equations originate from physics but are proposed here for their investigation via purely mathematical methods in the frames of university courses. More precisely, we propose classification theorems for the traveling wave solutions for a sufficiently large class of third order nonlinear PDE when the corresponding profiles develop different kind of singularities (cusps, peaks), existence and uniqueness results, etc. The orbital stability of the periodic solutions of traveling type for mKdV equations are also studied. Of great interest too is the interaction of peakon type solutions of the Camassa-Holm equation and the solvability of the classical and generalized Cauchy problem for the Hunter-Saxton equation. The Riemann problem for special systems of conservation laws and the corresponding -shocks are also considered. As it concerns numerical methods we apply the CNN approach. The book is addressed to a broader audience including graduate students, Ph.D. students, mathematicians, physicist, engineers and specialists in the domain of PDE.
Resumo:
We discuss some main points of computer-assisted proofs based on reliable numerical computations. Such so-called self-validating numerical methods in combination with exact symbolic manipulations result in very powerful mathematical software tools. These tools allow proving mathematical statements (existence of a fixed point, of a solution of an ODE, of a zero of a continuous function, of a global minimum within a given range, etc.) using a digital computer. To validate the assertions of the underlying theorems fast finite precision arithmetic is used. The results are absolutely rigorous. To demonstrate the power of reliable symbolic-numeric computations we investigate in some details the verification of very long periodic orbits of chaotic dynamical systems. The verification is done directly in Maple, e.g. using the Maple Power Tool intpakX or, more efficiently, using the C++ class library C-XSC.
Resumo:
MSC 2010: 26A33, 34A37, 34K37, 34K40, 35R11
Resumo:
MSC 2010: 42B10, 44A15
Resumo:
MSC 2010: 34A37, 34B15, 26A33, 34C25, 34K37
Resumo:
MSC 2010: 30A10, 30B10, 30B30, 30B50, 30D15, 33E12
Resumo:
MSC 2010: 30C45, 30C55
Resumo:
MSC 2010: 30C55, 30C45
Resumo:
2000 Mathematics Subject Classification: 41A25, 41A27, 41A36.