In an adaptive grid, the physics of the problem at hand must ultimately direct the grid points to distribute themselves so that a functional relationship on these points can represent the physical solution with sufficient accuracy. The idea is to have the grid points move as the physical solution develops, concentrating in regions of large variation in the solution as they emerge. The mathemati...

Probabilistic fracture mechanics is a well-established method for predicting the probability-of-fracture (POF) of gas turbine engine rotor disks subject to low-cycle fatigue. An adaptive risk refinement methodology (ARRM) was developed to automate zone discretization and refinement that are typically associated with this approach. ARRM generates initial meshes using an adaptive nodal selection ...

Adaptive mesh refinement is one of the most important tools in Computational Fluid Dynamics (CFD) for solving complex engineering design problems. The paper investigates two practical transonic aerofoil design optimization problems using a genetic algorithm coupled with an Euler aerodynamic analysis tool. The first problem consists in the minimization of transonic drag whereas the second is a r...

A new adaptive mesh refinement algorithm is proposed for solving Euler discretization of stateand control-constrained optimal control problems. Our approach is designed to reduce the computational effort by applying the inexact restoration (IR) method, a numerical method for nonlinear programming problems, in an innovative way. The initial iterations of our algorithm start with a coarse mesh, w...

Shape as well as force is required to represent the cloth in virtual environment. A model, based on the cost functions, realizes the shape together with force by using physical data obtained from Kawabata Evaluation System. However, cost/ energy minimization technique is very slow that restricts the increase of mesh density. Some of previous work has employed the adaptive refinement in this reg...

A new adaptive mesh refinement algorithm is proposed for solving Euler discretization of stateand control-constrained optimal control problems. Our approach is designed to reduce the computational effort by applying the inexact restoration (IR) method, a numerical method for nonlinear programming problems, in an innovative way. The initial iterations of our algorithm start with a coarse mesh, w...