Related papers: Convergence and visualization of Laguerre's rootfi…
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…
We propose an accelerated forward-backward method with fast convergence rate for finding a minimizer of a decomposable nonsmooth convex function over a closed convex set, and name it smoothing accelerated proximal gradient (SAPG) algorithm.…
We derive novel conditions that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages. The computational…
We present a proximal augmented Lagrangian based solver for general convex quadratic programs (QPs), relying on semismooth Newton iterations with exact line search to solve the inner subproblems. The exact line search reduces in this case…
We consider the generalised root identities introduced in [1] for simple functions, and also for \Gamma(z+1) and \zeta(s). In this paper, unlike [1], we focus on the case of noninteger \mu. For the simplest function f(z)=z, and hence for…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise…
We present a data-assisted iterative regularization method for solving ill-posed inverse problems. The proposed approach, termed \texttt{IRMGL+\(\Psi\)}, integrates classical iterative techniques with a data-driven regularization term…
The transformation of a Laguerre series $f (z) = \sum_{n=0}^{\infty} \lambda_{n}^{(\alpha)} L_{n}^{(\alpha)} (z)$ to a power series $f (z) = \sum_{n=0}^{\infty} \gamma_{n} z^{n}$ is discussed. Many nonanalytic functions can be expanded in…
Local Fourier analysis (LFA) is a useful tool in predicting the convergence factors of geometric multigrid methods (GMG). As is well known, on rectangular domains with periodic boundary conditions this analysis gives the exact convergence…
This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda)=\sum_{k=0}^n (-1)^{k}c_{k}(G)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c}, M. Ili\'{c},…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Graph coarsening aims to diminish the size of a graph to lighten its memory footprint, and has numerous applications in graph signal processing and machine learning. It is usually defined using a reduction matrix and a lifting matrix,…
A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the…
We discuss numerical solution of Altarelli-Parisi equations in a Laguerre-polynomial method and in a brute-force method. In the Laguerre method, we get good accuracy by taking about twenty Laguerre polynomials in the flavor-nonsinglet case.…
In the framework of inverse linear problems on infinite-dimensional Hilbert space, we prove the convergence of the conjugate gradient iterates to an exact solution to the inverse problem in the most general case where the self-adjoint,…
We define the family of truncated Laguerre polynomials $P_n(x;z)$, orthogonal with respect to the linear functional $\ell$ defined by $$\langle{\ell,p\rangle}=\int_{0}^zp(x)x^\alpha e^{-x}dx,\qquad\alpha>-1.$$ The connection between…