A Novel Mesh Quality Improvement Method for Boundary Elements

Algorithm 3

Interval search algorithm.

function SEARCH_INTERVAL (f(), , , )

▸ f(x) = objective function

= initial coordinate for vertices

= initial step size

= coefficient larger than 1

compute = f() and Set j = 0

▸ j = iteration number

= + and compute f()

if then go to step (6)

else go to step (7)

= , = , =

f() = f(), j = j + 1

if j = 0 then = , = go to step (3)

else a = min, , b = max,

return and

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.