Related papers: Real dqds for the nonsymmetric tridiagonal eigenva…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
A two dimensional eigenvalue problem (2DEVP) of a Hermitian matrix pair $(A, C)$ is introduced in this paper. The 2DEVP can be viewed as a linear algebraic formulation of the well-known eigenvalue optimization problem of the parameter…
This paper considers an optimization problem that components of the objective function are available at different nodes of a network and nodes are allowed to only exchange information with their neighbors. The decentralized alternating…
Multi-shift triangular solves are basic linear algebra calculations with applications in eigenvector and pseudospectra computation. We propose blocked algorithms that efficiently exploit Level 3 BLAS to perform multi-shift triangular solves…
We are interested in solving the Asymmetric Eigenvalue Complementarity Problem (AEiCP) by accelerated Difference-of-Convex (DC) algorithms. Two novel hybrid accelerated DCA: the Hybrid DCA with Line search and Inertial force (HDCA-LI) and…
We prove that 3-query linear locally correctable codes over the Reals of dimension $d$ require block length $n>d^{2+\lambda}$ for some fixed, positive $\lambda >0$. Geometrically, this means that if $n$ vectors in $R^d$ are such that each…
The Dirichlet eigenvalues of the Laplacian on a triangle that collapses into a line segment diverge to infinity. In this paper, to track the behavior of the eigenvalues during the collapsing process of a triangle, we establish a…
In this paper, we introduce a novel parallel contact algorithm designed to run efficiently in High-Performance Computing based supercomputers. Particular emphasis is put on its computational implementation in a multiphysics finite element…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
We study the problem of computing the Fr\'echet distance between two polygonal curves under transformations. First, we consider translations in the Euclidean plane. Given two curves $\pi$ and $\sigma$ of total complexity $n$ and a threshold…
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a randomized algorithm in $O(n^{\omega}\log^2(n/\epsilon))$…
Nowadays computational complexity of fast walsh hadamard transform and nonlinearity for Boolean functions and large substitution boxes is a major challenge of modern cryptography research on strengthening encryption schemes against linear…
This paper developed a method called "modified exponential cubic B-Spline differential quadrature (mExp-DQM) for space discretization together with a time integration algorithm" for the numerical computation of hyperbolic telegraph equation…
We study a dynamic version of the implicit trace estimation problem. Given access to an oracle for computing matrix-vector multiplications with a dynamically changing matrix A, our goal is to maintain an accurate approximation to A's trace…
In in this paper we show how using D.A. it is found a simple change of variables (c.v.) that brings us to obtain differential equations simpler than the original one. In a pedagogical way (at least we try to do that) and in order to make…
In the current paper the authors linked two methods in order to evaluate general n-th order tridiagonal determinants. A breakdown free numerical algorithm is developed for computing the inverse of any nxn general nonsingular tridiagonal…
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial query algorithms exist are symmetric in nature. The most well known techniques in this domain exploit parity decision trees, in which the parity of two…