Abstract: In this paper, we have proposed a Haar wavelet quasilinearization
method to solve the well known Blasius equation. The
method is based on the uniform Haar wavelet operational matrix
defined over the interval [0, 1]. In this method, we have proposed the
transformation for converting the problem on a fixed computational
domain. The Blasius equation arises in the various boundary layer
problems of hydrodynamics and in fluid mechanics of laminar
viscous flows. Quasi-linearization is iterative process but our
proposed technique gives excellent numerical results with quasilinearization
for solving nonlinear differential equations without any
iteration on selecting collocation points by Haar wavelets. We have
solved Blasius equation for 1≤α ≤ 2 and the numerical results are
compared with the available results in literature. Finally, we
conclude that proposed method is a promising tool for solving the
well known nonlinear Blasius equation.
Abstract: The study of a real function of two real variables can be supported by visualization using a Computer Algebra System (CAS). One type of constraints of the system is due to the algorithms implemented, yielding continuous approximations of the given function by interpolation. This often masks discontinuities of the function and can provide strange plots, not compatible with the mathematics. In recent years, point based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of complex surfaces. In this paper we present different artifacts created by mesh surfaces near discontinuities and propose a point based method that controls and reduces these artifacts. A least squares penalty method for an automatic generation of the mesh that controls the behavior of the chosen function is presented. The special feature of this method is the ability to improve the accuracy of the surface visualization near a set of interior points where the function may be discontinuous. The present method is formulated as a minimax problem and the non uniform mesh is generated using an iterative algorithm. Results show that for large poorly conditioned matrices, the new algorithm gives more accurate results than the classical preconditioned conjugate algorithm.