Related papers: Quadrature for Singular Integrals over convex Poly…
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…
Singularity subtraction for linear weakly singular Fredholm integral equations of the second kind is generalized to nonlinear integral equations. Two approaches are presented: The Classical Approach discretizes the nonlinear problem, and…
Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…
This work proposes four novel hybrid quadrature schemes for the efficient and accurate evaluation of weakly singular boundary integrals (1/r kernel) on arbitrary smooth surfaces. Such integrals appear in boundary element analysis for…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…
Weakly singular Volterra integral equations of the different types are considered. The construction of accuracy-optimal numerical methods for one-dimensional and multidimensional equations is discussed. Since this question is closely…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
The conforming finite element Galerkin method is applied to discretise in the spatial direction for a class of strongly nonlinear parabolic problems. Using elliptic projection of the associated linearised stationary problem with Gronwall…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
Generalizing the framework of an ultra-weak formulation for a hypersingular integral equation on closed polygons in [N. Heuer, F. Pinochet, arXiv 1309.1697 (to appear in SIAM J. Numer. Anal.)], we study the case of a hypersingular integral…
In this paper, we describe a new hybrid algorithm for computing all singular triplets above a given threshold and provide its implementation in MATLAB/Octave and R. The high performance of our codes and ease at which they can be used,…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
In this paper, we consider the nonconvex quadratically constrained quadratic programming (QCQP) with one quadratic constraint. By employing the conjugate gradient method, an efficient algorithm is proposed to solve QCQP that exploits the…
A novel mixed spectral-Galerkin method based on generalized ball polynomials is proposed for solving the biharmonic equation on a unit ball. By introducing an auxiliary variable to decouple the biharmonic equation into a system of…
We present and analyse numerical quadrature rules for evaluating regular and singular integrals on self-similar fractal sets. The integration domain $\mathbb{R}^n$ is assumed to be the compact attractor of an iterated function system of…
This article proposes a new numerical algorithm for second order elliptic equations in non-divergence form. The new method is based on a discrete weak Hessian operator locally constructed by following the weak Galerkin strategy. The…