English
Related papers

Related papers: Rational approximation of $x^n$

200 papers

In this paper, we study the problem of maximizing $k$-submodular functions subject to a knapsack constraint. For monotone objective functions, we present a $\frac{1}{2}(1-e^{-2})\approx 0.432$ greedy approximation algorithm. For the…

Data Structures and Algorithms · Computer Science 2023-09-18 Hao Xiao , Qian Liu , Yang Zhou , Min Li

We present two algorithms for constructing orthonormal bases of rational function vectors with respect to a discrete inner product, and discuss how to use them for a rational approximation problem. Building on the pencil-based formulation…

Numerical Analysis · Mathematics 2026-01-21 Robbe Vermeiren

Under the reproducing kernel Hilbert spaces (RKHS), we consider the penalized least-squares of the partially functional linear models (PFLM), whose predictor contains both functional and traditional multivariate parts, and the multivariate…

Statistics Theory · Mathematics 2022-10-03 Huiming Zhang , Xiaoyu Lei

A Hankel operator $\mathbf{H}_\varphi$ on the Hardy space $H^2$ of the unit circle with analytic symbol $\varphi$ has minimal norm if $\|\mathbf{H}_\varphi\|=\|\varphi \|_2$ and maximal norm if $\|\mathbf{H}_\varphi\| = \|\varphi\|_\infty$.…

Functional Analysis · Mathematics 2023-10-09 Ole Fredrik Brevig , Kristian Seip

Euclidean norm calculations arise frequently in scientific and engineering applications. Several approximations for this norm with differing complexity and accuracy have been proposed in the literature. Earlier approaches were based on…

Numerical Analysis · Computer Science 2010-08-31 M. Emre Celebi , Fatih Celiker , Hassan A. Kingravi

The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…

Data Structures and Algorithms · Computer Science 2023-11-15 Larry Guth , Dominique Maldague , John Urschel

We shall present effective approximations measures for certain infinite products related to $q$-exponential function. There are two main targets. First we shall prove an explicit irrationality measure result for the values of…

Number Theory · Mathematics 2015-08-18 Leena Leinonen , Marko Leinonen , Tapani Matala-aho

We develop two simple and efficient approximation algorithms for the continuous $k$-medians problems, where we seek to find the optimal location of $k$ facilities among a continuum of client points in a convex polygon $C$ with $n$ vertices…

Optimization and Control · Mathematics 2023-06-28 Reyhaneh Mohammadi , Raghuveer Devulapalli , Mehdi Behroozi

The minimum Kullback entropy principle (mKE) is a useful tool to estimate quantum states and operations from incomplete data and prior information. In general, the solution of a mKE problem is analytically challenging and an approximate…

Quantum Physics · Physics 2015-06-18 Carlo Sparaciari , Stefano Olivares , Francesco Ticozzi , Matteo G. A. Paris

We study the $\ell_1$-low rank approximation problem, where for a given $n \times d$ matrix $A$ and approximation factor $\alpha \geq 1$, the goal is to output a rank-$k$ matrix $\widehat{A}$ for which $$\|A-\widehat{A}\|_1 \leq \alpha…

Data Structures and Algorithms · Computer Science 2020-04-17 Zhao Song , David P. Woodruff , Peilin Zhong

Let $E$ be the union of two real intervals not containing zero. Then $L_n^r(E)$ denotes the supremum norm of that polynomial $P_n$ of degree less than or equal to $n$, which is minimal with respect to the supremum norm provided that…

Complex Variables · Mathematics 2013-06-26 Klaus Schiefermayr

We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…

Machine Learning · Computer Science 2018-05-25 Anastasios Kyrillidis

We present estimators for a well studied statistical estimation problem: the estimation for the linear regression model with soft sparsity constraints ($\ell_q$ constraint with $0<q\leq1$) in the high-dimensional setting. We first present a…

Statistics Theory · Mathematics 2013-11-11 Li Zhang

We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we…

Optimization and Control · Mathematics 2025-03-25 Namrata Kundu , Yves Lucet

We study extreme values of desymmetrized eigenfunctions (so called Hecke eigenfunctions) for the quantized cat map, a quantization of a hyperbolic linear map of the torus. In a previous paper it was shown that for prime values of the…

Number Theory · Mathematics 2009-11-11 Par Kurlberg

Hard-capacitated $k$-means (HCKM) is one of the fundamental problems remaining open in combinatorial optimization and data mining areas. In this problem, one is required to partition a given $n$-point set into $k$ disjoint clusters with…

Data Structures and Algorithms · Computer Science 2019-05-01 Yicheng Xu , Rolf H. Möhring , Dachuan Xu , Yong Zhang , Yifei Zou

In this paper, we establish minimax optimal rates of convergence for prediction in a semi-functional linear model that consists of a functional component and a less smooth nonparametric component. Our results reveal that the smoother…

Statistics Theory · Mathematics 2021-11-01 Keli Guo , Jun Fan , Lixing Zhu

Let $\al$ be an irrational and $\varphi: \N \rightarrow \R^+$ be a function decreasing to zero. For any $\al$ with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set [E_{\varphi}(\al):={y\in \R:…

Dynamical Systems · Mathematics 2012-09-17 Lingmin Liao , Michal Rams

We give bounds on the error in the asymptotic approximation of the log-Gamma function $\ln\Gamma(z)$ for complex $z$ in the right half-plane. These improve on earlier bounds by Behnke and Sommer (1962), Spira (1971), and Hare (1997). We…

Numerical Analysis · Mathematics 2020-09-15 Richard P. Brent

Under investigation is the problem of finding the best approximation of a function in a Hilbert space subject to convex constraints and prescribed nonlinear transformations. We show that in many instances these prescriptions can be…

Functional Analysis · Mathematics 2021-06-17 Patrick L. Combettes , Zev C. Woodstock
‹ Prev 1 4 5 6 7 8 10 Next ›