相关论文: Convergence Analysis of Optimal SOR for a Class of…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…
The method of second order relative spectra has been shown to reliably approximate the discrete spectrum for a self-adjoint operator. We extend the method to normal operators and find optimal convergence rates for eigenvalues and…
The local convergence of alternating optimization methods with overrelaxation for low-rank matrix and tensor problems is established. The analysis is based on the linearization of the method which takes the form of an SOR iteration for a…
The paper analyzes special cyclic Jacobi methods for symmetric matrices of order $4$. Only those cyclic pivot strategies that enable full parallelization of the method are considered. These strategies, unlike the serial pivot strategies,…
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…
We propose accelerated versions of the operator Sinkhorn iteration for operator scaling using successive overrelaxation. We analyze the local convergence rates of these accelerated methods via linearization, which allows us to determine the…
In this work the spectral theory of self-adjoint operator $A$ represented by Jacobi matrix is considered. The approach is based on the continued fraction representation of the resolvent matrix element of $A$. Different criteria of absolute…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
We prove precise rates of convergence for monotone approximation schemes of fractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider diffusion corrected difference-quadrature schemes from the literature and new…
Spectral differentiations are basic ingredients of spectral methods. In this work, we analyze the pointwise rate of convergence of spectral differentiations for functions containing singularities and show that the deteriorations of the…
For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations ($Au=b$) associated with elliptic problems. It inherits its robustness and accelerates its…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete laplacian is under consideration. The rate of stabilization for the the matrix entries which provides finiteness of the discrete spectrum and is…
For a two-parameter family of Jacobi matrices exhibiting first-order spectral phase transitions, we prove discreteness of the spectrum in the positive real axis when the parameters are in one of the transition boundaries. To this end we…
The Successive Over-Relaxation (SOR) method is a useful method for solving the sparse system of linear equations which arises from finite-difference discretization of the Poisson equation. Knowing the optimal value of the relaxation…
We analyze several versions of Jacobi's method for the symmetric eigenvalue problem. Our goal is to reduce the asymptotic cost of the algorithm as much as possible, as measured by the number of arithmetic operations performed and associated…
The paper studies the global convergence of the Jacobi method for symmetric matrices of size $4$. We prove global convergence for all $720$ cyclic pivot strategies. Precisely, we show that inequality $S(A^{[t+3]})\leq\gamma S(A^{[t]})$,…
Solving symmetric positive semidefinite linear systems is an essential task in many scientific computing problems. While Jacobi-type methods, including the classical Jacobi method and the weighted Jacobi method, exhibit simplicity in their…