A matrix equation approach to solving recurrence relations in two-dimensional random walks

1994 ◽  
Vol 31 (03) ◽  
pp. 646-659 ◽  
Author(s):  
James W. Miller

The purpose of this paper is to provide explicit formulas for a variety of probabilistic quantities associated with an asymmetric random walk on a finite rectangular lattice with absorbing barriers. Quantities of interest include probabilities that a walker will exit the lattice onto some particular set of boundary states, the expected duration of the walk, and the expected number of visits to one state given a start in another. These quantities are shown to satisfy two-dimensional recurrence relations that are very similar in structure. In each case, the recurrence relations may be represented by matrix equations of the form X = AX + XB + C, where A and B are tridiagonal Toeplitz matrices. The spectral properties of A and B are investigated and used to provide solutions to this matrix equation. The solutions to the matrix equations then lead to solutions for the recurrence relations in very general cases.

1994 ◽  
Vol 31 (3) ◽  
pp. 646-659 ◽  
Author(s):  
James W. Miller

The purpose of this paper is to provide explicit formulas for a variety of probabilistic quantities associated with anasymmetric random walk on a finite rectangular lattice with absorbing barriers.Quantities of interest include probabilities that a walker will exit the lattice onto some particular set of boundary states, the expected duration of the walk, and the expected number of visits to one state given a start in another. These quantities are shown to satisfy two-dimensional recurrence relations that are very similar in structure. In each case, the recurrence relations may be represented by matrix equations of the formX=AX+XB+C, whereAandBare tridiagonal Toeplitz matrices. The spectral properties ofAandBare investigated and used to provide solutions to this matrix equation. The solutions to the matrix equations then lead to solutions for the recurrence relations in very general cases.


2008 ◽  
Vol 18 (08) ◽  
pp. 1231-1241 ◽  
Author(s):  
PAUL BELL ◽  
VESA HALAVA ◽  
TERO HARJU ◽  
JUHANI KARHUMÄKI ◽  
IGOR POTAPOV

We show a reduction of Hilbert's tenth problem to the solvability of the matrix equation [Formula: see text] over non-commuting integral matrices, where Z is the zero matrix, thus proving that the solvability of the equation is undecidable. This is in contrast to the case whereby the matrix semigroup is commutative in which the solvability of the same equation was shown to be decidable in general. The restricted problem where k = 2 for commutative matrices is known as the "A-B-C Problem" and we show that this problem is decidable even for a pair of non-commutative matrices over an algebraic number field.


2020 ◽  
Vol 12 (2) ◽  
pp. 368-375
Author(s):  
N.B. Ladzoryshyn ◽  
V.M. Petrychkovych ◽  
H.V. Zelisko

The method for solving the matrix Diophantine equations over quadratic rings is developed. On the basic of the standard form of matrices over quadratic rings with respect to $(z,k)$-equivalence previously established by the authors, the matrix Diophantine equation is reduced to equivalent matrix equation of same type with triangle coefficients. Solving this matrix equation is reduced to solving a system of linear equations that contains linear Diophantine equations with two variables, their solution methods are well-known. The structure of solutions of matrix equations is also investigated. In particular, solutions with bounded Euclidean norms are established. It is shown that there exists a finite number of such solutions of matrix equations over Euclidean imaginary quadratic rings. An effective method of constructing of such solutions is suggested.


2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Ning Li ◽  
Qing-Wen Wang

The matrix equation∑l=1uAlXBl+∑s=1vCsXTDs=F,which includes some frequently investigated matrix equations as its special cases, plays important roles in the system theory. In this paper, we propose an iterative algorithm for solving the quaternion matrix equation∑l=1uAlXBl+∑s=1vCsXTDs=Fover generalized(P,Q)-reflexive matrices. The proposed iterative algorithm automatically determines the solvability of the quaternion matrix equation over generalized(P,Q)-reflexive matrices. When the matrix equation is consistent over generalized(P,Q)-reflexive matrices, the sequence{X(k)}generated by the introduced algorithm converges to a generalized(P,Q)-reflexive solution of the quaternion matrix equation. And the sequence{X(k)}converges to the least Frobenius norm generalized(P,Q)-reflexive solution of the quaternion matrix equation when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate generalized(P,Q)-reflexive solution for a given generalized(P,Q)-reflexive matrixX0can be derived. The numerical results indicate that the iterative algorithm is quite efficient.


Author(s):  
N.E. Zubov ◽  
V.N. Ryabchenko

