Related papers: $\lambda$-symmetries and Jacobi Last Multiplier
By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…
In this article we provide examples, methods and algorithms to determine conditions on the parameters of certain type of parametric optimization problems, such that among the resulting local minima and maxima there is at least one which…
We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…
In this paper, we analyze the convergence rate of the Jacobi-Proximal Alternating Direction Method of Multipliers (ADMM) initially introduced by Deng et al. for the block-structured optimization problem with linear constraint. The algorithm…
Let $\Lambda$ and $\Gamma$ be symmetrically separably equivalent Artin algebras. We prove that there exist symmetrical separable equivalences between certain endomorphism algebras of modules. As applications, we provide several methods to…
We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…
This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix. For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the…
In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also…
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…
An algorithmic method to exploit a general class of infinitesimal symmetries for reducing stochastic differential equations is presented and a natural definition of reconstruction, inspired by the classical reconstruction by quadratures, is…
The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools…
This is an ultimate completion of our earlier paper [Acta.\ Math.\ Hungar.\ 140 (2013), 248--292] where mapping properties of several fundamental harmonic analysis operators in the setting of symmetrized Jacobi trigonometric expansions were…
This paper deals with a hybrid joint diagonalization (JD) problem considering both Hermitian and transpose congruences. Such problem can be encountered in certain non-circular signal analysis applications including blind source separation.…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
We study a finite-dimensional algebra $\Lambda$ constructed from a Postnikov diagram $D$ in a disk, obtained from the dimer algebra of Baur-King-Marsh by factoring out the ideal generated by the boundary idempotent. Thus $\Lambda$ is…
We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…
After a brief survey of the definition and the properties of Lambda-symmetries in the general context of dynamical systems, the notion of "Lambda-constant of motion'' for Hamiltonian equations is introduced. If the Hamiltonian problem is…
Jacobi-type algorithms for simultaneous approximate diagonalization of real (or complex) symmetric tensors have been widely used in independent component analysis (ICA) because of their good performance. One natural way of choosing the…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…