The short-cut test (Q1766552): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jfa.2004.06.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JFA.2004.06.008 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The short-cut test |
scientific article |
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
