In this paper we present an algorithm able to provide geometrically optimal algebraic grids by using condition numbers as quality measure. In fact, the solution of partial differential equations (PDEs) to model complex problems needs an efficient algorithm to generate a good quality grid since better geometrical grid quality is gained, faster accuracy of the numerical solution can be kept. Moving from classical approaches, we derive new measures based on the condition numbers of appropriate cell matrices to control grid uniformity and orthogonality. We assume condition numbers in appropriate norms as building blocks of objective functions to be minimized for grid optimization.
An Algebraic Grid Optimization Algorithm Using Condition Numbers
Rosa Maria Spitaleri
2006
Abstract
In this paper we present an algorithm able to provide geometrically optimal algebraic grids by using condition numbers as quality measure. In fact, the solution of partial differential equations (PDEs) to model complex problems needs an efficient algorithm to generate a good quality grid since better geometrical grid quality is gained, faster accuracy of the numerical solution can be kept. Moving from classical approaches, we derive new measures based on the condition numbers of appropriate cell matrices to control grid uniformity and orthogonality. We assume condition numbers in appropriate norms as building blocks of objective functions to be minimized for grid optimization.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


