Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: algebraic equations

Sortuj według:

Ogranicz wyniki do:

Application of reanalysis methods in structural mechanics

Delyová I., Frankovský P., Bocko J., Sivák P., Kurimský R.

International Journal of Applied Mechanics and Engineering

2022

Vol. 27, no. 3

49--62

When designing structures, it is often necessary to re-analyse a structure that is different in some parts from the original one. As real structures are often complex, their analysis is therefore very challenging. In such cases, reanalysis methods are advantageously used. The aim of this paper is to approach the problem of solving the constructions using reanalysis method in which the time taken in solving algebraic equations is reduced. In particular, the purpose of this work is to demonstrate on a chosen system the time savings and the advantages of the chosen direct efficient reanalysis method for a given design problem. A basic condition for meeting these criteria is the modernization of computational procedures in the mechanics of compliant solids.

A Holistic State Equation for Timed Petri Nets

Werner M., Popova-Zeugmann L., Haustein M., Pelz E.

Fundamenta Informaticae

2014

Vol. 133, nr 2/3

305--322

In this paper we investigate Timed Petri nets (TPN) with fixed, possibly zero, durations and maximal step semantics. We define a new state representationwhere a state is a pair of a marking for the places and a marking for the transitions (a matrix of clocks). For this representation of states we provide an algebraic state equation. Such a state equation lets us prove a sufficient condition for the non-reachability of a state in a TPN. This application of the state equation is subsequently illustrated by an example.

Acceleration de la convergence de la methode de la plus forte pente

Djeghaba N., Benzine R.

Demonstratio Mathematica

2006

Vol. 39, nr 1

169-181

Let (P) be the following problem of optimization without constraints (P) min{f(x) : x is an element of Rn}. We study in this paper an algorithm which acceleretes the convergence of the steepest descent method.