Related papers: Spectral Factorization and Lattice Geometry
The resonant mode approximation of the scattering matrix is considered for calculating the optical properties of multilayered periodic structures within the formalism of the Fourier-modal method for two diffraction thresholds in close…
A classification of ordinary differential equations and finite-difference equations in one variable having polynomial solutions (the generalized Bochner problem) is given. The method used is based on the spectral problem for a polynomial…
First, we extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Second, We develop a class of fast approximate generalized linear regression algorithms with respect to the spectral norm.…
We suggest a Hamiltonian formulation on a momentum lattice using a physically motivated regularization using the Breit-frame which links the maximal parton number to the lattice size. This scheme restricts parton momenta to positive values…
It is shown that the spectral points (bound states and resonances) generated by a central potential of a single-channel problem, can be found using rational parametrization of the S-matrix. To achieve this, one only needs values of the…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…
We here calculate the series expansion of the T-matrix for a spheroidal particle in the small-size/long-wavelength limit, up to third lowest order with respect to the size parameter, X, which we will define rigorously for a non-spherical…
Let $A$ be a matrix of size $n \times n$ over an algebraically closed field $F$ and $q(t)$ a monic polynomial of degree $n$. In this article, we describe the necessary and sufficient conditions of $q(t)$ so that there exists a rank one…
We derive, similar to Lau and Riha, a matrix formulation of a general best approximation theorem of Singer for the special case of spectral approximations of a given matrix from a given subspace. Using our matrix formulation we describe the…
Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
For the space $Lat_n$ of all the lattices in a $p$-adic $n$-dimensional linear space we obtain an analog of matrix beta-functions; this beta-function has a degeneration to the Tamagawa zeta-function. We propose an analog of Berezin kernels…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
This paper studies two structured approximation problems: (1) Recovering a corrupted low-rank Toeplitz matrix and (2) recovering the range of a Fourier matrix from a single observation. Both problems are computationally challenging because…
In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…
In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…
The relationship between a stable multivariable polynomial $p(z)$ and the Fourier coefficients of its spectral density function $1/|p(z)|^2$, is further investigated. In this paper we focus on the radial asymptotics of the Fourier…
We establish L^p bounds on L^2 normalized spectral clusters for self-adjoint elliptic Dirichlet forms with Lipschitz coefficients. In two dimensions we obtain best possible bounds for all p between $2 and infinity, up to logarithmic losses…