Related papers: An Algebraic Approach to Non-Orthogonal General Jo…

General Schr\"{o}dinger equation is considered with a central polynomial potential depending on $2q$ arbitrary coupling constants. Its exceptional solutions of the so called Magyari type (i.e., exact bound states proportional to a…

For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the…

The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…

For a symmetric positive semidefinite linear system of equations $\mathcal{Q} {\bf x} = {\bf b}$, where ${\bf x} = (x_1,\ldots,x_s)$ is partitioned into $s$ blocks, with $s \geq 2$, we show that each cycle of the classical block symmetric…

Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…

Various numerical linear algebra problems can be formulated as evaluating bivariate function of matrices. The most notable examples are the Fr\'echet derivative along a direction, the evaluation of (univariate) functions of…

The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…

A new (algebraic) approximation scheme to find {\sl global} solutions of two point boundary value problems of ordinary differential equations (ODE's) is presented. The method is applicable for both linear and nonlinear (coupled) ODE's whose…

We tackle highly nonconvex, nonsmooth composite optimization problems whose objectives comprise a Moreau-Yosida regularized term. Classical nonconvex proximal splitting algorithms, such as nonconvex ADMM, suffer from lack of convergence for…

We consider the iterative solution of generalized saddle point systems. When the right bottom block is zero, Arioli [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 571--592] proposed a CRAIG algorithm based on generalized Golub-Kahan…

A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…

In this paper, we propose two regularized proximal quasi-Newton methods with symmetric rank-1 update of the metric (SR1 quasi-Newton) to solve non-smooth convex additive composite problems. Both algorithms avoid using line search or other…

We prove that for any connected open set $\Omega\subset \R^n$ and for any set of matrices $K=\{A_1,A_2,A_3\}\subset M^{m\times n}$, with $m\ge n$ and rank$(A_i-A_j)=n$ for $i\neq j$, there is no non-constant solution $B\in…

Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a gradient step updates all coordinates…

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \in \mathbb{R}^n$. This is equivalent to…

Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to…

A new convenient method to diagonalize the non-relativistic many-body Schroedinger equation with two-body central potentials is derived. It combines kinematic rotations (democracy transformations) and exact calculation of overlap integrals…

We study Kaczmarz type methods to solve consistent linear matrix equations. We first present a block Kaczmarz (BK) method that employs a deterministic cyclic row selection strategy. Assuming that the associated coefficient matrix has full…

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…