Related papers: On efficient approximation of quadratic irrational…

We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials…

We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…

We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (\epsilon \leq |z| \leq1). We explain how rational approximations can be applied to large sparse…

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set…

An expansion procedure using third kind Chebyshev polynomials as base functions is suggested for solving second type Volterra integral equations with logarithmic kernels. The algorithm's convergence is studied and some illustrative examples…

In this paper we study decomposition methods based on separable approximations for minimizing the augmented Lagrangian. In particular, we study and compare the Diagonal Quadratic Approximation Method (DQAM) of Mulvey and Ruszczy\'{n}ski and…

We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…

We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on…

We revisit and adapt the extended sequential quadratic method (ESQM) in [3] for solving a class of difference-of-convex optimization problems whose constraints are defined as the intersection of level sets of Lipschitz differentiable…

A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

Let K be a number field, and L be a finite normal extension of K with Galois group G. It is known that the number of Frobenius automorphisms corresponding to prime ideals, whose norms are less than x, is equivalent to the logarithmic…

We discuss certain special cases of algebraic approximants that are given as zeroes of so-called "effective characteristic polynomials" and their generalization to a multiseries setting. These approximants are useful for the convergence…

We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential…

In a recent paper by Ibragimov [N. H. Ibragimov, Invariant Lagrangians and a new method of integration of nonlinear equations, J. Math. Anal. Appl. 304 (2005) 212--235] a method was presented in order to find Lagrangians of certain…

In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…

This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…

In this paper, we propose a federated algorithm for solving large linear systems that is inspired by the classic randomized Kaczmarz algorithm. We provide convergence guarantees of the proposed method, and as a corollary of our analysis, we…

We present a practical and effective method for rigorously estimating quantities associated to top eigenvalues of transfer operators to very high precision. The method combines explicit error bounds of the Lagrange-Chebyshev approximation…

We present a scheme for finding all roots of an analytic function in a square domain in the complex plane. The scheme can be viewed as a generalization of the classical approach to finding roots of a function on the real line, by first…