Related papers: Gaussian quadrature rules for $C^1$ quintic spline…
For the purpose of uncertainty propagation a new quadrature rule technique is proposed that has positive weights, has high degree, and is constructed using only samples that describe the probability distribution of the uncertain parameters.…
Gauss-Lobatto quadrature nodes and weights are optimal for closed summation-by-parts (SBP) formulations based on polynomial approximation spaces in the sense that for a prescribed function space they yield an SBP operator of minimal…
We construct a Convolution Quadrature (CQ) scheme for the quasilinear subdiffusion equation of order $\alpha$ and supply it with the fast and oblivious implementation. In particular, we find a condition for the CQ to be admissible and…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…
We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw-Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n^{-s-1}) for some s > 0,…
We present a numerical framework for computing nested quadrature rules for various weight functions. The well-known Kronrod method extends the Gauss-Legendre quadrature by adding new optimal nodes to the existing Gauss nodes for integration…
The discrete unified gas kinetic scheme (DUGKS) has emerged as a promising Boltzmann solver capable of effectively capturing flow physics across all Knudsen numbers. However, simulating rarefied flows at high Knudsen numbers remains…
In this contribution we deal with Gaussian quadrature rules based on orthogonal polynomials associated with a weight function $w(x)= x^{\alpha} e^{-x}$ supported on an interval $(0,z)$, $z>0.$ The modified Chebyshev algorithm is used in…
Quasi-Newton methods form an important class of methods for solving nonlinear optimization problems. In such methods, first order information is used to approximate the second derivative. The aim is to mimic the fast convergence that can be…
This work presents a weighted quadrature (WQ) method to fast assemble Galerkin matrices based on unstructured spline surfaces. The method is developed upon a particular variant of unstructured splines, namely the bicubic analysis-suitable…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
In this paper we revisit some quadrature methods for highly oscillatory integrals of the form $\int_{-1}^1f(x)e^{{\rm i}\omega x}dx, \omega>0$. Exponentially Fitted (EF) rules depend on frequency dependent nodes which start off at the…
In this paper, we identify families of quadrature rules that are exact for sufficiently smooth spline spaces on uniformly refined triangles in $\mathbb{R}^2$. Given any symmetric quadrature rule on a triangle $T$ that is exact for…
Numerical integration is encountered in all fields of numerical analysis and the engineering sciences. By now, various efficient and accurate quadrature rules are known; for instance, Gauss-type quadrature rules. In many applications,…
The modelling of linear quadratic Gaussian optimal control problems on large complex networks is intractable computationally. Graphon theory provides an approach to overcome these issues by defining limit objects for infinite sequences of…
Stieltjes, Perron, and Markov in analysis of the moment problem, for absolutely continuous measures, constructed the underlying measure as the discontinuity across the cut of a Cauchy representation of an otherwise real-analytic function.…
In order to approximate the integral $I(f)=\int_a^b f(x) dx$, where $f$ is a sufficiently smooth function, models for quadrature rules are developed using a given {\it panel} of $n (n\geq 2)$ equally spaced points. These models arise from…
A q-Gauss-Newton algorithm is an iterative procedure that solves nonlinear unconstrained optimization problems based on minimization of the sum squared errors of the objective function residuals. Main advantage of the algorithm is that it…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
Gaussian Quadrature is a well known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums have found some new interest. In this paper we apply these ideas to…