Published July 2018 | Version v1
Journal article

Weak and strong orders of linear recurring sequences

  • 1. Kaunas University of Technology, Department of Mathematical Modeling (Lithuania)
  • 2. Kaunas University of Technology, Research Group for Mathematical and Numerical Analysis of Dynamical Systems (Lithuania)
  • 3. Kaunas University of Technology, Department of Applied Mathematics (Lithuania)

Description

The concept of the strong order of linear recurring sequence (LRS) is introduced in this paper. Necessary and sufficient conditions for the existence of the strong LRS order are derived. The strong LRS order is exploited for the formalization of the problem of the extension of a sequence from the available fragment (fragments) of that sequence. The definition of the strong LRS order opens new possibilities for formal sequence analysis whenever the weak LRS order of that sequence exists. Computational experiments with discrete iterative maps are used to illustrate the applicability of the strong LRS order in nonlinear system analysis.

Additional details

Identifiers

Publishing Information

Journal Title
Computational and Applied Mathematics
Journal Volume
37
Journal Issue
3
Journal Page Range
p. 3539-3561
ISSN
0101-8205

INIS

Country of Publication
United States
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
50012483
Subject category
S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
ITERATIVE METHODS; NONLINEAR PROBLEMS; STRUCTURAL CHEMICAL ANALYSIS; SYSTEMS ANALYSIS
Descriptors DEC
CALCULATION METHODS

Optional Information

Copyright
Copyright (c) 2018 SBMAC - Sociedade Brasileira de Matem#Latin Small Letter A With Acute#tica Aplicada e Computacional