Related papers: A New Algorithm for General Cyclic Heptadiagonal L…
New solution method for the systems of linear equations in commutative integral domains is proposed. Its complexity is the same that the complexity of the matrix multiplication.
We consider the identification of spatially distributed parameters under $H^1$ regularization. Solving the associated minimization problem by Gauss-Newton iteration results in linearized problems to be solved in each step that can be cast…
An iterative scheme for the Dynamical Systems Method (DSM) is given such that one does not have to solve the Cauchy problem occuring in the application of the DSM for solving ill-conditioned linear algebraic systems. The novelty of the…
We present algorithms used in the computational part of the article "Special homogeneous linear systems on Hirzebruch surfaces".
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of…
In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. The algorithm uses a variable stepsize which is updated at each iteration and based on some previous…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
In this paper we presents an algorithm for finding a solution of the linear nonhomogeneous quaternionic-valued differential equations. Moveover, several examples shows the feasibility of our algorithm.
A new polynomial preconditioner for symmetric complex linear systems based on Hermitian and skew-Hermitian splitting (HSS) for complex symmetric linear systems is herein presented. It applies to Conjugate Orthogonal Conjugate Gradient…
A method for solving cyclic block three-diagonal systems of equations is generalized for solving a block cyclic penta-diagonal system of equations. Introducing a special form of two new variables the original system is split into three…
This article investigates a fast and stable method to solve Henderson's mixed model equation. The proposed algorithm is stable in that it avoids inverting a matrix of a large dimension and hence is free from the curse of dimensionality.…
This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
We propose a new deterministic Kaczmarz algorithm for solving consistent linear systems $A\mathbf{x}=\mathbf{b}$. Basically, the algorithm replaces orthogonal projections with reflections in the original scheme of Stefan Kaczmarz. Building…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…
Cyclic reduction is a method for the solution of (block-)tridiagonal linear systems. In this note we review the method tailored to hermitian positive definite banded linear systems. The reviewed method has the following advantages: It is…
This work presents a fast direct solver strategy for electromagnetic integral equations in the high-frequency regime. The new scheme relies on a suitably preconditioned combined field formulation and results in a single skeleton form plus…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We propose a high precision algorithm for solving the Gelfand-Levitan-Marchenko equation. The algorithm is based on the block version of the Toeplitz Inner-Bordering algorithm of Levinson's type. To approximate integrals, we use the…