Sequence factorial and its applications

In this note, we introduce sequence factorial and use this to study generalized M-bonomial coefficients. For the sequence of natural numbers, the twin concepts of sequence factorial and generalized M-bonomial coefficients, respectively, extend the corresponding concepts of factorial of an integer and binomial coefficients. Some latent properties of generalized M-bonomial coefficients by which a vast majority of practical problems involving generalized M-bonomial coefficients can be solved are derived.     

A new look at localic interpolation theorems

This paper presents a new treatment of the localic Katětov-Tong interpolation theorem, based on an analysis of special properties of normal frames, which shows that it does not hold in full generality. Besides giving us the conditions under which the localic Katětov-Tong interpolation theorem holds, this approach leads to a especially transparent and succinct proof of it. It is also shown that this pointfree extension of Katětov-Tong theorem still covers the localic versions of Urysohn's Lemma and Tietze's Extension Theorem.     

二重三角插值多项式的求和因子法求和

选取一组求和因子ρａ,β构造了二重三角插值算子Ｆｍｎ（ｆ;ｙ）,使对于任意的ｆ（ｘ,ｙ）∈Ｃ２π,２π都能在全面上一致收敛,且达到最佳收敛阶。     

A second look at set convergence and linear analysis

We review the connections between various modes of convergence for sequences of continuous linear functionals and the convergence of their level sets at fixed heights, and show that these relationships also hold for the associated sequence of graphs. Passiamo in rassegna i legami fra vari tipi di convergenza di successioni di funzionali lineari e continui e la convergenza dei loro insiemi di livello a quota fissata; mostriamo che queste relazioni valgono anche per la successione associata dei grafici.

---

(Conferenza tenuta il 10 luglio 1989)     

Approximations first: a closer look at applications of the definite integral*

I propose that students pay more attention to the approximations that lead to integral formulas when they study applications of the definite integral. The goal is to focus students on the underlying concepts and the definition of the definite integral – and to steer them away from memorizing formulas. To address this goal, I have written some computer-based activities that guide students through the nuts and bolts of the approximations that eventually lead to integral formulas. I describe the activities and suggest a few changes as to how we might approach this material.     

A Lobatto interpolation grid over the triangle

^** Email: m.blyth{at}uea.ac.uk^*** Email: cpozrikidis{at}ucsd.edu A sequence of increasingly refined interpolation grids overthe triangle is proposed, with the goal of achieving uniformconvergence and ensuring high interpolation accuracy. The numberof interpolation nodes, N, corresponds to a complete mth-orderpolynomial expansion with respect to the triangle barycentriccoordinates, which arises by the horizontal truncation of thePascal triangle. The proposed grid is generated by deployingLobatto interpolation nodes along the three edges of the triangle,and then computing interior nodes by averaged intersectionsto achieve three-fold rotational symmetry. Numerical computationsshow that the Lebesgue constant and interpolation accuracy ofthe proposed grid compares favorably with those of the best-knowngrids consisting of the Fekete points. Integration weights correspondingto the set of Lobatto triangle base points are tabulated.     

C^1 C^2 INTERPOLATION OF SCATTERED DATA POINTS

In this paper an error in [4] is pointed out and a method for constructing surface interpolating scattered data points is presented, The main feature of the method in this paper is that the surface so constructed is polynomial, which makes the construction simple and the calculation easy.     

Approximation error for linear polynomial interpolation onn-simplices

LetW _n ² M be the class of functionsf: Δ _n → ℝ (when Δ _n is ann-simplex) with bounded second derivative (whose absolute value does not exceedM>0) along any direction at an arbitrary point of the simplex Δ _n . LetP _1,n (f;x) be the linear polynomial interpolatingf at the vertices of the simplex. We prove that there exists a functiong ∈ W _n ² M such that for anyf ∈W _n ² M and anyx ∈ Δ _n one has |f (x)−P ₁, _n (f;x)|≤g(x). Translated fromMatematicheskie Zametki, Vol. 60, No. 4, pp. 504–510, October, 1996. I thank Yu. N. Subbotin for posing the problem and for his attention to my work.     

A new look at the Lanczos algorithm for solving symmetric systems of linear equations

Simple versions of the conjugate gradient algorithm and the Lanczos method are discussed, and some merits of the latter are described. A variant of Lanczos is proposed which maintains robust linear independence of the Lanczos vectors by keeping them in secondary storage and occasionally making use of them. The main applications are to problems in which (1) the cost of the matrix-vector product dominates other costs, (2) there is a sequence of right hand sides to be processed, and (3) the eigenvalue distribution of A is not too favorable.     

Bounds for a class of linear functionals with applications to Hermite interpolation

A general estimation theorem is given for a class of linear functionals on Sobolev spaces. The functionals considered are those which annihilate certain classes of polynomials. An interpolation scheme of Hermite type is defined inN-dimensions and the accuracy in approximation is bounded by means of the above mentioned theorem. In one and two dimensions our schemes reduce to the usual ones, however our estimates in two dimensions are new in that they involve only the pure partial derivatives.This research was supported in part by the National Science Foundation under grant number N.S.F.-G.P.-9467.     

An integral linear interpolation approach to the design of incremental line algorithms

A unified treatment of incremental line-drawing algorithms understood from the viewpoint of rounded interpolation, covering Bresenham's algorithm, run-length algorithms, and multistep versions of both.     

三角插值中的线性求和问题

本文通过选取求和因子构造出和式型三角插值多项式Ｈｎ（ｆ，ｒ，ｘ）（ｒ为奇自然数），使其在全实轴上一致地收敛到以２π为周期的连续函数ｆ（ｘ），且Ｈｎ（ｆ，ｒ，ｘ）对Ｃｎ２π（ｌ≤ｒ）连续函数类的逼近均达到最佳收敛阶．Ｈｎ（ｆ，ｒ，ｘ）的饱和阶为１／ｎ（ｒ＋１），饱和函数类为ｆ（ｒ）（ｘ）∈Ｌｉｐｍｌ．     

Correction to: Kernel-based interpolation at approximate Fekete points

Numerical Algorithms - An equation in Section 2.1 has been corrected.     

An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making

Multiple criteria decision making is a well established field encompassing aspects of search for solutions and selection of solutions in presence of more than one conflicting objectives. In this paper, we discuss an approach aimed towards the latter. The decision maker is presented with a limited number of Pareto optimal outcomes and is required to identify regions of interest for further investigation. The inherent sparsity of the given Pareto optimal outcomes in high dimensional space makes it an arduous task for the decision maker. To address this problem, an existing line of thought in literature is to generate a set of approximated Pareto optimal outcomes using piecewise linear interpolation. We present an approach within this paradigm, but one that delivers a comprehensive linearly interpolated set as opposed to its subset delivered by existing methods. We illustrate the advantage in doing so in comparison to stricter non-dominance conditions imposed in existing PAreto INTerpolation method. The interpolated set of outcomes delivered by the proposed approach are non-dominated with respect to the given Pareto optimal outcomes, and additionally the interpolated outcomes along uniformly distributed reference directions are presented to the decision maker. The errors in the given interpolations are also estimated in order to further aid decision making by establishing confidence in achieving true Pareto outcomes in their vicinity. The proposed approach for interpolation is computationally less demanding (for higher number of objectives) and also further amenable to parallelization. We illustrate the performance of the approach using six well established tri-objective test problems and two real-life examples. The problems span different types of fronts, such as convex, concave, mixed, degenerate, highlighting the wide applicability of the approach.