Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
A computationally efficient and tractable method is presented to find the best equilibrium in a finite 2-person game played with staircase-function strategies. The method is based on stacking equilibria of smaller-sized bimatrix games, each defined on a time unit where the pure strategy value is constant. Every pure strategy is a staircase function defined on a time interval consisting of an integer number of time units (subintervals). If a time-unit shifting happens, where the initial time interval is narrowed by an integer number of time units, the respective equilibrium solution of any “narrower” subgame can be taken from the “wider” game equilibrium. If the game is uncountably infinite, i. e. a set of pure strategy possible values is uncountably infinite, and all time-unit equilibria exist, stacking equilibria of smaller-sized 2-person games defined on a rectangle works as well.
EN
The paper deals with the solution of problems that concern fractional time derivatives. Specifically the author’s interest lies in solving circuit problems with so called fractional capacitors and fractional inductors. A numerical method is proposed that involves polynomial interpolation and the division of the entire time interval (for which computations are performed) into subintervals. Analytical formulae are derived for the integro-differentiation according to the Caputo fractional derivative. The rules that concern the subinterval dynamics throughout the computation are also presented in the paper. For exemplary linear circuit problems (AC and transient) involving fractional order elements the solutions have been obtained. These solutions are compared with ones obtained by means of traditional methods.
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ć.