scholarly journals Shape Preserving Interpolation Using Rational Cubic Ball Function and Its Application in Image Interpolation

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Samsul Ariffin Abdul Karim ◽  
Azizan Saaban
Keyword(s):  
Tensor Product ◽  
Image Interpolation ◽  
Sufficient Condition ◽  
Shape Preserving ◽  
Straight Line ◽  
Shape Preserving Interpolation ◽  
Product Approach ◽  
The Given

New rational cubic Ball interpolation with one parameter is proposed for shape preserving interpolation such as positivity, monotonicity, and convexity preservations and constrained data lie on the same side of the given straight line. To produce shape preserving interpolant, the data dependent sufficient condition is derived on the parameter. The rational bicubic Ball function is constructed by using tensor product approach and it will be used for application in image upscaling. Numerical and graphical results are presented by using Mathematica and MATLAB including comparison with some existing scheme.

Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach

2018 ◽  
Vol 6 (5) ◽  
pp. 459-472
Author(s):  
Xujiao Fan ◽  
Yong Xu ◽  
Xue Su ◽  
Jinhuan Wang
Keyword(s):  
Tensor Product ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Product Approach ◽  
Matrix Expression ◽  
Necessary And Sufficient ◽  
Logical Functions

Abstract Using the semi-tensor product of matrices, this paper investigates cycles of graphs with application to cut-edges and the minimum spanning tree, and presents a number of new results and algorithms. Firstly, by defining a characteristic logical vector and using the matrix expression of logical functions, an algebraic description is obtained for cycles of graph, based on which a new necessary and sufficient condition is established to find all cycles for any graph. Secondly, using the necessary and sufficient condition of cycles, two algorithms are established to find all cut-edges and the minimum spanning tree, respectively. Finally, the study of an illustrative example shows that the results/algorithms presented in this paper are effective.

scholarly journals C1Rational Quadratic Trigonometric Interpolation Spline for Data Visualization

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Shengjun Liu ◽  
Zhili Chen ◽  
Yuanpeng Zhu
Keyword(s):  
Trigonometric Interpolation ◽  
Data Sets ◽  
Order Of Approximation ◽  
Shape Parameters ◽  
Interpolation Spline ◽  
Shape Preserving ◽  
Shape Preserving Interpolation ◽  
Trigonometric Spline ◽  
The Given ◽  
Data Constraints

A newC1piecewise rational quadratic trigonometric spline with four local positive shape parameters in each subinterval is constructed to visualize the given planar data. Constraints are derived on these free shape parameters to generate shape preserving interpolation curves for positive and/or monotonic data sets. Two of these shape parameters are constrained while the other two can be set free to interactively control the shape of the curves. Moreover, the order of approximation of developed interpolant is investigated asO(h3). Numeric experiments demonstrate that our method can construct nice shape preserving interpolation curves efficiently.

Gregarious star factorization of the tensor product of graphs

2018 ◽  
Vol 10 (04) ◽  
pp. 1850055
Author(s):  
P. Hemalatha
Keyword(s):  
Tensor Product ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient ◽  
The Given ◽  
Product Of Graphs

In this paper, it is shown that the necessary and sufficient condition for the existence of an [Formula: see text]-factorization of [Formula: see text] is [Formula: see text] for some integer [Formula: see text] for the given integers [Formula: see text] and [Formula: see text]

scholarly journals Positivity and Monotonicity Preserving Biquartic Rational Interpolation Spline Surface

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Xinru Liu ◽  
Yuanpeng Zhu ◽  
Shengjun Liu
Keyword(s):  
Sufficient Conditions ◽  
Rational Interpolation ◽  
Rectangular Domain ◽  
Interpolation Spline ◽  
Spline Surface ◽  
Surface Data ◽  
Shape Preserving Interpolation ◽  
The Given ◽  
Surface Construction ◽  
Special Case

A biquartic rational interpolation spline surface over rectangular domain is constructed in this paper, which includes the classical bicubic Coons surface as a special case. Sufficient conditions for generating shape preserving interpolation splines for positive or monotonic surface data are deduced. The given numeric experiments show our method can deal with surface construction from positive or monotonic data effectively.

scholarly journals Bipartite graphs with close domination and k-domination numbers

2020 ◽  
Vol 18 (1) ◽  
pp. 873-885
Author(s):  
Gülnaz Boruzanlı Ekinci ◽  
Csilla Bujtás
Keyword(s):  
Positive Integer ◽  
Dominating Set ◽  
Domination Number ◽  
Bipartite Graphs ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Minimum Cardinality ◽  
Vertex Set ◽  
Necessary And Sufficient ◽  
The Given

Abstract Let k be a positive integer and let G be a graph with vertex set V(G) . A subset D\subseteq V(G) is a k -dominating set if every vertex outside D is adjacent to at least k vertices in D . The k -domination number {\gamma }_{k}(G) is the minimum cardinality of a k -dominating set in G . For any graph G , we know that {\gamma }_{k}(G)\ge \gamma (G)+k-2 where \text{Δ}(G)\ge k\ge 2 and this bound is sharp for every k\ge 2 . In this paper, we characterize bipartite graphs satisfying the equality for k\ge 3 and present a necessary and sufficient condition for a bipartite graph to satisfy the equality hereditarily when k=3 . We also prove that the problem of deciding whether a graph satisfies the given equality is NP-hard in general.

A General Analysis of Sequential Social Learning

2021 ◽  
Author(s):  
Itai Arieli ◽  
Manuel Mueller-Frank
Keyword(s):  
Social Learning ◽  
Utility Function ◽  
Posterior Probability ◽  
General Analysis ◽  
Sufficient Condition ◽  
Important Class ◽  
General Utility ◽  
Learning Game ◽  
Necessary And Sufficient ◽  
The Given

This paper analyzes a sequential social learning game with a general utility function, state, and action space. We show that asymptotic learning holds for every utility function if and only if signals are totally unbounded, that is, the support of the private posterior probability of every event contains both zero and one. For the case of finitely many actions, we provide a sufficient condition for asymptotic learning depending on the given utility function. Finally, we establish that for the important class of simple utility functions with finitely many actions and states, pairwise unbounded signals, which generally are a strictly weaker notion than unbounded signals, are necessary and sufficient for asymptotic learning.

PRESCRIBED HORIZONTAL AND VERTICAL TREES PROBLEM OF QUADRATIC DIFFERENTIALS

2006 ◽  
Vol 08 (03) ◽  
pp. 381-399
Author(s):  
THOMAS KWOK-KEUNG AU ◽  
TOM YAU-HENG WAN
Keyword(s):  
Riemann Surface ◽  
Quadratic Differential ◽  
Quadratic Differentials ◽  
Sufficient Condition ◽  
Holomorphic Quadratic Differential ◽  
Simply Connected ◽  
The Given

A sufficient condition for the existence of holomorphic quadratic differential on a non-compact simply-connected Riemann surface with prescribed horizontal and vertical trees is obtained. In particular, for any pair of complete ℝ-trees of finite vertices with (n + 2) infinite edges, there exists a polynomial quadratic differential on ℂ of degree n such that the associated vertical and horizontal trees are isometric to the given pair.

Sign in / Sign up

Export Citation Format

Share Document