An improved procedure for numerical inversion of Laplace transforms is proposed based on
accelerating the convergence of the Fourier series obtained from the inversion integral …

A procedure for calculating the trace of the influence matrix associated with a polynomial
smoothing spline of degree2m−1 fitted ton distinct, not necessarily equally spaced or uniformly …

We present some recurrences that are the basis for an algorithm to invert an n×n Toeplitz
system of linear equations with computational complexity O(nlog 2 n). The recurrences used …

Compressive sampling is a new paradigm for sampling, based on sparseness of signals or
signal representations. It is much less restrictive than Nyquist-Shannon sampling theory and …

In knowledge distillation, previous feature distillation methods mainly focus on the design of
loss functions and the selection of the distilled layers, while the effect of the feature projector …

The application of certain difference schemes (box, trapezoidal, Euler and backward Euler)
to the numerical solution of boundary value problems for nonlinear first order systems of …

The application of collocation methods based on piecewise polynomials to the numerical
solution of boundary value problems for systems of ordinary differential equations with a …

The connection between partial least squares regression (PLS) and Lanczos methods for
approximating the extremal eigenvalues of a symmetric matrix has long been known. Less well …

This paper contains a numerical stability analysis of factorization algorithms for computing
the Cholesky decomposition of symmetric positive definite matrices of displacement rank 2. …

Greed is good. However, the tighter you squeeze, the less you have. In this paper, a less
greedy algorithm for sparse signal reconstruction in compressive sensing, named orthogonal …