Assumptions, Limitations and Applications of Bernoulli’s Equation
Abstract
The Euler-Bernoulli beam theory, also called “beam theory”, is a condensed version of the linear
isotropic theory of elasticity and can be used to predict the load-carrying and deflection properties of
beams. It was initially stated around the year 1750, but it was not widely used until the Eiffel Tower
and the Ferris Wheel were built in the late 19th century. It immediately became an engineering pillar
and a catalyst for the Second Industrial Revolution after these productive demonstrations. Although
other analytical techniques, including as plate theory and finite element analysis, have been
developed, beam theory remains a crucial tool in the sciences, particularly in structural and
mechanical engineering. The Euler-Bernoulli beam theory streamlines the linear theory of elasticity
in order to estimate the load-carrying and deflection properties of beams. The engineer’s beam theory
or the traditional beam theory are two names for this theory. It addresses the situation where a beam
solely experiences lateral loads and experiences modest deflections. It is therefore a specific instance
of Timoshenko beam theory since it disregards the effects of shear deformation and rotatory inertia.
Although it was initially mentioned sometime before 1750, it was not fully implemented until the late
19th century, when the Eiffel Tower and the Ferris Wheel were constructed.
Keywords
Full Text:
PDFReferences
Atlas LE, Cole R, Muthusamy Y, Lippman A, Connor G, Park DC et al. A performance
comparison of trained multi-layer perceptrons and classification trees. In: Lau C, editor, Neural
networks, theoretical foundations & analysis. IEEE Publications; 1992. p. 284–8, reprinted from
Proc IEEE. 1990. 78(10):1614-9. doi: 10.1109/5.58347.
Mattmüller M. The difficult birth of stochastics: Jacob Bernoulli's Ars Conjectandi (1713).
Historia Mathematica. 2014;41(3):277–290. doi: 10.1016/j.hm.2014.04.001.
Burg JP. Maximum entropy spectral analysis [Ph.D. dissertation]. Stanford, CA: Stanford
University; May 1975.
Christensen S, Oppacher F. What can we learn from No Free Lunch? A First Attempt to
Characterize the Concept of a searchable. Proceedings of the genetic and evolutionary
computation; 2001.
Morris SC. Life’s solution: inevitable humans in a lonely. Universe. September 8, 2003.
Corne DW, Knowles JD. No free lunch and free leftovers theorems for multiobjective
optimisation problems. Evol Multi Criterion Optim. Lect Notes Comput Sci. 2003:327–41. doi:
1007/3-540-36970-8_23.
Culberson JC. On the futility of blind search: an algorithmic view of no free lunch. Evol Comput.
;6(2):109–27. doi: 10.1162/evco.1998.6.2.109, PMID 10021743.
Davis M. The undecidable, basic papers on undecidable propositions, unsolvable problems and
computable functions. New York: Raven Press; 1965.
Dembski WA, Ii RJM. The Search for a Search: Measuring the Information Cost of Higher Level
Search. J Adv Comput Intell Intell Inform. 2010;14(5):475–86. doi: 10.20965/jaciii.2010.p0475.
Dembski WA, Marks RJ II. Conservation of information in search: measuring the cost of success.
IEEE Trans Syst Man Cybern A. September 2009;39(5):1051–61. doi:
1109/TSMCA.2009.2025027.
Dembski WA, Marks RJ II. Life’s conservation law: why Darwinian evolution cannot create
biological information. In: Gordon B, Dembski WA, editors, The nature of nature. Wilmington,
DE: Intercollegiate Studies Institute Books; 2010.
English TM. Evaluation of evolutionary and genetic optimizers: no free lunch. In: Fogel J,
Angeline PJ, Bäck T, editors. Evolutionary programming V. Proceedings of the fifth annual
conference on evolutionary programming, L. Cambridge, MA: MIT Press; 1996. p. 163–9.
Ewert W, Dembski WA, Marks RJ II. Evolutionary synthesis of Nand logic: dissecting a digital
organism. Proceedings of the 2009 IEEE international conference on systems, man, and
cybernetics, Oct 11–14, 2009, San Antonio, USA.
Fogel DB. Evolutionary computation: toward a new philosophy of machine intelligence. 3rd ed.
IEEE Publications; 2005.
Gödel K. Über formal unentscheidbare Sätze der Principia Mathematica und Verwandter
Systeme, Monatshefte Fr Mathematik und Physik. 1931;38:173–98.
DOI: https://doi.org/10.37628/ijsmfe.v8i1.1464
Refbacks
- There are currently no refbacks.