Related papers: Universal algorithms for generalized discrete matr…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Several local elliptic coordinates are used to build a new polyelliptic coordinate system which is orthogonal and admits the separation of variables. Such coordinate systems can give the exact solutions of some unsolved problems in quantum…
In this paper, we introduce and analyze a normalization method for solving a system of linear equations over tropical semirings. We use a normalization method to construct an associated normalized matrix, which gives a technique for solving…
We obtain several generalizations the Hellinger theorem about $l^2$ solutions of difference equations: instead of second order equations and $ l^2$-solutions, we consider second-order equations with matrix coefficients and their solutions…
Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…
In this paper, the generalized finite element method (GFEM) for solving second order elliptic equations with rough coefficients is studied. New optimal local approximation spaces for GFEMs based on local eigenvalue problems involving a…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
When approximating elliptic problems by using specialized approximation techniques, we obtain large structured matrices whose analysis provides information on the stability of the method. Here we provide spectral and norm estimates for…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
In the past decades, multigrid methods for linear systems having multilevel Toeplitz coefficient matrices with scalar entries have been largely studied. On the other hand, only few papers have investigated the case of block entries, where…
In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman-Morrison-Woodbury formula. The implementation of the algorithm…
The Neumann--Neumann method is a commonly employed domain decomposition method for linear elliptic equations. However, the method exhibits slow convergence when applied to semilinear equations and does not seem to converge at all for…
In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…
In this paper we propose an idea of constructing a macro--scale matrix system given a micro--scale matrix linear system. Then the macro--scale system is solved at cheaper computing costs. The method uses the idea of the generalized…
In this paper, we argue for the utility of deterministic inference in the classical problem of numerical linear algebra, that of solving a linear system. We show how the Gaussian belief propagation solver, known to work for symmetric…
The motivation of this work is to illustrate the efficiency of some often overlooked alternatives to deal with optimization problems in systems and control. In particular, we will consider a problem for which an iterative linear matrix…
We consider solutions of the $2\times 2$ matrix Hamiltonian of physical systems within the context of the asymptotic iteration method. Our technique is based on transformation of the associated Hamiltonian in the form of the first order…
Toeplitz matrices are ubiquitous and play important roles across many areas of mathematics. In this paper, we present some algebraic results concerning block Toeplitz matrices with block entries belonging to a commutative algebra $\AA$. The…
In the present paper, an algorithm for the numerical solution of the external Dirichlet generalized harmonic problem for a sphere by the method of probabilistic solution (MPS) is given, where generalized indicates that a boundary function…