تحسين النتائح
ترتيب حسب
من
الى
الصفحة 1
الصفحة 1
Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.
A Dressing Method in Mathematical Physics
The monograph is devoted to the systematic presentation of the so called "dressing method" for solving differential equations (both linear and nonlinear) of mathematical physics. The essence of the dressing method consists in a generation of new non-trivial solutions of a given equation from (maybe trivial) solution of the same or related equation.
