scholarly journals An S-type upper bound for the largest singular value of nonnegative rectangular tensors

2016 ◽  
Vol 14 (1) ◽  
pp. 925-933 ◽  
Author(s):  
Jianxing Zhao ◽  
Caili Sang
Keyword(s):  
Upper Bound ◽  
Singular Value ◽  
Numerical Examples ◽  
Rectangular Tensors ◽  
Theoretical Results

AbstractAn S-type upper bound for the largest singular value of a nonnegative rectangular tensor is given by breaking N = {1, 2, … n} into disjoint subsets S and its complement. It is shown that the new upper bound is smaller than that provided by Yang and Yang (2011). Numerical examples are given to verify the theoretical results.

scholarly journals New bounds for the minimum eigenvalue of 𝓜-tensors

2017 ◽  
Vol 15 (1) ◽  
pp. 296-303 ◽  
Author(s):  
Jianxing Zhao ◽  
Caili Sang
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Minimum Eigenvalue ◽  
Numerical Examples ◽  
Theoretical Results

Abstract A new lower bound and a new upper bound for the minimum eigenvalue of an 𝓜-tensor are obtained. It is proved that the new lower and upper bounds improve the corresponding bounds provided by He and Huang (J. Inequal. Appl., 2014, 2014, 114) and Zhao and Sang (J. Inequal. Appl., 2016, 2016, 268). Finally, two numerical examples are given to verify the theoretical results.

scholarly journals E-eigenvalue inclusion theorems for tensors

Filomat ◽  
2019 ◽  
Vol 33 (12) ◽  
pp. 3883-3891
Author(s):  
Caili Sang ◽  
Jianxing Zhao
Keyword(s):  
Spectral Radius ◽  
Upper Bound ◽  
Inclusion Theorem ◽  
Numerical Examples ◽  
Nonnegative Tensors ◽  
Weakly Symmetric ◽  
Theoretical Results

Two Z-eigenvalue inclusion theorems for tensors presented by Wang et al. (Discrete Cont. Dyn.-B, 2017, 22(1): 187-198) are first generalized to E-eigenvalue inclusion theorems. And then a tighter E-eigenvalue inclusion theorem for tensors is established. Based on the new set, a sharper upper bound for the Z-spectral radius of weakly symmetric nonnegative tensors is obtained. Finally, numerical examples are given to verify the theoretical results.

scholarly journals Edge detection with trigonometric polynomial shearlets

2021 ◽  
Vol 47 (1) ◽  
Author(s):  
Kevin Schober ◽  
Jürgen Prestin ◽  
Serhii A. Stasyuk
Keyword(s):  
Edge Detection ◽  
Trigonometric Polynomial ◽  
Two Dimensions ◽  
Characteristic Functions ◽  
Numerical Examples ◽  
Special Cases ◽  
Periodic Characteristic ◽  
Boundary Curves ◽  
Theoretical Results ◽  
De La Vallée Poussin

AbstractIn this paper, we show that certain trigonometric polynomial shearlets which are special cases of directional de la Vallée Poussin-type wavelets are able to detect step discontinuities along boundary curves of periodic characteristic functions. Motivated by recent results for discrete shearlets in two dimensions, we provide lower and upper estimates for the magnitude of the corresponding inner products. In the proof, we use localization properties of trigonometric polynomial shearlets in the time and frequency domain and, among other things, bounds for certain Fresnel integrals. Moreover, we give numerical examples which underline the theoretical results.

scholarly journals Stability Analysis of Impulsive Control Systems with Finite and Infinite Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Xuling Wang ◽  
Xiaodi Li ◽  
Gani Tr. Stamov
Keyword(s):  
Control Systems ◽  
Impulsive Control ◽  
Sufficient Conditions ◽  
Delay Systems ◽  
Stability Criteria ◽  
Numerical Examples ◽  
Infinite Delays ◽  
Impulsive Control Systems ◽  
Stable Matrix ◽  
Theoretical Results

This paper studies impulsive control systems with finite and infinite delays. Several stability criteria are established by employing the largest and smallest eigenvalue of matrix. Our sufficient conditions are less restrictive than the ones in the earlier literature. Moreover, it is shown that by using impulsive control, the delay systems can be stabilized even if it contains no stable matrix. Finally, some numerical examples are discussed to illustrate the theoretical results.

