Related papers: Novel Modifications of Parallel Jacobi Algorithms
We introduce a simple autoencoder based on hyperbolic geometry for solving standard collaborative filtering problem. In contrast to many modern deep learning techniques, we build our solution using only a single hidden layer. Remarkably,…
In this paper we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type $M(\lambda)v=0$, where $M:\mathbb{C}\rightarrow\mathbb{C}^{n\times n}$ is a holomorphic function. We investigate which types of approximations…
In this paper, we present a generalized Cuppen's divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. We extend the Cuppen's work to the rank two modifications of the form $A =T +\beta_1\bw_1\bw_1^T +…
We generalize and analyse the method for computing lower bounds of the principal eigenvalue proposed in our previous paper (I. Sebestova, T. Vejchodsky, SIAM J. Numer. Anal. 2014). This method is suitable for symmetric elliptic eigenvalue…
By using a real matrix translation, we propose a coupled eigenvalue problem for octonionic operators. In view of possible applications in quantum mechanics, we also discuss the hermiticity of such operators. Previous difficulties in…
Discrete normalizing flows are promising generative models with advantages such as analytical log-likelihood computation and end-to-end training. However, the architectural constraints to ensure invertibility and tractable Jacobian…
In this paper, the versions of trigonometric functions of certain known inequalities for hyperbolic ones are proved, and then corresponding inequalities for means are presented.
We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
We compute the asymptotics of eigenvalues of Jacobi matrices with the zero coefficients on the main diagonal and the off-diagonal coefficients which converge to zero.
An integro-differential equation of hyperbolic type, with mixed boundary conditions, is considered. A continuous space-time finite element method of degree one is formulated. A posteriori error representations based on space-time cells is…
For pricing American options, %after suitable discretization in space and time, a sequence of discrete linear complementarity problems (LCPs) or equivalently Hamilton-Jacobi-Bellman (HJB) equations need to be solved in a sequential…
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size $n$. Our algorithm improves the best approximation factor of the existing parallel…
For a long time it has been a challenging goal to identify all orthogonal polynomial systems that occur as eigenfunctions of a linear differential equation. One of the widest classes of such eigenfunctions known so far, is given by…
We show how the basic idea of parabolic Jacobi relaxation can be modified to obtain a new class of hyperbolic relaxation schemes that are suitable for the solution of elliptic equations. Some of the analytic and numerical properties of…
The ParaDiag family of algorithms solves differential equations by using preconditioners that can be inverted in parallel through diagonalization. In the context of optimal control of linear parabolic PDEs, the state-of-the-art ParaDiag…
We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear…
In view of the existing limitations of sequential computing, parallelization has emerged as an alternative in order to improve the speedup of numerical simulations. In the framework of evolutionary problems, space-time parallel methods…
Stencil computations consume a major part of runtime in many scientific simulation codes. As prototypes for this class of algorithms we consider the iterative Jacobi and Gauss-Seidel smoothers and aim at highly efficient parallel…
A selfadjoined block tridiagonal matrix with positive definite blocks on the off-diagonals is by definition a Jacobi matrix with matrix entries. Transfer matrix techniques are extended in order to develop a rotation number calculation for…