Related papers: Derivation of higher-order terms in FFT-based nume…
One of the main computational bottlenecks when working with kernel based learning is dealing with the large and typically dense kernel matrix. Techniques dealing with fast approximations of the matrix vector product for these kernel…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
The higher-order gas-kinetic scheme for solving the Navier-Stokes equations has been studied in recent years. In addition to the use of higher-order reconstruction techniques, many terms are used in the Taylor expansion of the gas…
In this paper we present a fully-coupled, two-scale homogenization method for dynamic loading in the spirit of FE$^2$ methods. The framework considers the balance of linear momentum including inertia at the microscale to capture possible…
We study Fourier transforms of holonomic D-modules on the complex affine line and show that their enhanced solution complexes are described by a twisted Morse theory. We thus recover and even strengthen the well-known formula for their…
A central question in numerical homogenization of partial differential equations with multiscale coefficients is the accurate computation of effective quantities, such as the homogenized coefficients. Computing homogenized coefficients…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…
Schemes with the second-order approximation in time are considered for numerical solving the Cauchy problem for an evolutionary equation of first order with a self-adjoint operator. The implicit two-level scheme based on the Pad\'{e}…
Fourier solvers have become efficient tools to establish structure-property relations in heterogeneous materials. Introduced as an alternative to the Finite Element (FE) method, they are based on fixed-point solutions of the…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…
We derive in this note a high-order corrector estimate for the homogenization of a microscopic semi-linear elliptic system posed in perforated domains. The major challenges are the presence of nonlinear volume and surface reaction rates.…
This work uses a linear relaxation method to develop efficient numerical schemes for the time-fractional Allen-Cahn and Cahn-Hilliard equations. The L1+-CN formula is used to discretize the fractional derivative, and an auxiliary variable…
We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…
We give a simplified presentation of the obstacle problem approach to stochastic homogenization for elliptic equations in nondivergence form. Our argument also applies to equations which depend on the gradient of the unknown function. In…
The two-scale computational homogenization method is proposed for modelling of locally periodic fluid-saturated media subjected a to large deformation induced by quasistatic loading. The periodic heterogeneities are relevant to the…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…