The short-cut test (Q1766552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The short-cut test |
scientific article; zbMATH DE number 2141639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The short-cut test |
scientific article; zbMATH DE number 2141639 |
Statements
The short-cut test (English)
0 references
8 March 2005
0 references
The existence of ``Laplacians'' on finitely ramified fractals was only known for the the very small subclass of nested fractals. In this paper the author proposes a short-cut test for the existence and uniqueness of Laplacians on finitely ramified graph directed fractals. The results of this paper improve and extend previous results by Sabot, Nussbaum and the author. The short-cut test proposed in this paper is of algorithmic and recursive nature.
0 references
Dirichlet forms
0 references
Gateau derivatives
0 references
existence and uniqueness of Laplacians on finitely ramified graph directed fractals
0 references
0 references
0.853873074054718
0 references
0.8009176850318909
0 references
0.7412612438201904
0 references
0.7139143347740173
0 references
0.7139143347740173
0 references
