Abstract The objective of this research is to study numerical integral equation method (NIE) using five quadrature rules namely, composite midpoint rule, trapezoidal Simpson’s Boole’s rule and Gauss-Legendre for approximating the average run length on extended exponentially weighted moving (extended EWMA) control chart autoregressive process with explanatory variables when white noise follows a...

Abstract In this article, quadrature rules for the efficient computation of stiffness matrix fractional Laplacian in three dimensions are presented. These based on Duffy transformation, which is a common tool singularity removal. Here, transformation adapted to needs dimensions. The integrals resulting from regular over less-dimensional domains. We present bounds number Gauss points guarantee e...

Given a positive bounded Borel measure μ on the interval [−1, 1], we provide convergence results in Lμ2 -norm to a function f of its sequence of rational interpolating functions at the nodes of rational Gauss-type quadrature formulas associated with the measure μ. As an application, we construct rational interpolatory quadrature formulas for complex bounded measures σ on the interval, and give ...

In this paper, we analyze the behavior of the well-known alternating direction method of multipliers (ADMM), for solving a family of nonconvex problems. Our focus is given to the well-known consensus and sharing problems, both of which have wide applications in machine learning. We show that in the presence of nonconvex objective, the classical ADMM is able to reach the set of stationary soluti...

Abstract. The discrete Fourier analysis on the 300–600–900 triangle is deduced from the corresponding results on the regular hexagon by considering functions invariant under the group G2, which leads to the definition of four families generalized Chebyshev polynomials. The study of these polynomials leads to a Sturm–Liouville eigenvalue problem that contains two parameters, whose solutions are ...

The temporal dynamics and generative functions between layers of the hierarchy are implemented as neural networks with non-linear activation functions. Optimization of model parameters and causes proceed concurrently as a combination of fixed-point rules and Gauss-Newton decent. To make the optimization problem tractable, the standard mean-field and Laplace approximations are employed. The prec...

The results in this paper are motivated by two analogies. First, m-harmonic functions in Rn are extensions of the univariate algebraic polynomials of odd degree 2m−1. Second, Gauss’ and Pizzetti’s mean value formulae are natural multivariate analogues of the rectangular and Taylor’s quadrature formulae, respectively. This point of view suggests that some theorems concerning quadrature rules cou...

The connection between convergence of product integration rules and mean convergence of Lagrange interpolation in L, (1 <p < 00) has been thoroughly analysed by Sloan and Smith [37]. Motivated by this connection, we investigate mean convergence of Lagrange interpolation at the zeros of orthogonal polynomials associated with Freud weights on R. Our results apply to the weights exp(-x”/2), m = 2,...

The Fejér and Clenshaw–Curtis rules for numerical integration exhibit a curious phenomenon when applied to certain analytic functions. When N (the number of points in the integration rule) increases, the error does not decay to zero evenly but does so in two distinct stages. For N less than a critical value, the error behaves like O( −2N ), where is a constant greater than 1. For these values o...

In this work we study the minimization of a linear functional defined on a set of approximate solutions of a discrete ill-posed problem. The primary application of interest is the computation of confidence intervals for components of the solution of such a problem. We exploit the technique introduced by Eldén in 1990, utilizing a parametric programming reformulation involving the solution of a ...