• Corpus ID: 18178738

# The Spectral Basis and Rational Interpolation

```@article{Sobczyk2006TheSB,
title={The Spectral Basis and Rational Interpolation},
author={Garret Sobczyk},
journal={arXiv: Numerical Analysis},
year={2006}
}```
• G. Sobczyk
• Published 18 February 2006
• Mathematics
• arXiv: Numerical Analysis
The Euclidean Algorithm is the often forgotten key to rational approximation techniques, including Taylor, Lagrange, Hermite, osculating, cubic spline, Chebyshev, Pade and other interpolation schemes. A unified view of these various interpolation techniques is eloquently expressed in terms of the concept of the spectral basis of a factor ring of polynomials. When these methods are applied to the minimal polynomial of a matrix, they give a family of rational forms of functions of that matrix.
18 Citations
Generalized Taylor's Theorem
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to
Linear and Bilinear Forms
Geometric algebra is not used in this chapter. The material presented is closely related to the material in Sect. 7.1 but represents a change of viewpoint. Instead of talking about the reciprocal
Differential Geometry of Curves
The study of the differential geometry of surfaces rightly begins with the study of curves, since a curve can be considered to be a 1-dimensional surface, and a more general surface can be considered
Complex and Hyperbolic Numbers
The complex numbers were grudgingly accepted by Renaissance mathematicians because of their utility in solving the cubic equation.1 Whereas the complex numbers were discovered primarily for algebraic
Vector Spaces and Matrices
We begin this chapter with the formal definition of a vector space. Multiplication of matrices is defined in terms of the product of a row vector and a column vector. Since the rules of matrix
Mappings Between Surfaces
In this chapter we explore when a mapping will preserve geodesics, the shortest distances between two points on a surface, and when a mapping will preserve the angles between the intersection of two
Linear Transformations on {\mathbb{R}}^{n}
The definition of a linear transformation on \({\mathbb{R}}^{n}\), and its natural extension to an outermorphism on all of the geometric algebra \({\mathbb{G}}_{n}\), is given. The tools of geometric
Modular Number Systems
We begin by exploring the algebraic properties of the modular numbers, sometimes known as clock arithmetic, and the modular polynomials. The modular numbers and modular polynomials are based upon the
Outer Product and Determinants
The outer product of vectors is closely related to the concept of a determinant. The outer products of vectors and determinants are very important tools in the study of the structure of a linear
Systems of Linear Equations
We give a rather conventional treatment of the study of a system of linear equations by using the augmented matrix of the system. The so-called LU decomposition of a matrix is introduced, together