The eigenproblem for matrices in max-plus algebra describes the steady state of the system, and therefore it has been intensively studied by many authors. In this paper, we propose an algorithm to compute the eigenvalue and the corresponding eigenvectors of a square matrix in an iterative way. The algorithm is extended to compute the nontrivial eigenvectors for Latin squares in max-plus algebra.

In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the eigenvalue and eigenvectors (trivial and non-trivial) for Latin squares in a bipartite min-max-plus system. We illustrate the algorithm using some examples. The proposed algorithm is implemented in MATLAB, using max-plus algebra toolbox. Computationally speaking, our algorithm has a clear advantage over the power algorithm presented by Subiono and van der Woude. Because our algorithm takes $0.088783$ sec to solve the eigenvalue problem for Latin square presented in Example 2, while the compared one takes $1.718662$ sec for the same problem. Furthermore, a time complexity comparison is presented, which reveals that the proposed algorithm is less time consuming when compared with some of the existing algorithms.

In recent years, there has been a growing interest in the preoperative modeling of fluid-structure interaction in the treatment of cerebral aneurysms. In this study, we investigate two cases involving laminar incompressible fluid flow interacting with hyperelastic materials (a vertical flap and aneurysm walls) under the effect of fluid flow. We present a finite element method (FEM) for these prototypical two-dimensional ($2D$) configurations, taking into account the complex flows and deformation of the variant's structure models. We use an Arbitrary Lagrangian-Eulerian (ALE) formulation in a continuum, fully monolithic coupled way, and discretize the fluid and solid domains using the quadratic LBB stable $P_2P_1$ finite element pair to approximate the displacement, velocity, and pressure spaces independently. The resulting discretized form of the nonlinear algebraic system is linearized using a variant of Newton's procedure, and the Jacobian matrices are approximated via the divided difference method. The resulting linear systems are solved using a direct solver MUMPS. We evaluate hydrodynamic forces such as drag and lift coefficients for nonlinear elastic material models, including Saint-Venant Kirchoff, Neo-Hookean, and Mooney-Rivlin (2 parameters) separately. To gain more physical insight into the problem, we verify the computed results by comparing the velocity, viscosity, and pressure fields. Our aim is to qualitatively analyze the changes in the mechanics of the wall behavior of the elasticity of the flap vs. the complexity of deformation, interface, details for prototypical flow situations, corresponding displacement, and deformation. We also provide a physical interpretation of blood flow magnitude and basic hemodynamic phenomena of wall shear stresses (WSS) in aneurysma and the range of deformation. Overall, this study presents a comprehensive approach to modeling fluid-structure interaction in cerebral aneurysms, which could help in the development of more effective treatment strategies.

A square array whose all rows and columns are different permutations of the same length over the same symbol set is known as a Latin square. A Latin square may or may not be symmetric. For classification and enumeration purposes, symmetric, non-symmetric, conjugate symmetric, and totally symmetric Latin squares play vital roles. This article discusses the Eigenproblem of non-symmetric Latin squares in well known max-plus algebra. By defining a certain vector corresponding to each cycle of a permutation of the Latin square, we characterize and find the Eigenvalue as well as the possible Eigenvectors.

In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the eigenvalue and eigenvectors (trivial and non-trivial) for Latin squares in a bipartite min-max-plus system. We illustrate the algorithm using some examples. Furthermore, we compare the results of our algorithm with some of the existing algorithms which shows that the propose method is more efficient.