QUASI-CONSISTENT APPROXIMATION OF EFFECTIVE DIAGONALIZATION STRATEGIES FOR THE SOLUTION OF A CLASS OF OPTIMAL DESIGN PROBLEMS

Abstract

This paper continues the work of [3]. We determine successive approximation algorithm which consists of two sequences of progressively finer stages of discretization, diagonalization method, with a prescribed number of iterations of the optimization algorithm carried in each stage. The solutions of these problems are discretization strategies which minimize the time needed to reduce the initial cost-error by prescribed amount.