Related papers: V-cycle optimal convergence for DCT-III matrices
The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…
The graph alignment problem, which considers the optimal node correspondence across networks, has recently gained significant attention due to its wide applications. There are graph alignment methods suited for various network types, but we…
The discontinuous Petrov-Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan [15,17] guarantees the optimality of the solution in an energy norm, and provides several features facilitating adaptive schemes. A key question that has…
This paper improves the convergence and robustness of a multigrid-based solver for the cross sections of the driven Schroedinger equation. Adding an Coupled Channel Correction Step (CCCS) after each multigrid (MG) V-cycle efficiently…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
We study the convergence of the last iterate in subgradient methods applied to the minimization of a nonsmooth convex function with bounded subgradients. We first introduce a proof technique that generalizes the standard analysis of…
This paper proposes a generalization of the conjugate gradient (CG) method used to solve the equation $Ax=b$ for a symmetric positive definite matrix $A$ of large size $n$. The generalization consists of permitting the scalar control…
We introduce a geometric multigrid method for solving linear systems arising from variational problems on surfaces in geometry processing, Gravo MG. Our scheme uses point clouds as a reduced representation of the levels of the multigrid…
Solving structured systems of linear equations in a non-centralized fashion is an important step in many distributed optimization and control algorithms. Fast convergence is required in manifold applications. Known decentralized algorithms,…
We solve the Symmetrized Principal Minor Assignment Problem, that is we show how to determine if for a given vector $v\in \mathbb{C}^{n}$ there is an $n\times n$ matrix that has all $i\times i$ principal minors equal to $v_{i}$. We use a…
In this mostly expository note we give a down-to-earth introduction to the V-filtration of M. Kashiwara and B. Malgrange on D-modules. We survey some applications to generalized Bernstein-Sato polynomials, multiplier ideals, and monodromy…
Distributed algorithms to solve linear equations in multi-agent networks have attracted great research attention and many iteration-based distributed algorithms have been developed. The convergence speed is a key factor to be considered for…
The least square solution of minimum norm of a rectangular linear system of equations can be found out iteratively by using matrix splittings. However, the convergence of such an iteration scheme arising out of a matrix splitting is…
We consider families of planar polynomial vector fields of degree $n$ and study the cyclicity of a type of unbounded polycycle~$\Gamma$ called hemicycle. Compactified to the Poincar\'e disc,~$\Gamma$ consists of an affine straight line…
Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…
This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(\mathbf{curl})$ in three dimensions. The multigrid methods are designed for discrete problems originated from the…
The main objective of this paper is to give a rigorous treatment of Wigner's and Eisenbud's $R$-matrix method for scattering matrices of scattering systems consisting of two selfadjoint extensions of the same symmetric operator with finite…
In this paper we prove that any distance-balanced graph $G$ with $\Delta(G)\geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $\Delta(T)\geq…