The proper interpolation space for multivariate Birkhoff interpolation

Multivariate Birkhoff interpolation problem has many important applications, such as in finite element method. In this paper two algorithms are given to compute the basis of the minimal interpolation space and the lower interpolation space respectively for an arbitrary given node set and the corresponding interpolation conditions on each node. We can get the monomial basis, Newton-type basis as well as Lagrange-type basis. The interpolation polynomial can be derived from the basis directly.     

Birkhoff interpolation by Chebyshevian splines

This paper deals with the interpolation of the function and its derivative values at scatted points, so-called Birkhoff Interpolation, by piecewise Chebyshevian spline. Research supported in part by NSERC Canada under Grant ≠A7687. This research formed part of a Thesis written for the Degree of Master of Science at the University of Alberta undr the supervision of Professor S.D. Riemenschneider.     

Newton basis for multivariate Birkhoff interpolation

Multivariate Birkhoff interpolation is the most complex polynomial interpolation problem and people know little about it so far. In this paper, we introduce a special new type of multivariate Birkhoff interpolation and present a Newton paradigm for it. Using the algorithms proposed in this paper, we can construct a Hermite system for any interpolation problem of this type and then obtain a Newton basis for the problem w.r.t. the Hermite system.     

Birkhoff interpolation on non-uniformly distributed roots of unity

This paper studies some cases of (0,m)-interpolation on non-uniformly distributed roots of unity that were not covered before. The interpolation problem uses as nodes the zeros of (z ^k +1)(z ³–1) with k=3n+1, 3n+2. Proof of the regularity is more intricate than when k is divisible by 3, the case included in a previous paper by the authors. The interpolation problem appears to be regular for mk+3, a result that is in tune with the case k=3n mentioned before. However, it is necessary to treat the full general 18×18 linear system. For small values of m the determinant is calculated explicitly using MAPLE V, Release 5.     

Some Birkhoff interpolation problems on the roots of unity

The object of this note is to study three row almost Hermitian incidence matrices and to give sufficient conditions when the corresponding interpolation problem is regular on the roots of unity. In particular, a three row almost Hermitian matrix with only two nonzero entries in one row is regular on the cube roots of unity. Other situations are also examined in detail.     

On Birkhoff interpolation by polynomials in several variables

Chui and Lai (1987) have discussed a kind of multivariate polynomial interpolation problem defined on the straight line type node configuration C (SLTNCC). In this paper, we define general Birkhoff interpolation problems for the SLTNCC, and show, under some restrictions, that these interpolation problems are unisolvent. Also we give some generalizations of the SLTNCC.     

Order regularity of two-node Birkhoff interpolation with lacunary polynomials

In this short work we study the existence and uniqueness of solution for some Birkhoff interpolation problems with lacunary polynomials. First we solve the one-node problem; next we solve the two-node problem in the restricted case where one of the nodes is null.     

On a new kind of Birkhoff type trigonometric interpolation

In this paper we introduce a new kind of Birkhoff type interpolation of functions with period 2. We find necessary and sufficient conditions for regularity of this new interpolation problem. Moreover, a closed form expression for the interpolation polynomial is given.This work was supported by China State Major Key Project for Basic Researchers.     

A fast algorithm for the multivariate Birkhoff interpolation problem

Multivariate Birkhoff interpolation is the most complicated polynomial interpolation problem and the theory about it is far from systematic and complete. In this paper we derive an Algorithm B-MB (Birkhoff-Monomial Basis) and prove B-MB giving the minimal interpolation monomial basis w.r.t. the lexicographical order of the multivariate Birkhoff problem. This algorithm is the generalization of Algorithm MB in [L. Cerlinco, M. Mureddu, From algebraic sets to monomial linear bases by means of combinatorial algorithms, Discrete Math. 139 (1995) 73-87] which is a well known fast algorithm used to compute the interpolation monomial basis of the Hermite interpolation problem.     

On Birkhoff interpolation (0;2) case

P. Turán and his associates^[2] considered in detail the problem of (0,2) interpolation based on the zeros of π_n(x). Motivated by these results and an earlier result of Szabados and Varma^[9] here we consider the problem of existence, uniqueness and explicit representation of the interpolatory polynomial R_n(x) satis fying the function values at one set of nodes and the second derivative on the other set of nodes. It is important to note that this problem has a unique solution provided these two sets of nodes are chosen properly. We also promise to have an interesting convergence theorem in the second paper of this series, which will provide a solution to the related open problem of P. Turán.     

A fast algorithm for the multivariate Birkhoff interpolation problem

Multivariate Birkhoff interpolation is the most complicated polynomial interpolation problem and the theory about it is far from systematic and complete. In this paper we derive an Algorithm B-MB (Birkhoff-Monomial Basis) and prove B-MB giving the minimal interpolation monomial basis w.r.t. the lexicographical order of the multivariate Birkhoff problem. This algorithm is the generalization of Algorithm MB in [L. Cerlinco, M. Mureddu, From algebraic sets to monomial linear bases by means of combinatorial algorithms, Discrete Math. 139 (1995) 73–87] which is a well known fast algorithm used to compute the interpolation monomial basis of the Hermite interpolation problem.     

Birkhoff interpolation on some perturbed roots of unity: Revisited

We consider the regularity of Birkhoff interpolation on some non-uniformly distributed roots of unity. We determine the range of values of in the complex plane which makes the problem of lacunary interpolation on the zeros of (z ⁿ +1)(z–) regular.     

A Birkhoff theorem for partial algebras via completion

An equational theory (a Birkhoff theorem) for functorial partial algebras is established via the corresponding theory for functorial total algebras.This work was done with partial support of the DFG (BRD).Presented at the European Colloquium of Category Theory, Tours, France, 25–31 July 1994.     

Preconditioning spectral element schemes for definite and indefinite problems

Spectral element schemes for the solution of elliptic boundary value problems are considered. Preconditioning methods based on finite difference and finite element schemes are implemented. Numerical experiments show that inverting the preconditioner by a single multigrid iteration is most efficient and that the finite difference preconditioner is superior to the finite element one for both definite and indefinite problems. A multigrid preconditioner is also derived from the finite difference preconditioner and is found suitable for the CGS acceleration method. It is pointed out that, for the finite difference and finite element preconditioners, CGS does not always converge to the accurate algebraic solution. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 535–543, 1999     

Lagrange‐type basis for multivariate uniform integrable tensor‐product Birkhoff interpolation

Birkhoff interpolation is the most general interpolation scheme. We study the Lagrange‐type basis for uniform integrable tensor‐product Birkhoff interpolation. We prove that the Lagrange‐type basis of multivariate uniform tensor‐product Birkhoff interpolation can be obtained by multiplying corresponding univariate Lagrange‐type basis when the integrable condition is satisfied. This leads to less computational complexity, which drops to from .