English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In current work, a novel intelligent computational technique is adopted for searching the behaviour of the problem of buckling of nano-actuators in the presence of various nonlinear forces. In order to accomplish this aim, the governing integro-differential equation in general form is taken into account for nano-actuators, which contains various nonlinear forces as well. This generalized form for the nano-actuators is in fact a non-linear fourth-order Fredholm integro-differential boundary value problem. The boundary value problem is transformed into an equivalent problem whose boundary conditions are such that it is convenient to apply reformed version of the Chebyshev polynomials of the first kind. These Chebyshev polynomials based functions construct approximate series solution with unknown weights. The mathematical formulation of optimization problem consists of an uninspected error which is minimized through adjusting weights via interior point method. The trial approximate solution is validated by imposing tolerance constrained into optimization problem. This numerical technique enables us to overcome all kind of nonlinearities in the mentioned boundary value problem, and then to obtain an accurate solution. Thus, it can expedite the design of nano-actuators.

Buckling of Doubly Clamped Nano-Actuators in General Form through Optimized Chebyshev Polynomials with Interior Point Algorithm