نتایج جستجو برای: fuzzy laplacian matrix

تعداد نتایج: 460933  

In this paper, the notions of $(T,S)$-composition matrix and$(T,S)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(T,S)$ is a dual pair of triangular module. Theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. Furthermore, theirproperties and characterizations are presented. Then a new methodbased on $tilde{...

2006
Tim Volodine Denis Vanderstraeten Dirk Roose

Recently, Sorkine et al. proposed a least squares based representation of meshes, which is suitable for compression and modeling. In this paper we look at this representation from the viewpoint of Tikhonov regularization. We show that this viewpoint yields a smoothing algorithm, which can be seen as an approximation of the shape using weighted geometry aware bases, where the weighting factor is...

In this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (FLMEs) of the form AX = B; where Ais a crisp matrix, B is a fuzzy number matrix and the unknown matrix X one,is presented. Then a numerical example is presented to illustrate the proposedmodel.

2002
Zoran Vondraček

Abstract. Subordination of a killed Brownian motion in a bounded domain D ⊂ R via an α/2-stable subordinator gives a process Zt whose infinitesimal generator is −(− |D), the fractional power of the negative Dirichlet Laplacian. In this paper we study the properties of the process Zt in a Lipschitz domain D by comparing the process with the rotationally invariant α-stable process killed upon exi...

2005
B. Kawohl P. Juutinen

We consider the p–Laplacian operator on a domain equipped with a Finsler metric. We recall relevant properties of its first eigenfunction for finite p and investigate the limit problem as p → ∞.

Journal: :Discussiones Mathematicae Graph Theory 2015
Jochen Harant Julia Niebling Sebastian Richter

Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving the smallest ordinary or the largest normalized Laplacian eigenvalue of G are presented.

2009
MADELEINE R UDELL Yoel Shkolnisky

Eigenfunction methods for mapping high dimensional data sets into lower dimensional spaces are useful in a broad range of applications. In particular, a recent paper by Jones et al [2] shows that eigenfunctions of the Laplacian operator give a good local coordinate system under very general conditions. Here I outline the proof of the theorem and explore its use in cryo-electron microscopy.

Journal: :Asymptotic Analysis 2011
Dorian Le Peutrec

In this article, we are interested in the exponentially small eigenvalues of the self adjoint realization of the semiclassical Witten Laplacian ∆ f,h, in the general framework of p-forms, on a connected compact Riemannian manifold without boundary. Our purpose is to notice that the knowledge of (the asymptotic formulas for) the smallest non zero eigenvalues of the self adjoint realization of ∆ ...

Journal: :Linear Algebra and its Applications 2022

It is known that there an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and branches. Moreover, the algebraic connectivity a tree edge can be expressed in terms value. In this article, we consider matrix edges. More precisely, are interested following classes weights: definite weights, lower (or upper) triangular diagona...

Journal: :Eur. J. Comb. 2003
Xiao-Dong Zhang

In this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize all connected graphs with exactly three Laplacian eigenvalues no less than two. Moreover, we determine bipartite graphs such that the adjacency matrices of their line graphs have exactly three nonnegative eigenvalues. © 2003 Elsevier Ltd. All rights reser...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید