We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact embedding of polynomial nonlinearities into an infinite-dimensional linear system, which is then truncated to obtain a finite-dimensional representation with an a...

converge to a unique solution of the IVP up to the boundary of U [1]. In general, φn may converge slowly to the exact solution. The Picard iteration based integrator described in this paper has three main advantages. The the integrator has arbitrary order, is time adaptive, and has dense output. Dense output refers to the integrator being able to take time steps of variable length without havin...

a class of new methods based on a septic non-polynomial spline function for the numerical solution one-dimensional bratu's problem are presented. the local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. the inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. associated bound...

In this paper, we present a high-order approximate solution with uniform accuracy for nonlinear 3D Volterra integral equations. This numerical scheme is constructed based on the three-dimensional block cubic Lagrangian interpolation method. At same time, give local truncation error analysis of Taylor’s theorem. Through theoretical analysis, reach conclusion that optimal convergence order 4. Fin...

A new adaptive mesh refinement strategy is presented that couples feature-detection with local error-estimation. The goal is to guide refinement to key vortical features using feature detection, and to terminate refinement when a maximum acceptable error level has been reached. The feature detection scheme, which has been presented in previous related work, uses a special local normalization th...

Abstract. In this study, we consider new finite difference schemes for solving the Helmholtz equation. Novel difference schemes which do not introduce truncation error are presented, consequently the exact solution for the Helmholtz equation can be computed numerically. The most important features of the new schemes are that while the resulting linear system has the same simple structure as tho...

The Indian Buffet Process (IBP) is a nonparametric prior for latent feature models in which observations are influenced by a combination of hidden features. For example, images may be composed of several objects and sounds may consist of several notes. Latent feature models seek to infer these unobserved features from a set of observations; the IBP provides a principled prior in situations wher...