Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "zagadnienie" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    On The Two-Step Iterative Method of Solving Frictional Contact Problems in Elasticity
    Autorzy:
    Angelov, T. A.
    Liolios, A. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/911138.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    zagadnienie kontaktowe
    współczynnik tarcia
    metoda iteracyjna
    contact problem
    friction coefficient
    iterative method
    Opis:
    A class of contact problems with friction in elastostatics is considered. Under a certain restriction on the friction coefficient, the convergence of the two-step iterative method proposed by P.D. Panagiotopoulos is proved. Its applicability is discussed and compared with two other iterative methods, and the computed results are presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 197-203
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Identification of a Quasilinear Parabolic Equation from Final Data
    Autorzy:
    Fernandez, L. A.
    Pola, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/908074.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    quasi-liniowy
    zagadnienie odwrotności
    oznaczenie parametru
    quasilinear parabolic equation
    inverse problem
    parameter estimation
    Opis:
    We study the identification of the nonlinearities A, vec{b} and c appearing in the quasilinear parabolic equation y_t - div (A(y) nabla y + vec{b} (y)) + c(y) = u in Omega x (0,T), assuming that the solution of an associated boundary value problem is known at the terminal time, y(x,T), over a (probably small) subset of Omega, for each source term u. Our work can be divided into two parts. Firstly, the uniqueness of A, vec{b} and c is proved under appropriate assumptions. Secondly, we consider a finite-dimensional optimization problem that allows for the reconstruction of the nonlinearities. Some numerical results in the one-dimensional case are presented, even in the case of noisy data.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2001, 11, 4; 859-879
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A verified method for solving piecewise smooth initial value problems
    Autorzy:
    Auer, E.
    Kiel, S.
    Rauh, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/331354.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    interval method
    non smooth system
    initial value problem
    metoda przedziałowa
    metoda nie gładka
    zagadnienie początkowe
    Opis:
    In many applications, there is a need to choose mathematical models that depend on non-smooth functions. The task of simulation becomes especially difficult if such functions appear on the right-hand side of an initial value problem. Moreover, solution processes from usual numerics are sensitive to roundoff errors so that verified analysis might be more useful if a guarantee of correctness is required or if the system model is influenced by uncertainty. In this paper, we provide a short overview of possibilities to formulate non-smooth problems and point out connections between the traditional non-smooth theory and interval analysis. Moreover, we summarize already existing verified methods for solving initial value problems with non-smooth (in fact, even not absolutely continuous) right-hand sides and propose a way of handling a certain practically relevant subclass of such systems. We implement the approach for the solver VALENCIA-IVP by introducing into it a specialized template for enclosing the first-order derivatives of non-smooth functions. We demonstrate the applicability of our technique using a mechanical system model with friction and hysteresis. We conclude the paper by giving a perspective on future research directions in this area.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 731-747
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Negotiating transfer pricing using the Nash bargaining solution
    Autorzy:
    Clempner, J. B.
    Poznyak, A. S.
    Powiązania:
    https://bibliotekanauki.pl/articles/330210.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    negotiated transfer pricing
    Nash bargaining
    tax avoidance
    corporate taxation
    zagadnienie przetargowe Nasha
    unikanie podatku
    opodatkowanie przedsiębiorstw
    Opis:
    This paper analyzes and proposes a solution to the transfer pricing problem from the point of view of the Nash bargaining game theory approach. We consider a firm consisting of several divisions with sequential transfers, in which central management provides a transfer price decision that enables maximization of operating profits. Price transferring between divisions is negotiable throughout the bargaining approach. Initially, we consider a disagreement point (status quo) between the divisions of the firm, which plays the role of a deterrent. We propose a framework and a method based on the Nash equilibrium approach for computing the disagreement point. Then, we introduce a bargaining solution, which is a single-valued function that selects an outcome from the feasible pay-offs for each bargaining problem that is a result of cooperation of the divisions of the firm involved in the transfer pricing problem. The agreement reached by the divisions in the game is the most preferred alternative within the set of feasible outcomes, which produces a profit-maximizing allocation of the transfer price between divisions. For computing the bargaining solution, we propose an optimization method. An example illustrating the usefulness of the method is presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 853-864
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An advance in infinite graph models for the analysis of transportation networks
    Autorzy:
    Cera, M.
    Fedriani, E. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330503.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    infinite graph
    average degree
    extremal problems
    road transport network
    percolation threshold
    graf nieskończony
    zagadnienie ekstremum
    sieć transportowa
    próg perkolacji
    Opis:
    This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 855-869
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heating source localization in a reduced time
    Autorzy:
    Beddiaf, S.
    Autrique, L.
    Perez, L.
    Jolly, J. C.
    Powiązania:
    https://bibliotekanauki.pl/articles/331120.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    parameter identification
    inverse heat conduction problem
    optimal observation
    source localization
    identyfikacja parametryczna
    odwrotne zagadnienie termiczne
    obserwacja optymalna
    lokalizacja źródła
    Opis:
    Inverse three-dimensional heat conduction problems devoted to heating source localization are ill posed. Identification can be performed using an iterative regularization method based on the conjugate gradient algorithm. Such a method is usually implemented off-line, taking into account observations (temperature measurements, for example). However, in a practical context, if the source has to be located as fast as possible (e.g., for diagnosis), the observation horizon has to be reduced. To this end, several configurations are detailed and effects of noisy observations are investigated.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 623-640
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non-cooperative game approach to multi-robot planning
    Autorzy:
    Gałuszka, A.
    Świerniak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/908521.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    zagadnienie projektowe
    robot wielofunkcyjny
    gra niekooperatywna
    planowanie kompleksowe
    planning problems
    multi-robot environment
    STRIPS language
    non-cooperative games
    planning complexity
    Opis:
    A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm that solves the problem described above is proposed and its computational complexity is analyzed. To make the plan precise, non-cooperative strategies are used.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 3; 359-367
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A sign preserving mixed finite element approximation for contact problems
    Autorzy:
    Hild, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/907565.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    nierówność wariacyjna
    zagadnienie kontaktowe
    metoda elementów skończonych
    variational inequality
    positive operator
    averaging operator
    contact problem
    Signorini problem
    mixed finite element method
    Opis:
    This paper is concerned with the frictionless unilateral contact problem (i.e., a Signorini problem with the elasticity operator). We consider a mixed finite element method in which the unknowns are the displacement field and the contact pressure. The particularity of the method is that it furnishes a normal displacement field and a contact pressure satisfying the sign conditions of the continuous problem. The a priori error analysis of the method is closely linked with the study of a specific positivity preserving operator of averaging type which differs from the one of Chen and Nochetto. We show that this method is convergent and satisfies the same a priori error estimates as the standard approach in which the approximated contact pressure satisfies only a weak sign condition. Finally we perform some computations to illustrate and compare the sign preserving method with the standard approach.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 487-498
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid algorithm for solving inverse problems in elasticity
    Autorzy:
    Barabasz, B.
    Gajda-Zagórska, E.
    Migórski, S.
    Paszyński, M.
    Schaefer, R.
    Smołka, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/331427.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    inverse problem
    hierarchic genetic strategy
    hybrid optimization
    automatic hp adaptive finite element method
    zagadnienie odwrotne
    strategia genetyczna
    optymalizacja hybrydowa
    metoda elementów skończonych
    Opis:
    The paper offers a new approach to handling difficult parametric inverse problems in elasticity and thermo-elasticity, formulated as global optimization ones. The proposed strategy is composed of two phases. In the first, global phase, the stochastic hp-HGS algorithm recognizes the basins of attraction of various objective minima. In the second phase, the local objective minimizers are closer approached by steepest descent processes executed singly in each basin of attraction. The proposed complex strategy is especially dedicated to ill-posed problems with multimodal objective functionals. The strategy offers comparatively low computational and memory costs resulting from a double-adaptive technique in both forward and inverse problem domains. We provide a result on the Lipschitz continuity of the objective functional composed of the elastic energy and the boundary displacement misfits with respect to the unknown constitutive parameters. It allows common scaling of the accuracy of solving forward and inverse problems, which is the core of the introduced double-adaptive technique. The capability of the proposed method of finding multiple solutions is illustrated by a computational example which consists in restoring all feasible Young modulus distributions minimizing an objective functional in a 3D domain of a photo polymer template obtained during step and flash imprint lithography.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 865-886
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the numerical approximation of first-order Hamilton-Jacobi equations
    Autorzy:
    Abgrall, R.
    Perrier, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/929712.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    równanie Hamiltona-Jacobiego
    aproksymacja
    zagadnienie Cauchy'ego-Dirichleta
    siatka trójkątna
    approximation of Hamilton-Jacobi equations
    viscous solution
    Cauchy-Dirichlet problem
    triangular mesh
    Opis:
    Some methods for the numerical approximation of time-dependent and steady first-order Hamilton-Jacobi equations are reviewed. Most of the discussion focuses on conformal triangular-type meshes, but we show how to extend this to the most general meshes. We review some first-order monotone schemes and also high-order ones specially dedicated to steady problems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2007, 17, 3; 403-412
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies