Related papers: An Inversion Algorithm for Cyclic Nonadiagonal Mat…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
This course, intended for undergraduates familiar with elementary calculus and linear algebra, introduces the extension of differential calculus to functions on more general vector spaces, such as functions that take as input a matrix and…
For standard algorithms verifying positive definiteness of a matrix $A\in\mathbb{M}_n(\mathbb{R})$ based on Sylvester's criterion, the computationally pessimistic case is this when $A$ is positive definite. We present two algorithms…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this work, we consider the algebra $M_{N}(C)$ of $N\times N$ matrices as a cyclic quantum plane. We also analyze the coaction of the quantum group ${\cal F}$ and the action of its dual quantum algebra ${\cal H}$ on it. Then, we study the…
Nonlinear inverse problems have complicated landscapes. Hence the calculation with naive iterative schemes (e.g., Gauss-Newton or conjugate gradients) is trapped in local minima. The (first) Born approximation can avoid this trapping but…
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
The invariants of solvable Lie algebras with nilradicals isomorphic to the algebra of strongly upper triangular matrices and diagonal nilindependent elements are studied exhaustively. Bases of the invariant sets of all such algebras are…
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood,…
An algorithm for sequential calculation of non-isotropic matrix elements of the collision integral which are necessary for the solution of the non-linear Boltzmann equation by moment method is proposed. Isotropic matrix elements that we…
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.
We introduce a novel approach that employs techniques from noncommutative Poisson geometry to comprehend the algebra of invariants of two $n\times n$ matrices. We entirely solve the open problem of computing the algebra of invariants of two…
This paper introduces a method for efficiently approximating the inverse of the Fisher information matrix, a crucial step in achieving effective variational Bayes inference. A notable aspect of our approach is the avoidance of analytically…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
Balancing square and rectangular tables by rotation has been a interesting way to illustrate the intermediate value theorem. The aim of this note is to show that the balancing act but with non-rectangular tables can be a nice application of…
We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…
This paper presents a new algorithm for generating planar circle patterns. The algorithm employs gradient descent and conjugate gradient method to compute circle radii and centers separately. Compared with existing algorithms, the proposed…
We extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate…
In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…