相关论文: Convergence and visualization of Laguerre's rootfi…

Solving inverse problems with iterative algorithms is popular, especially for large data. Due to time constraints, the number of possible iterations is usually limited, potentially affecting the achievable accuracy. Given an error one is…

The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…

Coded polynomial aggregation (CPA) enables the master to directly recover a weighted aggregation of polynomial evaluations without individually decoding each term, thereby reducing the number of required worker responses. In this paper, we…

Global Average Pooling (GAP) [4] has been used previously to generate class activation for image classification tasks. The motivation behind SIMILARnet comes from the fact that the convolutional filters possess position information of the…

In this work, we have considered the Laguerre polynomial. This polynomial has been studied in several branches of theoretical physics and applied Mathematics. J. K. Prajapat at.al derived condition so that Laguerre polynomial satisfy…

We formulate, for continuous-time dynamical systems, a sufficient condition to be a gradient-like system, i.e. that all bounded trajectories approach stationary points and therefore that periodic orbits, chaotic attractors, etc. do not…

In deterministic compressive sensing, one constructs sampling matrices that recover sparse signals from highly incomplete measurements. However, the so-called square-root bottleneck limits the usefulness of such matrices, as they are only…

Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…

The RFMP is an iterative regularization method for a class of linear inverse problems. It has proved to be applicable to problems which occur, for example, in the geosciences. In the early publications [Fischer2011] and [FischerMichel2012],…

In this paper rational solutions of the fifth Painlev\'e equation are discussed. There are two classes of rational solutions of the fifth Painlev\'e equation, one expressed in terms of the generalised Laguerre polynomials, which are the…

Learning-based planners leveraging Graph Neural Networks can learn search guidance applicable to large search spaces, yet their potential to address symmetries remains largely unexplored. In this paper, we introduce a graph representation…

The graph isomorphism problem has a long history in mathematics and computer science, with applications in computational chemistry and biology, and it is believed to be neither solvable in polynomial time nor NP-complete. E. Luks proposed…

There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum of the POP, asymptotically, but prove challenging to solve…

In this paper we introduce a version of irreducible Laguerre polynomials in two variables and prove for it a congruence property, which is similar to the one obtained by Carlitz for the classical Laguerre polynomials in one variable.

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

Lawson's iteration is a classical and effective method for solving the linear (polynomial) minimax approximation problem in the complex plane. Extension of Lawson's iteration for the rational minimax approximation problem with both…

We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial seed set of…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

Stochastic variance-reduced algorithms such as Stochastic Average Gradient (SAG) and SAGA, and their deterministic counterparts like the Incremental Aggregated Gradient (IAG) method, have been extensively studied in large-scale machine…