DUAL FUNCTIONALS OF SAID-BEZIER TYPE GENERALIZED BALL BASES OVER TRIANGLE DOMAIN AND THEIR APPLICATION

A family of Said-Bézier type generalized Ball (SBGB) bases and surfaces with a parameter H over triangular domain is introduced, which unifies Bézier surface and Said-Ball surface and includes several intermediate surfaces. To convert different bases and surfaces, the dual functionals of bases are presented. As an application of dual functionals, the subdivision formulas for surfaces are established.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

Admissible slopes for monotone and convex interpolation

Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC ¹ interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C ¹ monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.     

Construction of the fundamental solution of disturbed parabolic equation

In present paper the parabolic equation solution is built. The construction is reduced to iterative procedure. And convergence of the latter is proven.     

A real algorithm for the Hermitian eigenvalue decomposition

Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.     

A note on minimization problems and multistep methods

Summary. We use the qualitative properties of the solution flow of the gradient equation to compute a local minimum of a real-valued function . Under the regularity assumption of all equilibria we show a convergence result for bounded trajectories of a consistent, strictly stable linear multistep method applied to the gradient equation. Moreover, we compare the asymptotic features of the numerical and the exact solutions as done by Humphries, Stuart (1994) and Schropp (1995) for one-step methods. In the case of -stable formulae this leads to an efficient solver for stiff minimization problems. Received July 10, 1995 / Revised version received June 27, 1996     

Thermal diffusivity measurements in porous ceramics by photothermal methods

Received: 16 September 1996/Accepted: 6 January 1997     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.     

Bouquet and join theorems for disentanglements

The disentanglement of certain augmentations is shown to be the topological join of a disentanglement and a Milnor fibre. The kth disentanglement of a finite map is defined and for corank 1 maps from ℂ ⁿ to ℂ ^{n +1} it is shown that they are homotopically equivalent to a wedge of spheres. Applications to the Mond conjecture are given. Oblatum 24-VII-2000 & 5-VII-2001?Published online: 12 October 2001