Related papers: Exact integration scheme for six-node wedge elemen…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
In industrial applications requiring real-time feedback, such as quality control and robotic manipulation, the demand for high-speed and accurate pose estimation remains critical. Despite advances improving speed and accuracy in pose…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
In this paper we present a new family of rules for numerical integration. This family has up to half the error of the widely used Newton-Cotes rules when a sufficient number of points is evaluated and also much better numerical stability…
Numerical simulation of ultrasonic wave propagation provides an efficient tool for crack identification in structures, while it requires a high resolution and expensive time calculation cost in both time integration and spatial…
The paper presents a two-dimensional geometrically nonlinear formulation of a beam element that can accommodate arbitrarily large rotations of cross sections. The formulation is based on the integrated form of equilibrium equations, which…
Bus admittance matrix is widely used in power engineering for modeling networks. Being highly sparse, it requires fewer CPU operations when used for calculations. Meanwhile, sparse matrix calculations involve numerous indexing and scalar…
An accurate implicit description of geometries is enabled by the level-set method. Level-set data is given at the nodes of a higher-order background mesh and the interpolated zero-level sets imply boundaries of the domain or interfaces…
Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…
We develop multipoint stress mixed finite element methods for linear elasticity with weak stress symmetry on cuboid grids, which can be reduced to a symmetric and positive definite cell-centered system. The methods employ the lowest-order…
The three-step alternating iteration scheme for finding an iterative solution of a singular (non-singular) linear systems in a faster way was introduced by Nandi {\it et al.} [Numer. Algorithms; 84 (2) (2020) 457-483], recently. The authors…
We develop quadrature rules for the isogeometric analysis of wave propagation and structural vibrations that minimize the discrete dispersion error of the approximation. The rules are optimal in the sense that they only require two…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
The efficiency of boundary element methods depends crucially on the time required for setting up the stiffness matrix. The far-field part of the matrix can be approximated by compression schemes like the fast multipole method or…
In this work, we introduce the Kaiser-Bessel interpolation basis for the particle-mesh interpolation in the fast Ewald method. A reliable a priori error estimate is developed to measure the accuracy of the force computation in correlated…
The efficient compression of kernel matrices, for instance the off-diagonal blocks of discretized integral equations, is a crucial step in many algorithms. In this paper, we study the application of Skeletonized Interpolation to construct…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs…