نتایج جستجو برای: laplacian systems
تعداد نتایج: 1195024 فیلتر نتایج به سال:
In this work, we study the existence of non-trivial multiple solutions for a class of quasilinear elliptic systems equipped with concave-convex nonlinearities and critical growth terms in bounded domains. By using the variational method, especially Nehari manifold and Palais-Smale condition, we prove the existence and multiplicity results of positive solutions.
The ability to solve a system of linear equations lies at the heart of areas such as optimization, scientific computing, and computer science, and has traditionally been a central topic of research in the area of numerical linear algebra. An important class of instances that arise in practice has the form Lx = b, where L is the Laplacian of an undirected graph. After decades of sustained resear...
We consider performance analysis of interconnected linear dynamical networks subject to external stochastic disturbances. For stable linear networks, we define scalar performance measures by considering weighted H2–norms of the underlying systems, which are defined from the disturbance input to a desired output. It is shown that the performance measure of a general stable linear network can be ...
in this thesis, using concepts of wavelets theory some methods of the solving optimal control problems (ocps). governed by time-delay systems is investigated. this thesis contains two parts. first, the method of obtaining of the ocps in time delay systems by linear legendre multiwavelets is presented. the main advantage of the meth...
The k-th semi total point graph of a graph G, , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. In this paper, a formula for Laplacian polynomial of in terms of characteristic and Laplacian polynomials of G is computed, where is a connected regular graph.The Kirchhoff index of is also computed.
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید