Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: metoda interwałowa

Sortuj według:

Ogranicz wyniki do:

Obliczenie metodami interwałowymi powierzchni oporowej słupów żelbetowych do podparcia konstrukcji nośnych

Kinasz R., Walaszczyk J.

Zeszyty Naukowe Politechniki Rzeszowskiej. Budownictwo i Inżynieria Środowiska

2004

z. 37[211], cz.1

165-172

In linear target setting the problem has been solved and mechanisms of core section behavior of reinforce concrete column at statistical introduction of its physical-mechanical and geometrical parameters have been studied. Linear measure histograms of core section half-diagonals of reinforce concrete columns with roughly known characteristics were made. It is shown, that at special strengthening of pillar's bearing area its dimensions could be minimized to provide practically full absence of probable appearing of negative strain pressure in concrete. It is established, that impossible to achieve essential increasing the bearing area due to parameters of steel reinforcement and concrete, thus it is necessary to pay more attention to its precise calculation to avoid appearing of strain pressure because of geometrical and physical uncertainty of parameters.

Applying the Interval Multistep Methods of Adams Type to Solution Simple Pendulum Problem

Jankowska M.

Vibrations in Physical Systems

2004

Vol. 21

167--170

Jeszcze o prostej dostatecznie grubej w odpowiedzi M. W. Gutowskiemu

Zięba A.

Postępy Fizyki

2003

T. 54, z. 3

123-127

Unconstrained and constrained global optimization using interval analysis

Kubica B., Niewiadomska-Szynkiewicz E.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2002

z. 139

185--199

This chapter presents techniques adressed to continuous, unconstrained and constrained optimization problems. Global optimization is defined as the problem of finding points on a bounded subset of X of Rn in which some real valued function f reaches its optimal (minimum or maximum) value. The algorithms considered are based on the branch-and-bound principles where the problem domain is partitioned iteratively. They apply interval arithmetic tools. The main objective is to discuss the advantages and disadvantages of existing algorithms and to provide some modifications for increasing their efficiency. The numerical results for several test problems are presented in the final part of the chapter.