We investigated an interpolation algorithm for computing the Moore–Penrose inverse of a given polynomial matrix, based on the Leverrier–Faddeev method. Also, a method for ...

Computational environments that provide integrated numeric, symbolic, and graphical capabilities provide new opportunities for laboratories in Numerical Analysis. Hermite ...

We present a simple multivariate interpolation scheme of arbitrary dimensionality based on Mathematica. The only limitation of the scheme is that the data must be distributed ...

This paper extends a previous work done by the same authors on teaching 1d polynomial interpolation using Mathematica to higher dimensions. In this work, it is intended to ...

Two interpolation algorithms are presented for the computation of the inverse of a two variable polynomial matrix. The first interpolation algorithm, is based on the Lagrange ...

The problem of interpolation by a convex curve to the vertices of a convex polygon is considered. A natural 1-parameter family of C algebraic curves solving this problem is ...

We shall discuss a method for obtaining parametric equations of a smooth curve that passes through a sequence of points, and compare it to cubic splines and to the method of ...

For polynomials P(x) = A_n x^n + A_n-1 x^n-1 + ... + A_1 x + A_0 in a real scalar x, but with coefficients A_j that are rectangular matrices, a generalization of Newton's ...

We show how Mathematica can be used to obtain numerical solutions of integral equations by exploiting a combination of iteration and interpolation. The efficacy of the method ...

"The complete assurance that the procedure will never generate 'wild' points makes it attractive as a general-purpose procedure." --Russell Stineman, Boeing