A simple and systematic choice of admissible functions, which are the eigenfunctions of the closest, simple problem extracted from the one considered, is proposed. The ...

Designed for students with no previous knowledge of Mathematica, this book emphasizes applied mathematical and statistical methods, graphics, and programming. It will take ...

In this paper, we present an efficient numerical algorithm based on Adomian decomposition method for the approximate solution of linear and non-linear singular ...

Background: In this paper, a new method is presented that combines mechanical compliance effects with Poiseuille flow and push-out effects (“dead volume”) in one single ...

We present Runge–Kutta–Nyström type methods for the solution of a special fourth order initial value problem. Order conditions theory is given based on rooted trees. ...

Abstract Depending on the number of elements in a set, we may use a different method for constructing a Steiner triple system. For number of vertices v >= 7, if v = 3 (mod ...

The notebook simplex.ma contains a simplex command which produces a simplex tableau for a linear programming problem. Examples of its use to solve a standard maximization ...

A comprehensive set of transmutation chain benchmark problems for numerically validating methods for solving burnup equations was created. These benchmark problems were ...

The notebook computes the first and second derivative matrices using shifted Legendre polynomials (Finlayson, The method of Weighted Residuals and Variational Principles, ...

In this presentation a new robust technique employing expectation maximization to separate iteratively, outliers (corrupted data points) from inliers (true data points) ...