The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform

S. V. Hanagud - One of the best experts on this subject based on the ideXlab platform.

  • Chaos in a single equilibrium point system: Finite deformations
    Nonlinear Dynamics, 1991
    Co-Authors: E. K. Hall, S. V. Hanagud
    Abstract:

    The purpose of this paper is to examine a highly nonlinear model of a slender beam which yields chaotic solutions for some forcing amplitudes. The study is unique in that the governing partial differential equations are solved directly, and that the model lends itself to a more physical analysis of the beam than traditional chaotic models. In addition, the analysis will provide proof that a beam experiencing moderate deformations without stops or an initial axial force can exhibit chaotic motion. The model represents a simply-supported. Euler-Bernoulli beam subjected to a transverse load. The forcing function is sinusoidally distributed in space with an amplitude which also varies sinusoidally in time and is assumed to reach a maximum sufficient to allow nonlinearities associated with finite deformations to become important. During motion, even though displacements are large, the beam is assumed to attain only small strain levels and thus is assumed to be linearly elastic. The results indicate that for most levels of the forcing function the response of the beam is periodic. However, the steady state motion is not sinusoidal in time and in fact exhibits some bifurcated motions. At a certain level of the forcing amplitude, an asymmetry is observed and the periodicity of the motion breaks down as the beam experiences a period doubling cascade which culminates in a chaotic motion. The progression from periodic to chaotic motion is presented through a series of phase plane and Poincané plots, and physical variables such as bending moment are examined.

  • Chaos in a single equilibrium point system: Finite deformations
    Nonlinear Dynamics, 1991
    Co-Authors: E. K. Hall, S. V. Hanagud
    Abstract:

    The purpose of this paper is to examine a highly nonlinear model of a slender beam which yields chaotic solutions for some forcing amplitudes. The study is unique in that the governing partial differential equations are solved directly, and that the model lends itself to a more physical analysis of the beam than traditional chaotic models. In addition, the analysis will provide proof that a beam experiencing moderate deformations without stops or an initial axial force can exhibit chaotic motion. The model represents a simply-supported. Euler-Bernoulli beam subjected to a transverse load. The forcing function is sinusoidally distributed in space with an amplitude which also varies sinusoidally in time and is assumed to reach a maximum sufficient to allow nonlinearities associated with finite deformations to become important. During motion, even though displacements are large, the beam is assumed to attain only small strain levels and thus is assumed to be linearly elastic. The results indicate that for most levels of the forcing function the response of the beam is periodic. However, the steady state motion is not sinusoidal in time and in fact exhibits some bifurcated motions. At a certain level of the forcing amplitude, an asymmetry is observed and the periodicity of the motion breaks down as the beam experiences a period doubling cascade which culminates in a chaotic motion. The progression from periodic to chaotic motion is presented through a series of phase plane and Poincané plots, and physical variables such as bending moment are examined.

Ankur A. Kulkarni - One of the best experts on this subject based on the ideXlab platform.

  • Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
    IEEE Transactions on Information Theory, 2019
    Co-Authors: Sharu Theresa Jose, Ankur A. Kulkarni
    Abstract:

    A new finite blocklength converse for the Slepian–Wolf coding problem, which significantly improves on the best-known converse due to Miyake and Kanaya, is presented. To obtain this converse, an extension of the linear programming (LP)-based framework for finite blocklength point-to-point coding problems is employed. However, a direct application of this framework demands a complicated analysis for the Slepian–Wolf problem. An analytically simpler approach is presented, wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength converses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian–Wolf coding is obtained by an appropriate combination of these converses.

  • Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming
    arXiv: Information Theory, 2018
    Co-Authors: Sharu Theresa Jose, Ankur A. Kulkarni
    Abstract:

    A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength metaconverses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.

  • ITA - Linear Programming Based Finite Blocklength Converses in Information Theory
    2018 Information Theory and Applications Workshop (ITA), 2018
    Co-Authors: Ankur A. Kulkarni, Sharu Theresa Jose
    Abstract:

    A linear programming based framework is presented to derive finite blocklength converses for coding problems in information theory which is also extendable to network settings. In the point-to-point setting, the LP based framework recovers and in fact improves on almost all well-known finite blocklength converses for lossy joint source-channel coding, lossy source coding and channel coding. Moreover, the LP based framework is shown to be asymptotically tight for the averaged and compound channels under the maximum probability of error criterion. Further, for multiterminal Slepian- Wolf source coding problem, a systematic approach to synthesize new converses from considering point-to-point lossless source coding (with side-information at decoder) sub-problems is introduced. The method derives new finite blocklength converse for Slepian- Wolf coding which significantly improves on the converse of Miyake and Kanaya.

