scholarly journals Fast Calculation Methods for Reliability of Connected-(r,s)-out-of-(m,n):F Lattice System in Special Cases

Author(s):  
Taishin Nakamura ◽  
Hisashi Yamamoto ◽  
Xiao Xiao

A connected-(r,s)-out-of-(m,n):F lattice system consists of components arranged as an (m,n) matrix, and fails if and only if the system has an (r,s) sub-matrix where all components fail. Though the previous study has proposed the recursive equation for computing the system reliability, it takes much time to compute the reliability. For one-dimensional systems, a matrix formula was provided based on the existing recursive equation when the system consists of independent and identically distributed components. The numerical experiments showed that the matrix formula was more efficient than the recursive equation. In contrast, for two-dimensional systems, the recursive equation is comparatively complex, so that it is difficult to drive a matrix formula directly from the recursive equation. In this study, we derive general forms of matrices for computing the reliability of the connected-(r,s)-out-of-(m,n):F lattice system consisting of independent and identically distributed components in the case of and . We compare our proposed method with the recursive equation in order to verify the effectiveness of the proposed method using numerical experiments.

1998 ◽  
Vol 25 (1) ◽  
pp. 81-86 ◽  
Author(s):  
N Hearn ◽  
J Aiello

Experimental work on prismatic concrete specimens was conducted to determine the relationship between mechanical restraint and the rate of corrosion. The current together with the changes in strain of the confining frame were monitored during the accelerated corrosion tests. The effect of mix design and cracking on the corrosion rates was also investigated. The results show that one-dimensional mechanical restraint retards the corrosion process, as indicated by the reduction in the steel loss. Improved quality of the matrix, with and without cracking, reduces the rate of steel loss. In the inferior quality concrete, the effect of cracking on the corrosion rate is minimal.Key words: corrosion, concrete, repair.


2021 ◽  
Vol 71 (2) ◽  
pp. 301-316
Author(s):  
Reshma Sanjhira

Abstract We propose a matrix analogue of a general inverse series relation with an objective to introduce the generalized Humbert matrix polynomial, Wilson matrix polynomial, and the Rach matrix polynomial together with their inverse series representations. The matrix polynomials of Kiney, Pincherle, Gegenbauer, Hahn, Meixner-Pollaczek etc. occur as the special cases. It is also shown that the general inverse matrix pair provides the extension to several inverse pairs due to John Riordan [An Introduction to Combinatorial Identities, Wiley, 1968].


Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1264
Author(s):  
Vladimir V. Uchaikin ◽  
Renat T. Sibatov ◽  
Dmitry N. Bezbatko

One-dimensional random walks with a constant velocity between scattering are considered. The exact solution is expressed in terms of multiple convolutions of path-distributions assumed to be different for positive and negative directions of the walk axis. Several special cases are considered when the convolutions are expressed in explicit form. As a particular case, the solution of A. S. Monin for a symmetric random walk with exponential path distribution and its generalization to the asymmetric case are obtained. Solution of fractional telegraph equation with the fractional material derivative is presented. Asymptotic behavior of its solution for an asymmetric case is provided.


Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 870
Author(s):  
Diego Caratelli ◽  
Paolo Emilio Ricci

We show that using Dunford-Taylor’s integral, a classical tool of functional analysis, it is possible to derive an expression for the inverse of a general non-singular complex-valued tridiagonal matrix. The special cases of Jacobi’s symmetric and Toeplitz (in particular symmetric Toeplitz) matrices are included. The proposed method does not require the knowledge of the matrix eigenvalues and relies only on the relevant invariants which are determined, in a computationally effective way, by means of a dedicated recursive procedure. The considered technique has been validated through several test cases with the aid of the computer algebra program Mathematica©.


2010 ◽  
Vol 47 (03) ◽  
pp. 611-629
Author(s):  
Mark Fackrell ◽  
Qi-Ming He ◽  
Peter Taylor ◽  
Hanqin Zhang

This paper is concerned with properties of the algebraic degree of the Laplace-Stieltjes transform of phase-type (PH) distributions. The main problem of interest is: given a PH generator, how do we find the maximum and the minimum algebraic degrees of all irreducible PH representations with that PH generator? Based on the matrix exponential (ME) order of ME distributions and the spectral polynomial algorithm, a method for computing the algebraic degree of a PH distribution is developed. The maximum algebraic degree is identified explicitly. Using Perron-Frobenius theory of nonnegative matrices, a lower bound and an upper bound on the minimum algebraic degree are found, subject to some conditions. Explicit results are obtained for special cases.


1972 ◽  
Vol 30 (3) ◽  
pp. 743-746 ◽  
Author(s):  
Edward F. Gocka

A matrix formula available for the calculation of complex chi-squares allows several computational variations, each of which requires fewer steps than the standard formula. However, neither the matrix formula nor the associated computational algorithms have been given adequate exposure in statistical texts for the behavioral sciences. This paper reintroduces the formula, expands the notation, and shows how several computational variations can be derived.


2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
G. E. Tupholme

Representations in a closed form are derived, using an extension to the method of dislocation layers, for the phonon and phason stress and electric displacement components in the deformation of one-dimensional piezoelectric quasicrystals by a nonuniformly loaded stack of parallel antiplane shear cracks. Their dependence upon the polar angle in the region close to the tip of a crack is deduced, and the field intensity factors then follow. These exhibit that the phenomenon of crack shielding is dependent upon the relative spacing of the cracks. The analogous analyses, that have not been given previously, involving non-piezoelectric or non-quasicrystalline or simply elastic materials can be straightforwardly considered as special cases. Even when the loading is uniform and the crack is embedded in a purely elastic isotropic solid, no explicit representations have been available before for the components of the field at points other than directly ahead of a crack. Typical numerical results are graphically displayed.


10.37236/734 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Uwe Schauz

The main result of this paper is a coefficient formula that sharpens and generalizes Alon and Tarsi's Combinatorial Nullstellensatz. On its own, it is a result about polynomials, providing some information about the polynomial map $P|_{\mathfrak{X}_1\times\cdots\times\mathfrak{X}_n}$ when only incomplete information about the polynomial $P(X_1,\dots,X_n)$ is given.In a very general working frame, the grid points $x\in \mathfrak{X}_1\times\cdots\times\mathfrak{X}_n$ which do not vanish under an algebraic solution – a certain describing polynomial $P(X_1,\dots,X_n)$ – correspond to the explicit solutions of a problem. As a consequence of the coefficient formula, we prove that the existence of an algebraic solution is equivalent to the existence of a nontrivial solution to a problem. By a problem, we mean everything that "owns" both, a set ${\cal S}$, which may be called the set of solutions; and a subset ${\cal S}_{\rm triv}\subseteq{\cal S}$, the set of trivial solutions.We give several examples of how to find algebraic solutions, and how to apply our coefficient formula. These examples are mainly from graph theory and combinatorial number theory, but we also prove several versions of Chevalley and Warning's Theorem, including a generalization of Olson's Theorem, as examples and useful corollaries.We obtain a permanent formula by applying our coefficient formula to the matrix polynomial, which is a generalization of the graph polynomial. This formula is an integrative generalization and sharpening of:1. Ryser's permanent formula.2. Alon's Permanent Lemma.3. Alon and Tarsi's Theorem about orientations and colorings of graphs.Furthermore, in combination with the Vigneron-Ellingham-Goddyn property of planar $n$-regular graphs, the formula contains as very special cases:4. Scheim's formula for the number of edge $n$-colorings of such graphs.5. Ellingham and Goddyn's partial answer to the list coloring conjecture.


Sign in / Sign up

Export Citation Format

Share Document