• Title/Summary/Keyword: singular set

Search Result 103, Processing Time 0.023 seconds

SUFFICIENT CONDITION FOR THE DIFFERENTIABILITY OF THE RIESZ-NÁGY-TAKÁCS SINGULAR FUNCTION

  • Baek, In-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1173-1183
    • /
    • 2017
  • We give some sufficient conditions for the null and infinite derivatives of the $Riesz-N{\acute{a}}gy-Tak{\acute{a}}cs$ (RNT) singular function. Using these conditions, we show that the Hausdorff dimension of the set of the infinite derivative points of the RNT singular function coincides with its packing dimension which is positive and less than 1 while the Hausdorff dimension of the non-differentiability set of the RNT singular function does not coincide with its packing dimension 1.

A GENERALIZED SINGULAR FUNCTION

  • Baek, In-Soo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.657-661
    • /
    • 2010
  • We study a singular function which we call a generalized cylinder convex(concave) function induced from different generalized dyadic expansion systems on the unit interval. We show that the generalized cylinder convex(concave)function is a singular function and the length of its graph is 2. Using a local dimension set in the unit interval, we give some characterization of the distribution set using its derivative, which leads to that this singular function is nowhere differentiable in the sense of topological magnitude.

DERIVATIVE OF THE RIESZ-NÁGY-TAKÁCS FUNCTION

  • Baek, In-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.261-275
    • /
    • 2011
  • We give characterizations of the differentiability points and the non-differentiability points of the Riesz-N$\'{a}$gy-Tak$\'{a}$cs(RNT) singulr function using the distribution sets in the unit interval. Using characterizations, we show that the Hausdorff dimension of the non-differentiability points of the RNT singular function is greater than 0 and the packing dimension of the infinite derivative points of the RNT singular function is less than 1. Further the RNT singular function is nowhere differentiable in the sense of topological magnitude, which leads to that the packing dimension of the non-differentiability points of the RNT singular function is 1. Finally we show that our characterizations generalize a recent result from the ($\tau$, $\tau$ - 1)-expansion associated with the RNT singular function adding a new result for a sufficient condition for the non-differentiability points.

New Upper Bounds for the CALE: A Singular Value Decomposition Approach

  • Savov, Svetoslav G.;Popchev, Ivan P.
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.2
    • /
    • pp.288-294
    • /
    • 2008
  • Motivated by the fact that upper solution bounds for the continuous Lyapunov equation are valid under some very restrictive conditions, an attempt is made to extend the set of Hurwitz matrices for which such bounds are applicable. It is shown that the matrix set for which solution bounds are available is only a subset of another stable matrices set. This helps to loosen the validity restriction. The new bounds are illustrated by examples.

An Application of Linear Singular System Theory To Electric Circuits (선형 Singular 시스템 이론의 전기 회로에의 적용)

  • Hoon Kang
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.12
    • /
    • pp.1625-1632
    • /
    • 1988
  • This paper aims not only to introduce the concept of linear singular systems, geometric structure, and feedback but also to provide applications of the multivariable linear singular system theories to electric circuits which may appear in some electronic equipments. The impulsive or discontinuous behavior which is not desirable can be removed by the set of admissible initial conditions. The output-nulling supremal (A,E,B) invariant subspace and the singular system structure algorithm are applied to this double-input double-output electric circuit. The Weierstrass form of the pencil (s E-A) is related to the output-nulling supremal (A,E,B) invariant subspace from which the time domain solutions of the finite and the infinite subsystems are found. The generalized Lyapunov equation for this application with feedback is studied and finally, the use of orthogonal functions in singular systems is discussed.

  • PDF

SINGULARITY ORDER OF THE RIESZ-NÁGY-TAKÁCS FUNCTION

  • Baek, In-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.30 no.1
    • /
    • pp.7-21
    • /
    • 2015
  • We give the characterization of H$\ddot{o}$lder differentiability points and non-differentiability points of the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs (RNT) singular function ${\Psi}_{a,p}$ satisfying ${\Psi}_{a,p}(a)=p$. It generalizes recent multifractal and metric number theoretical results associated with the RNT function. Besides, we classify the singular functions using the singularity order deduced from the H$\ddot{o}$lder derivative giving the information that a strictly increasing smooth function having a positive derivative Lebesgue almost everywhere has the singularity order 1 and the RNT function ${\Psi}_{a,p}$ has the singularity order $g(a,p)=\frac{a{\log}p+(1-a){\log}(1-p)}{a{\log}a+(1-a){\log}(1-a)}{\geq}1$.

Switching Control for End Order Nonlinear Systems Using Sector Consisting of Singular Hyperplanes (특이공간으로 구성된 섹터를 이용한 2차 비선형 시스템의 스위칭 제어기 설계)

  • Yeom, D.H.;Im, K.H.;Choi, J.Y.
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.122-124
    • /
    • 2005
  • In this paper, we propose a switching control method for 2nd order nonlinear systems. The main idea behind the method is changing the control law before the trajectory of the solution arrives at the singularities imposed on the denominator of the control law. We show that the control system is asymptotically stable from the fact that the sector consisting of the singular hyperplanes is an invariant set. Illustrative examples are given.

  • PDF

ON TRIANGULAR STOCHASTIC MATRICES

  • Chon, In-Heung
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.3
    • /
    • pp.629-639
    • /
    • 1994
  • Loewner ([13]) showend the semigroup of the real non-singular totally positive matrices is generated by itsinfinitesimal elements, that is,s the set of all Jacobi matrices with non-negative off-diagonal elements. In general, a semigroup is not completely recreated from the set of its infinitesimal elements. We extend Loewner's work and show that the semi-group of all invertible upper (or lower) triangular stochastic matrices is generated by the set of its infinitesimal elements.

  • PDF

ASSVD: Adaptive Sparse Singular Value Decomposition for High Dimensional Matrices

  • Ding, Xiucai;Chen, Xianyi;Zou, Mengling;Zhang, Guangxing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2634-2648
    • /
    • 2020
  • In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.