68 resultados para Quasi-linear partial differential equations
Resumo:
2000 Mathematics Subject Classification: 34C10, 34C15.
Resumo:
2000 Mathematics Subject Classification: 34K15, 34C10.
Resumo:
2000 Mathematics Subject Classification: 34C10, 34C15.
Resumo:
MSC 2010: 34A08, 34A37, 49N70
Resumo:
2000 Mathematics Subject Classification: 26A33 (main), 44A40, 44A35, 33E30, 45J05, 45D05
Resumo:
Mathematics Subject Classification: 26A33 (main), 35A22, 78A25, 93A30
Resumo:
An nonlinear elliptic system for generating adaptive quadrilateral meshes in curved domains is presented. The presented technique has been implemented in the C++ language with the help of the standard template library. The software package writes the converged meshes in the GMV and the Matlab formats. Grid generation is the first very important step for numerically solving partial differential equations. Thus, the presented C++ grid generator is extremely important to the computational science community.
Resumo:
This article presents the principal results of the doctoral thesis “Direct Operational Methods in the Environment of a Computer Algebra System” by Margarita Spiridonova (Institute of mathematics and Informatics, BAS), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 23 March, 2009.
Resumo:
The Conference on Partial Differential Equations and Applications, Sofia, September 14–16, 2011 (In honor of 65-th Anniversary of Professor Petar Popivanov) took place in the premises of the Institute of Mathematics and Informatics (IMI) of the Bulgarian Academy of Sciences (BAS). The conference was organized by the Section “Differential Equations and Mathematical Physics” of IMI with the participation of research groups on PDE from Universit`a di Cagliari and Universit`a di Torino (Italy), with the organizing committee – N. Kutev (IMI–BAS) – chair, G. Boyadzhiev (IMI–BAS) – secretary, T. Gramchev (Univ. Cagliari) and A. Oliaro (Univ. Torino) – members, and thefollowing program/scientific committee: T. Gramchev (chair), N. Kutev (IMI–BAS), L. Rodino (Universit`a di Torino), M. Ruzhansky (Imperial College London), A. Slavova (IMI–BAS), C. Van Der Mee (Universit`a di Cagliari).
Resumo:
2010 Mathematics Subject Classification: 74J30, 34L30.
Resumo:
2000 Mathematics Subject Classification: 35L05, 35P25, 47A40.
Resumo:
An antagonistic differential game of hyperbolic type with a separable linear vector pay-off function is considered. The main result is the description of all ε-Slater saddle points consisting of program strategies, program ε-Slater maximins and minimaxes for each ε ∈ R^N > for this game. To this purpose, the considered differential game is reduced to find the optimal program strategies of two multicriterial problems of hyperbolic type. The application of approximation enables us to relate these problems to a problem of optimal program control, described by a system of ordinary differential equations, with a scalar pay-off function. It is found that the result of this problem is not changed, if the players use positional or program strategies. For the considered differential game, it is interesting that the ε-Slater saddle points are not equivalent and there exist two ε-Slater saddle points for which the values of all components of the vector pay-off function at one of them are greater than the respective components of the other ε-saddle point.
Resumo:
2000 Mathematics Subject Classification: 60J80, 60J85
Resumo:
We present some results on the formation of singularities for C^1 - solutions of the quasi-linear N × N strictly hyperbolic system Ut + A(U )Ux = 0 in [0, +∞) × Rx . Under certain weak non-linearity conditions (weaker than genuine non-linearity), we prove that the first order derivative of the solution blows-up in finite time.
Resumo:
* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.