An L∞-error Estimate for the h-p Version Continuous Petrov-Galerkin Method for Nonlinear Initial Value Problems

2015 ◽  
Vol 5 (4) ◽  
pp. 301-311 ◽  
Author(s):  
Lijun Yi
Keyword(s):  
Error Estimate ◽  
Galerkin Method ◽  
Error Bound ◽  
Initial Value Problems ◽  
Initial Value ◽  
Numerical Examples ◽  
Time Stepping ◽  
Theoretical Results

AbstractThe h-p version of the continuous Petrov-Galerkin time stepping method is analyzed for nonlinear initial value problems. An L∞-error bound explicit with respect to the local discretization and regularity parameters is derived. Numerical examples are provided to illustrate the theoretical results.

scholarly journals More Low Differential Uniformity Permutations over F22k with k Odd

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yue Leng ◽  
Jinyang Chen ◽  
Tao Xie
Keyword(s):  
Block Ciphers ◽  
Algebraic Degree ◽  
Differential Uniformity ◽  
Numerical Examples ◽  
High Nonlinearity ◽  
Substitution Boxes ◽  
Theoretical Results

Permutations with low differential uniformity, high algebraic degree, and high nonlinearity over F22k can be used as the substitution boxes for many block ciphers. In this paper, several classes of low differential uniformity permutations are constructed based on the method of choosing two permutations over F22k to get the desired permutations. The resulted low differential uniformity permutations have high algebraic degrees and nonlinearities simultaneously, which provide more choices for the substitution boxes. Moreover, some numerical examples are provided to show the efficacy of the theoretical results.

Compact splitting symplectic scheme for the fourth-order dispersive Schrödinger equation with Cubic-Quintic nonlinear term

2019 ◽  
Vol 10 (02) ◽  
pp. 1950007 ◽  
Author(s):  
Lang-Yang Huang ◽  
Zhi-Feng Weng ◽  
Chao-Ying Lin
Keyword(s):  
Schrödinger Equation ◽  
Fourth Order ◽  
Schrodinger Equation ◽  
Nonlinear Term ◽  
Order Accuracy ◽  
Numerical Examples ◽  
Splitting Technique ◽  
Symplectic Scheme ◽  
Theoretical Results ◽  
Discrete Charge

Combining symplectic algorithm, splitting technique and compact method, a compact splitting symplectic scheme is proposed to solve the fourth-order dispersive Schrödinger equation with cubic-quintic nonlinear term. The scheme has fourth-order accuracy in space and second-order accuracy in time. The discrete charge conservation law and stability of the scheme are analyzed. Numerical examples are given to confirm the theoretical results.

scholarly journals The Study of the Theoretical Size and Node Probability of the Loop Cutset in Bayesian Networks

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1079 ◽  
Author(s):  
Jie Wei ◽  
Yufeng Nie ◽  
Wenxian Xie
Keyword(s):  
Probability Theory ◽  
Graph Theory ◽  
Bayesian Inference ◽  
Bayesian Networks ◽  
Numerical Simulations ◽  
Complete Graph ◽  
Upper Bound ◽  
Numerical Algorithms ◽  
Theoretical Research ◽  
Theoretical Results

Pearl’s conditioning method is one of the basic algorithms of Bayesian inference, and the loop cutset is crucial for the implementation of conditioning. There are many numerical algorithms for solving the loop cutset, but theoretical research on the characteristics of the loop cutset is lacking. In this paper, theoretical insights into the size and node probability of the loop cutset are obtained based on graph theory and probability theory. It is proven that when the loop cutset in a p-complete graph has a size of p − 2 , the upper bound of the size can be determined by the number of nodes. Furthermore, the probability that a node belongs to the loop cutset is proven to be positively correlated with its degree. Numerical simulations show that the application of the theoretical results can facilitate the prediction and verification of the loop cutset problem. This work is helpful in evaluating the performance of Bayesian networks.

Sign in / Sign up

Export Citation Format

Share Document