New formulas were obtained to solve the linear non-degenerate matrix equations based on zero divisors of numerical matrices. Two theorems were formulated, and a proof to one of them is provided. It is noted that the proof of the second theorem is similar to the proof of the first one. The proved theorem substantiates new formula in solving the equation equivalent in the sense of the solution uniqueness to the known formulas. Its fundamental difference lies in the following: any explicit matrix inversion or determinant calculation is missing; solution is "based" not on the left, but on the right side of the matrix equation; zero divisor method is used (it was never used in classical formulas for solving a matrix equation); zero divisor calculation is reduced to simple operations of permutating the vector elements on the right-hand side of the matrix equation. Examples are provided of applying the proposed method for solving a nondegenerate matrix equation to the numerical matrix equations. High accuracy of the proposed formulas for solving the matrix equations is demonstrated in comparison with standard solvers used in the MATLAB environment. Similar problems arise in the synthesis of fast and ultrafast iterative solvers of linear matrix equations, as well as in nonparametric identification of abnormal (emergency) modes in complex technical systems, for example, in the power systems


Author(s):  
Leiba Rodman

This chapter presents applications to polynomial matrix equations, algebraic Riccati equations, and linear quadratic regulators. Without attempting to develop in-depth exposition of the topics, this chapter details these applications in basic forms. Here, maximal invariant semidefinite or neutral subspaces will play a key role. The chapter first considers polynomial equations, with the matrix equation Zⁿ + A n−1 Z n−1 + ... + A₁Z + A₀ = 0. It then studies quadratic matrix equations of the form ZBZ + ZA − DZ − C = 0. Finally, this chapter specializes the latter equation by introducing certain symmetries and changing the notation somewhat, until it takes on the form ZDZ + ZA + A*Z − C = 0.


2019 ◽  
Vol 11 (1) ◽  
pp. 267-276
Author(s):  
Michał Wiśniewski

Abstract The article presents the problem of a decision-making process based on the method known as the analysis of interconnected decision areas (AIDA). Author described the basic assumptions of the AIDA method and the classic method of its implementation with the usage of a decision tree. Crucially, the new and innovative improvement in development of the AIDA method is connected with the replacement of the decision tree by the matrix equation to speed up the cost assessment of decision variants.


2021 ◽  
Author(s):  
Assaf Shmerling

Abstract In control engineering and structural dynamics, mathematical models such as the state-space representation, equation-of-motion, and the phase plane are matrix equations describing the system equilibrium. This paper develops novel matrix equations models for linear/nonlinear dynamic analysis of reinforced concrete (RC) buildings with cantilever elements lateral load resisting system (e.g., RC shear wall, RC core). The matrix equations models offer a reliable and idealized tool for introducing two-dimensional and three-dimensional cantilever structures to control engineering and structural dynamics' equation-of-motion. The displacement-related stiffness matrix of cantilever elements is determined using the Left Riemann Sums (LRS) numerical integration method that yields transformation matrices that cater to the element's boundary conditions. The three-dimensional structure's mass and stiffness matrices are determined using the Direct Stiffness Method (DSM) and local-to-global-coordinates transformation matrices. The nonlinear matrix structural analysis employs a smooth hysteretic model for deteriorating inelastic structures, referring to the relation between the bending moment and the bending-curvature through the bending-stiffness. The parameters controlling the cyclic behavior regard a composite RC cross-section subject to gravitational load and bending simultaneously. The paper includes four examples that exemplify the practical utilization of the matrix equations models in analyzing two-dimensional and three-dimensional structures of linearly-elastic and inelastic properties. The four examples demonstrated the idealized applicability of the matrix equations models that suit state-space, equation-of-motion, and phase plane analyses.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Hai-Fei Zhu ◽  
Xiao-Wei Sun ◽  
Ting Song ◽  
Xiao-Dong Wen ◽  
Xi-Xuan Liu ◽  
...  

AbstractIn view of the influence of variability of low-frequency noise frequency on noise prevention in real life, we present a novel two-dimensional tunable phononic crystal plate which is consisted of lead columns deposited in a silicone rubber plate with periodic holes and calculate its bandgap characteristics by finite element method. The low-frequency bandgap mechanism of the designed model is discussed simultaneously. Accordingly, the influence of geometric parameters of the phononic crystal plate on the bandgap characteristics is analyzed and the bandgap adjustability under prestretch strain is further studied. Results show that the new designed phononic crystal plate has lower bandgap starting frequency and wider bandwidth than the traditional single-sided structure, which is due to the coupling between the resonance mode of the scatterer and the long traveling wave in the matrix with the introduction of periodic holes. Applying prestretch strain to the matrix can realize active realtime control of low-frequency bandgap under slight deformation and broaden the low-frequency bandgap, which can be explained as the multiple bands tend to be flattened due to the localization degree of unit cell vibration increases with the rise of prestrain. The presented structure improves the realtime adjustability of sound isolation and vibration reduction frequency for phononic crystal in complex acoustic vibration environments.


Sign in / Sign up

Export Citation Format

Share Document