Related papers: LeXInt: Package for Exponential Integrators employ…
We present the development of pyLLE, a freely accessible and cross-platform Lugiato-Lefever equation solver programmed in Python and Julia and optimized for the simulation of microresonator frequency combs. Examples illustrating its…
We present an implementation of algorithms for the symbolic integration of hyperlogarithms multiplied by rational functions in the computer algebra system FORM. This implementation encompasses cases where hyperlogarithms have rational…
In this paper, we propose a fully discrete soft thresholding trigonometric polynomial approximation on $[-\pi,\pi],$ named Lasso trigonometric interpolation. This approximation is an $\ell_1$-regularized discrete least squares approximation…
This paper introduces the hierarchical interpolative factorization for integral equations (HIF-IE) associated with elliptic problems in two and three dimensions. This factorization takes the form of an approximate generalized LU…
Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension of the program, and polynomial in the size of the ILP. That…
Duchon's method of thin plate splines defines a polyharmonic interpolant to scattered data values as the minimizer of a certain integral functional. For transfinite interpolation, i.e. interpolation of continuous data prescribed on curves…
The one-dimensional pseudo Leja sequences introduced in \cite{bialas2012pseudo}, as an alternative to Leja sequences, provides us with good interpolation nodes for the approximation of holomorphic functions. We propose a definition of…
This paper explores the reconstruction of a real-valued function $f$ defined over a domain $\Omega \subset \mathbb{R}^2$ using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the…
For large-scale data fitting, the least-squares progressive-iterative approximation (LSPIA) methods were proposed by Lin et al. (SIAM Journal on Scientific Computing, 2013, 35(6):A3052-A3068) and Deng et al. (Computer-Aided Design, 2014,…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
We present an efficient numerical implementation of the quasi-classical doorway-window approximation, specifically designed for on-the-fly simulations of time-resolved nonlinear spectroscopic signals in the Julia package WaveMixings.jl. The…
Time integration of advection dominated advection-diffusion problems on refined meshes can be a challenging task, since local refinement can lead to a severe time step restriction, whereas standard implicit time stepping is usually hardly…
In this paper, we consider a broad class of nonsmooth and nonconvex fractional programs, where the numerator can be written as the sum of a continuously differentiable convex function whose gradient is Lipschitz continuous and a proper…
In this paper, for solving a class of linear parabolic equations in rectangular domains, we have proposed an efficient Parareal exponential integrator finite element method. The proposed method first uses the finite element approximation…
Limiting real interpolation method is applied to describe the behaviour of the Fourier coefficients of functions that belong to spaces which are "very close" to L2.
We show that integrating a polynomial of degree t on an arbitrary simplex (with respect to Lebesgue measure) reduces to evaluating t homogeneous polynomials of degree j = 1, 2,. .. , t, each at a unique point $\xi$ j of the simplex. This…
Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…
In this article, we present a new implementation of the Laporta algorithm to reduce scalar multi-loop integrals---appearing in quantum field theoretic calculations---to a set of master integrals. We extend existing approaches by using an…
Given a large set of measurement sensor data, in order to identify a simple function that captures the essence of the data gathered by the sensors, we suggest representing the data by (spatial) functions, in particular by polynomials. Given…
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…