10 resultados para Greens-function Solution

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

90.00% 90.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 90C26, 90C20, 49J52, 47H05, 47J20.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 26A33; Secondary 47G20, 31B05

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A hard combinatorial problem is investigated which has useful application in design of discrete devices: the two-block decomposition of a partial Boolean function. The key task is regarded: finding such a weak partition on the set of arguments, at which the considered function can be decomposed. Solving that task is essentially speeded up by the way of preliminary discovering traces of the sought-for partition. Efficient combinatorial operations are used by that, based on parallel execution of operations above adjacent units in the Boolean space.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partition on the set of arguments of the considered Boolean function, which should be decomposable at that partition. A new fast heuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such a partition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. After that the whole sought-for partition is restored from the discovered trace by building a track initialized by the trace and leading to the solution. The results of computer experiments testify the high practical efficiency of the algorithm.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

* Work is partially supported by the Lithuanian State Science and Studies Foundation.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 33C10, 33-02, 60K25

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26A33, 33C45

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Mathematics Subject Classification 2010: 26A33, 33E12.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dedicated to Professor A.M. Mathai on the occasion of his 75-th birthday. Mathematics Subject Classi¯cation 2010: 26A33, 44A10, 33C60, 35J10.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Л. И. Каранджулов, Н. Д. Сиракова - В работата се прилага методът на Поанкаре за решаване на почти регулярни нелинейни гранични задачи при общи гранични условия. Предполага се, че диференциалната система съдържа сингулярна функция по отношение на малкия параметър. При определени условия се доказва асимптотичност на решението на поставената задача.