Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
  • Sesja wygasła!

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  projection operator
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available General remarks on dynamic projection method
EN
A brief history and a mathematical description of the dynamic projection operators technique is presented. An example of the general Cauchy problem for evolution equations in 1+ 1 dimensions is studied in detail. A boundary regime propagation is formulated in terms of operators and illustrated by the simplest one-dimensional diffusion equation. The problem of temperature waves is discussed.
EN
We show that, under some additional assumptions, all projection operators onto latticially closed subsets of the Orlicz-Musielak space generated by Φ are isotonic if and only if Φ is convex with respect to its second variable. A dual result of this type is also proven for antiprojections. This gives the positive answer to the problem presented in Opuscula Mathematica in 2012.
EN
In this paper we utilize the concept of the L 2 and H 1 projections used to adaptively generate a continuous approximation of an input material data in the finie element (FE) base.This approximation, along with a corresponding FE mesh, can be used as material data for FE solvers. We begin with abrief theoretical background, followed by description of the hp -adaptive algorithm adopted here to improve gradually quality of the projections. We investigate also a few distinct sample problems, apply the aforementioned algorithms and conclude with numerical results evaluation.
EN
The paper presents a new projection operator for graphs named AC-projection, which exhibits nice theoretical complexity properties unlike to the graph isomorphism operator typically used in graph mining. We study the size of the search space as well as some practical properties of the projection operator. We also introduce a novel breadth-first algorithm for frequent AC-reduced subgraphs mining. Then, we prove experimentally that we can achieve an important performance gain (polynomial complexity projection) without or with non-significant loss of discovered patterns in terms of quality.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.