Sharu Theresa Jose - One of the best experts on this subject based on the ideXlab platform.

  • Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
    IEEE Transactions on Information Theory, 2019
    Co-Authors: Sharu Theresa Jose, Ankur A. Kulkarni
    Abstract:

    A new finite blocklength converse for the Slepian–Wolf coding problem, which significantly improves on the best-known converse due to Miyake and Kanaya, is presented. To obtain this converse, an extension of the linear programming (LP)-based framework for finite blocklength point-to-point coding problems is employed. However, a direct application of this framework demands a complicated analysis for the Slepian–Wolf problem. An analytically simpler approach is presented, wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength converses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian–Wolf coding is obtained by an appropriate combination of these converses.

  • Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming
    arXiv: Information Theory, 2018
    Co-Authors: Sharu Theresa Jose, Ankur A. Kulkarni
    Abstract:

    A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kanaya [2]. To obtain this converse, an extension of the linear programming (LP) based framework for finite blocklength point- to-point coding problems from [3] is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength metaconverses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.

  • ITA - Linear Programming Based Finite Blocklength Converses in Information Theory
    2018 Information Theory and Applications Workshop (ITA), 2018
    Co-Authors: Ankur A. Kulkarni, Sharu Theresa Jose
    Abstract:

    A linear programming based framework is presented to derive finite blocklength converses for coding problems in information theory which is also extendable to network settings. In the point-to-point setting, the LP based framework recovers and in fact improves on almost all well-known finite blocklength converses for lossy joint source-channel coding, lossy source coding and channel coding. Moreover, the LP based framework is shown to be asymptotically tight for the averaged and compound channels under the maximum probability of error criterion. Further, for multiterminal Slepian- Wolf source coding problem, a systematic approach to synthesize new converses from considering point-to-point lossless source coding (with side-information at decoder) sub-problems is introduced. The method derives new finite blocklength converse for Slepian- Wolf coding which significantly improves on the converse of Miyake and Kanaya.

E. K. Hall - One of the best experts on this subject based on the ideXlab platform.

  • Chaos in a single equilibrium point system: Finite deformations
    Nonlinear Dynamics, 1991
    Co-Authors: E. K. Hall, S. V. Hanagud
    Abstract:

    The purpose of this paper is to examine a highly nonlinear model of a slender beam which yields chaotic solutions for some forcing amplitudes. The study is unique in that the governing partial differential equations are solved directly, and that the model lends itself to a more physical analysis of the beam than traditional chaotic models. In addition, the analysis will provide proof that a beam experiencing moderate deformations without stops or an initial axial force can exhibit chaotic motion. The model represents a simply-supported. Euler-Bernoulli beam subjected to a transverse load. The forcing function is sinusoidally distributed in space with an amplitude which also varies sinusoidally in time and is assumed to reach a maximum sufficient to allow nonlinearities associated with finite deformations to become important. During motion, even though displacements are large, the beam is assumed to attain only small strain levels and thus is assumed to be linearly elastic. The results indicate that for most levels of the forcing function the response of the beam is periodic. However, the steady state motion is not sinusoidal in time and in fact exhibits some bifurcated motions. At a certain level of the forcing amplitude, an asymmetry is observed and the periodicity of the motion breaks down as the beam experiences a period doubling cascade which culminates in a chaotic motion. The progression from periodic to chaotic motion is presented through a series of phase plane and Poincané plots, and physical variables such as bending moment are examined.

  • Chaos in a single equilibrium point system: Finite deformations
    Nonlinear Dynamics, 1991
    Co-Authors: E. K. Hall, S. V. Hanagud
    Abstract:

    The purpose of this paper is to examine a highly nonlinear model of a slender beam which yields chaotic solutions for some forcing amplitudes. The study is unique in that the governing partial differential equations are solved directly, and that the model lends itself to a more physical analysis of the beam than traditional chaotic models. In addition, the analysis will provide proof that a beam experiencing moderate deformations without stops or an initial axial force can exhibit chaotic motion. The model represents a simply-supported. Euler-Bernoulli beam subjected to a transverse load. The forcing function is sinusoidally distributed in space with an amplitude which also varies sinusoidally in time and is assumed to reach a maximum sufficient to allow nonlinearities associated with finite deformations to become important. During motion, even though displacements are large, the beam is assumed to attain only small strain levels and thus is assumed to be linearly elastic. The results indicate that for most levels of the forcing function the response of the beam is periodic. However, the steady state motion is not sinusoidal in time and in fact exhibits some bifurcated motions. At a certain level of the forcing amplitude, an asymmetry is observed and the periodicity of the motion breaks down as the beam experiences a period doubling cascade which culminates in a chaotic motion. The progression from periodic to chaotic motion is presented through a series of phase plane and Poincané plots, and physical variables such as bending moment are examined.

Chibueze Christian Okeke - One of the best experts on this subject based on the ideXlab platform.

  • New Iteration Scheme for Approximating a Common Fixed Point of a Finite Family of Mappings
    Journal of Mathematics, 2020
    Co-Authors: F. O. Isiogugu, Chinedu Izuchukwu, Chibueze Christian Okeke
    Abstract:

    We introduce a new algorithm (horizontal algorithm) in a real Hilbert space, for approximating a common fixed point of a finite family of mappings, without imposing on the finite family of the control sequences , the condition that , for each . Furthermore, under appropriate conditions, the horizontal algorithm converges both weakly and strongly to a common fixed point of a finite family of type-one demicontractive mappings. It is also applied to obtain some new algorithms for approximating a common solution of an equilibrium problem and the fixed point problem for a finite family of mappings. Our work is a contribution to ongoing research on iteration schemes for approximating a common solution of fixed point problems of a finite family of mappings and equilibrium problems.