Discrete linearized least-squares rational approximation on the unit circle

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonal basis functions in discrete least squares rational approximation

We consider a problem that arises in the field of frequency domain system identification. If a discrete-time system has an input-output relation Y (z) = G(z)U(z), with transfer function G, then the problem is to find a rational approximation Ĝn for G. The data given are measurements of input and output spectra in the frequency points zk: {U(zk), Y (zk)}k=1 together with some weight. The approxi...

متن کامل

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

Uniform approximation by discrete least squares polynomials

We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...

متن کامل

Discrete Least Squares Approximation by Trigonometric Polynomials

We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...

متن کامل

Moving Least Squares Approximation on the Sphere

We introduce moving least squares approximation as an approximation scheme on the sphere. We prove error estimates and approximation orders. Finally, we show certain numerical results. x1. Introduction Recently, approximation on the sphere has become important because of its obvious applications to Meteorology, Oceanography and Geoscience and Geo-engineering in general. Over the last years seve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1994

ISSN: 0377-0427

DOI: 10.1016/0377-0427(94)90327-1