Related papers: A Solution of Simultaneous Recurrences
In this paper, we study renormalization, that is, the procedure for eliminating singularities, for a special model using both combinatorial techniques in the framework of working with formal series, and using a limit transition in a…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
Multivariate process satisfying affine stochastic recurrence equation with generic diagonal matrices is considered. We prove that the stationary solution is regularly varying. The results are applicable to diagonal autoregressive models.
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
This paper proposes an algorithm for computing regularized solutions to linear rational expectations models. The algorithm allows for regularization cross-sectionally as well as across frequencies. A variety of numerical examples illustrate…
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…
With the regular decomposition technique, we decompose the space $\mathbf{H}_0^s(\mathbf{curl}; \Omega)$ into the sum of a vector potential space and the gradient of a scalar space, both possessing higher regularity. Based on this new high…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums…
The approach to the constructing explicit solutions of the recurrence relations for multi-loop integrals are suggested. The resulting formulas demonstrate a high efficiency, at least for 3-loop vacuum integrals case. They also produce a new…
In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent of matrix…
In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…
A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…