Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    KACZMARZ ALGORITHM AND FRAMES

    Sequences of unit vectors for which the Kaczmarz algorithm always converges in Hilbert space can be characterized in frame theory by tight frames with constant 1. We generalize this result to the context of frames and bases. In particular, we show that the only effective sequences which are Riesz bases are orthonormal bases. Moreover, we consider the infinite system of linear algebraic equations Ax = b and characterize the (bounded) matrices A for which the Kaczmarz algorithm always converges to a solution.

  • articleNo Access

    Discrete linear canonical shearlet transform

    In this paper, we introduce the continuous and discrete version of the linear canonical shearlet transform (LCST). The authors begin with the definition of the LCST and then establish a relationship between the linear canonical transform (LCT) and the LCST. Next, the paper derives several basic properties like Parseval’s Formula, inversion formula, and the characterization of the transform’s range. In addition to the continuous version of the transform, the authors also present a discrete version of the LCST. This discrete version allows for practical implementation and efficient computation of the transform in digital signal processing systems. Lastly, the paper establishes a frame condition for the discrete LCST, which thereby helps in establishing the reconstruction formula for the discrete LCST. The paper ends with a conclusion.

  • articleNo Access

    On the Use of Total State Decompositions for the Study of Reduced Dynamics

    The description of the dynamics of an open quantum system in the presence of initial correlations with the environment needs different mathematical tools than the standard approach to reduced dynamics, which is based on the use of a time-dependent completely positive trace preserving (CPTP) map. Here, we take into account an approach that is based on a decomposition of any possibly correlated bipartite state as a conical combination involving statistical operators on the environment and general linear operators on the system, which allows one to fix the reduced-system evolution via a finite set of time-dependent CPTP maps. In particular, we show that such a decomposition always exists, also for infinite dimensional Hilbert spaces, and that the number of resulting CPTP maps is bounded by the Schmidt rank of the initial global state. We further investigate the case where the CPTP maps are semigroups with generators in the Gorini-Kossakowski-Lindblad-Sudarshan form; for two simple qubit models, we identify the positivity domain defined by the initial states that are mapped into proper states at any time of the evolution fixed by the CPTP semigroups.