Normal splines in reconstruction of multi-dimensional dependencies

Similar documents
Development of the Normal Spline Method for Linear Integro-Differential Equations

SMOOTH APPROXIMATION OF DATA WITH APPLICATIONS TO INTERPOLATING AND SMOOTHING. Karel Segeth Institute of Mathematics, Academy of Sciences, Prague

Reproducing Kernel Hilbert Spaces

Function Approximation

Kernel Method: Data Analysis with Positive Definite Kernels

Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces ABSTRACT 1. INTRODUCTION

RIEMANN-HILBERT PROBLEM FOR THE MOISIL-TEODORESCU SYSTEM IN MULTIPLE CONNECTED DOMAINS

The Knaster problem and the geometry of high-dimensional cubes

A collocation method for solving some integral equations in distributions

Sufficient conditions for functions to form Riesz bases in L 2 and applications to nonlinear boundary-value problems

The Learning Problem and Regularization Class 03, 11 February 2004 Tomaso Poggio and Sayan Mukherjee

Key-Words: - fast algorithms, boundary value problems, partial differential equations, Radon transform, MATLAB software

Inverse Gravimetry Problem

MATH 590: Meshfree Methods

Reproducing Kernel Hilbert Spaces Class 03, 15 February 2006 Andrea Caponnetto

Approximation of Multivariate Functions

Remark on Hopf Bifurcation Theorem

A RECONSTRUCTION FORMULA FOR BAND LIMITED FUNCTIONS IN L 2 (R d )

The Fundamental Welfare Theorems

Finding discontinuities of piecewise-smooth functions

Encyclopedia of Mathematics, Supplemental Vol. 3, Kluwer Acad. Publishers, Dordrecht,

Regularization in Reproducing Kernel Banach Spaces

b i (µ, x, s) ei ϕ(x) µ s (dx) ds (2) i=1

ON THE CORRECT FORMULATION OF A MULTIDIMENSIONAL PROBLEM FOR STRICTLY HYPERBOLIC EQUATIONS OF HIGHER ORDER

Global regularity of a modified Navier-Stokes equation

DIRECT ERROR BOUNDS FOR SYMMETRIC RBF COLLOCATION

Proceedings of the 5th International Conference on Inverse Problems in Engineering: Theory and Practice, Cambridge, UK, 11-15th July 2005

MAIN ARTICLES. In present paper we consider the Neumann problem for the operator equation

Basicity of System of Exponents with Complex Coefficients in Generalized Lebesgue Spaces

POSITIVE DEFINITE FUNCTIONS AND MULTIDIMENSIONAL VERSIONS OF RANDOM VARIABLES

A LOWER BOUND ON BLOWUP RATES FOR THE 3D INCOMPRESSIBLE EULER EQUATION AND A SINGLE EXPONENTIAL BEALE-KATO-MAJDA ESTIMATE. 1.

Nonlinear Functional Analysis and its Applications

Geometry of Banach spaces and sharp versions of Jackson and Marchaud inequalities

Review: Stability of Bases and Frames of Reproducing Kernels in Model Spaces

Jensen-Shannon Divergence and Hilbert space embedding

PART IV Spectral Methods

Explicit schemes for parabolic and hyperbolic equations

Multiscale Frame-based Kernels for Image Registration

Numerical Mathematics

Splines which are piecewise solutions of polyharmonic equation

A SHARP STABILITY ESTIMATE IN TENSOR TOMOGRAPHY

ON PROJECTIVE METHODS OF APPROXIMATE SOLUTION OF SINGULAR INTEGRAL EQUATIONS. Introduction Let us consider an operator equation of second kind [1]

On a constructive proof of Kolmogorov s superposition theorem

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space

Contents. 2 Sequences and Series Approximation by Rational Numbers Sequences Basics on Sequences...

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Deviation Measures and Normals of Convex Bodies

Mathematics (MAT) MAT 051 Pre-Algebra. 4 Hours. Prerequisites: None. 4 hours weekly (4-0)

Numerische Mathematik

Polynomial Approximation: The Fourier System

arxiv: v1 [math.nt] 8 Apr 2016

COMPUTATIONAL METHODS AND ALGORITHMS Vol. I - Numerical Analysis and Methods for Ordinary Differential Equations - N.N. Kalitkin, S.S.

Asymptotically Efficient Nonparametric Estimation of Nonlinear Spectral Functionals

HERMITE MULTIPLIERS AND PSEUDO-MULTIPLIERS

THE ANALYTICAL SOLUTIONS OF THE BOUNDARY-VALUE PROBLEMS BY THE METHOD OF FACTORIZATION

PhD Qualifier Examination

Journal of Computational and Applied Mathematics. Multigrid method for solving convection-diffusion problems with dominant convection

MTAEA Vectors in Euclidean Spaces

Memoirs on Differential Equations and Mathematical Physics

Volterra Integral Equations of the First Kind with Jump Discontinuous Kernels

Numerical Probabilistic Analysis under Aleatory and Epistemic Uncertainty

ON SPECTRAL METHODS FOR VOLTERRA INTEGRAL EQUATIONS AND THE CONVERGENCE ANALYSIS * 1. Introduction

Introduction to the Tensor Train Decomposition and Its Applications in Machine Learning

Alfred Marshall s cardinal theory of value: the strong law of demand

On a constructive proof of Kolmogorov s superposition theorem

SELF-ADJOINTNESS OF SCHRÖDINGER-TYPE OPERATORS WITH SINGULAR POTENTIALS ON MANIFOLDS OF BOUNDED GEOMETRY

A PROOF OF THE TRACE THEOREM OF SOBOLEV SPACES ON LIPSCHITZ DOMAINS

On a diophantine inequality involving prime numbers

Discrete Projection Methods for Integral Equations

Professor: Alan G. Isaac These notes are very rough. Suggestions welcome. Samuelson (1938, p.71) introduced revealed preference theory hoping

SPEEDING UP THE CONVERGENCE OF SIMPLE GRADIENT METHODS

Polynomial approximation via de la Vallée Poussin means

Numerical Solution of Two-Dimensional Volterra Integral Equations by Spectral Galerkin Method

Reproducing Kernel Hilbert Spaces

Lecture Notes for January 23, 2012: Existence of general equilibrium in an economy with an excess demand function

Regularity and nonexistence results for anisotropic quasilinear elliptic equations in convex domains

引用北海学園大学学園論集 (171): 11-24

Performance Evaluation of Generalized Polynomial Chaos

Data fitting by vector (V,f)-reproducing kernels

Collaborative Network Formation in Spatial Oligopolies

Smooth pointwise multipliers of modulation spaces

ON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES

Projection Methods. Felix Kubler 1. October 10, DBF, University of Zurich and Swiss Finance Institute

i=1 α i. Given an m-times continuously

2014:05 Incremental Greedy Algorithm and its Applications in Numerical Integration. V. Temlyakov

On the positivity of linear weights in WENO approximations. Abstract

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.

A SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS

MAGNETIC BLOCH FUNCTIONS AND VECTOR BUNDLES. TYPICAL DISPERSION LAWS AND THEIR QUANTUM NUMBERS

Nonlinear Averaging in Economics

Keywords: large-scale problem, dimension reduction, multicriteria programming, Pareto-set, dynamic programming.

Reproducing Kernel Hilbert Spaces

Direct Learning: Linear Classification. Donglin Zeng, Department of Biostatistics, University of North Carolina

Lower Bounds for Approximation by MLP Neural Networks

Complex geometrical optics solutions for Lipschitz conductivities

Commutator estimates in the operator L p -spaces.

An Approximate Solution for Volterra Integral Equations of the Second Kind in Space with Weight Function

Notation. General. Notation Description See. Sets, Functions, and Spaces. a b & a b The minimum and the maximum of a and b

SERIES REPRESENTATIONS FOR BEST APPROXIMATING ENTIRE FUNCTIONS OF EXPONENTIAL TYPE

Transcription:

Normal splines in reconstruction of multi-dimensional dependencies V. K. GORBUNOV, Mathematical Economics Department, Ulyanovsk State University, Ulyanovsk, RUSSIA, K. S. MAKEDONSKY, Mathematical Economics Department, Ulyanovsk State University, Ulyanovsk, RUSSIA, I. I. KOHANOVSKY, Kyrgyz-Russian Slavic University, Bishkek, KYRGYZSTAN Abstract: The normal spline method is developed for reconstruction of multi-dimensional dependencies in case when information of the function s values and its derivatives is known in nodes of chaotic net in R n. The function is considered as an element of the Hilbert-Sobolev-Slobodetsky space with fractional differentiation order, and its approximation is an element of minimal norm from the set of interpolation system s solutions. Results of construction a utility function which is rationalized a trade statistics are given. Key-Words: approximation, generalized splines, normal splines, Hilbert spaces, reproducing kernel, utility function 1 Introduction The normal spline-collocation NS) method for linear ordinary differential and integral equations was proposed in [1]. It is effective for singular problems of the given classes [2]. The theoretical basis of the NS method is the classical functional analysis results: the theorem of embedding Sobolev s spaces in the Chebyshev ones [3], and F.Riesz s theorem of canonical representation of linear continuous functionals in Hilbert s spaces as inner products [4]. The last problem is the key one for effective NS algorithms construction. The NS method consists of some Hilbert-Sobolev norm minimization on the set of a collocation system s solutions. In contrast to the classical collocation methods the basis system here isn t given a priory, but it is constructed according to the chosen norm and to the coefficients of the solving problem. The base functions are canonical images of point wise linear continuous functionals in the chosen space presented as inner product). To realize this it is necessary to construct the corresponding reproducing kernel RK) defined by the norm [5]. In the case of mentioned above problems of functions of one variable it was sufficient to use classical Sobolev s spaces with 1

integer differentiation order. In [6] the NS method was developed for twodimensional problem of computerized tomography. Multivariate generalization of the NS was possible due to usage of the Hilbert-Sobolev-Slobodetsky HSS) spaces [7] Hε d R n ) = { } ϕ S : ε + ξ d/2 )F [ϕ] L 2 R n ), 1) were S - space of the generalized functions of slow growth, F [ϕ] - the Fourier transformation of ϕ, ξ R n, parameter ε > 0, and fractional differentiation order d > 0. In the traditional theory ε = 1, however, approximation properties of normal splines are improved at small ε > 0. Theoretical properties of spaces Hε d at ε > 0 are identical. They are Hilbert ones with norm ϕ = R n ε + ξ 2) d F 2 [ϕ] dξ. 2) The corresponding inner product is ϕ, ψ = ε + ξ 2) d F [ϕ] F [ψ] dξ, 3) R n where ϕ, ψ Hε d and line above F [ψ] means the complex conjunction. The problem of the getting RK for such kind of spaces has a solution in elementary functions when parameter d is a half-integer value. By this the value d = n + 3)/2 ensures the continuity of functions of the corresponding HSS such RK is constructed in [6]) and under d = n + 5)/2 such functions are continuously differentiable. This article is devoted to the problem of multidimensional dependencies interpolation on information of the desired function s values and its gradients in chaotic nodes of some net in the region of the function s factors space. The reproducing kernel for the HSS 1) with d = n + 5)/2, the general algorithm of function interpolation and its application to the problem of the utility function that rationalizes some trade statistics [8] are presented. 2 Problem statement and the reproducing kernel In points {x t : t = 0, T } of some domain G R n values u t of a function ux) C 2 G) and its gradient q t R n are given. Consider the problem of Hermit s interpolation of this function: u x t) = u t, ux t ) x = q t, t = 0, T. 4) This problem also covers the simple interpolation when only the first T + 1 equalities are used. The problem of interpolation is resolved non uniquely, so we precise it on the base of following properties of HSS spaces. It is known [7] that spaces 1) continuously embedded in the Chebyshev ones C l R n ) under d > n/2 + l. In this case values of function ux), and also their partial derivatives at the fixed points x = x t are linear continuous functionals in Hε d. In accordance to the mentioned above Riesz theorem from the theory of Hilbert spaces each of these functionals can be represented as innert product of some element from Hε d and ux). Thus interpolation system 4) is a system of linear equations in Hε d. This system is undetermined, but the set of its solutions is convex and closed as intersection of a finite number of hyperplanes). So, we state the problem to find the solution of system 4) that has a minimal norm 2). It is well known, such solution exists and unique [4]. We named it as the interpolating normal spline, and denote as u T x). Consider the problem of canonical representation of linear continuous functionals of the system 4). Such representation should be fulfilled with the help of RK for Hε d. On assumption [5], the RK of a Hilbert space with inner product, is such a function V ξ, x) which possess the following properties: 1) for any x R n the function V, x) Hε d, 2) for any ϕ Hε d and x R n the identity holds. ϕx) = V, x), ϕ 5) The last identity means that the function V, x) H d ε is the canonical presentation image) 2

of the pointwise functional defined as the value of a function ϕ ) in a given point x. In the case of continuous differentiability of the function V, x) we can to differentiate the identity 5) and arrive by this to the identity ϕx) = V, x), ϕ 6) which holds for any ϕ H d ε and x R n. It means, correspondingly, that the function V, x)/ canonically presents the pointwise functional defined as the value of a function ϕ )/ in a given point x. Repeating the technique of [6] one can obtain the RK for H d ε under d = n + 5 )/2: V ξ, x) = 3 + 3 ε ξ x + ε 2 ξ x 2) exp ε ξ x ). 7) We denote the canonical images of the pointwise functionals 5) for x = x t as h t ξ) = V ξ, x t) = 3 + 3 ε ξ x t + ε 2 ξ x t 2) and their derivatives 6) as h tiξ) = V ξ, xt ) = exp ε ξ x t ), 8) ε 2 ξ i x t i) 1 + ε ξ x t ) exp ε ξ x t ). 9) We also need in the second derivatives 2 V ξ, x)/ ξ i x j, but corresponding expressions is omitted in view of their complexities. 3 Algorithm of solving the interpolation problem After canonical transformation system 4) accepts the form { ht, u = u t, t = 0, T ; h ti, u = qt i, i = 1, n. 10) Here the inner product, is defined in accordance to 3). However the described properties of the RK allows to avoid this complicated calculation. The normal solution of this system, i.e. the normal spline u T, should be constructed by the generalized Lagrange method [1], [2]. Introduce the Gram matrix of the system 10) functions, i.e. the matrix G with coefficients g st = h s, h t, g tνs,i) = h t, h si, g νt,j)νs,i) = h tj, h si. Here and later index-function νs, i) = s n + i. Using described properties 5) and 6) of the RK it is easy to receive formulas for elements of matrix G: g st = V x s, x t ), g sνt,j) = V xs, x t ) x j, g νs,i)νt,j) = 2 V x s, x t ) ξ i x j. 11) This matrix symmetric and positive definite if all points { x t} are various. It is ensured by linear independence of functions {h t, h ti } defined by 8) and 9). By this the realization of the NS method is reduced to formation of the system s Gram matrix 11), to solving the corresponding system of linear algebraic equations [ T g ts λ s + ] g tνs,i) µ si = u t, t = 0, T ; [ t g νt,j)s λ s + ] g νt,j)νs,i) µ si = qj, t j = 1, n. with respect to the Lagrange multipliers {λ s, µ si }, and to formation of the normal spline u T x) = T [λ s h s x) + µ si h six)]. 12) 3

4 Numerical construction of a utility function The problem of construction of an ordinal utility function arises in frame of the inverse problem of the consumer s demand theory [8], [9]. It consists in the construction of such function ux), depended on vector x R+ n of quantities of bought commodities, that rationalizes an observable demand on some segment of the consumer market. Such demand is presented as a set of values of prices and quantities at observing times {p t, x t : t = 0,...T }. These expenditure data also determine consumers costs b t = p t, x t. In works [10], [11] and others the nonparametric method for construction of a utility function has generated. Here on the first stage values of the constructing utility function and corresponding Lagrange multipliers on the observed data {u t = ux t ), λ t = λp t, b t )} are defined as a solution of the Afriat system of linear inequalities. By this gradients of ux) at x = x t are q t = λ t p t. At the second stage on these outcomes the smooth utility function can be constructed by some interpolation method. The presented above NS method allows to do it on all commodity space R n +. Note, that in frame of standard non-parametric method only peace-wise linear utility function had been proposed [11]. The NS method has been tested on some test examples. The expenditure data were formed as follows. A test differentiable utility function ux) with known analytically demand vector-function xp, b) was given. Some price-data {p t } and consumers costs b t = const were defined. Corresponding quantity-data were calculated as x t = xp t, b t ) and gradients as q t = ux t ) x. More details see in [9]. Table 1 presents a bank of such data calculated for the case of two commodities and the Thornkvist utility function [8]: u x 1, x 2 ) = x α 1 xβ α 2, β > α > 0, 13) β x 1 + β + α) where β = 1.5, α = 0.5. This function presents consumers preferences when the first commodity is a necessary or a cheap one, and another is a luxury one. Table 1: Input data t x t 1 x t 2 q1 t q2 t 0 0.465 0.977 0.63994 1.27989 1 0.465 0.984 0.63746 1.27981 2 0.464 0.992 0.63495 1.27973 3 0.463 0.999 0.63246 1.27966 4 0.463 1.007 0.62994 1.27958 5 0.462 1.014 0.62745 1.27950 6 0.461 1.006 0.62501 1.27942 7 0.461 0.997 0.62258 1.27934 8 0.460 0.989 0.62012 1.27927 9 0.459 0.981 0.61768 1.27919 10 0.459 0.972 0.61525 1.27911 11 0.458 0.964 0.61279 1.27903 12 0.457 0.956 0.61041 1.27895 The NS method was realized in two variants: simple interpolation NSI) with use only the first T + 1 equalities of 4), and Hermit s one NSH) with use of all the system. The obtained spline 12) was compared with function 13) which generated the data bank. The comparison was fulfilled on the uniform grid covered the rectangle bounded by extreme values of data {x t 1, xt 2 }. Corresponding relative error at the grid step 0.01 in the NSI variant equals to 0.055% and in the NSH it equals to 0.071%. References: [1] Gorbunov V.K. The method of normal splinecollocation // Zh. Vichisl. Mat. Mat. Fiz. 1989. Vol. 29, N 2. P. 212-224. [2] Gorbunov V.K., Petrischev V.V. Development of the method of normal spline collocation for linear differential equations // Zh. Vichisl. Mat. Mat. Fiz. 2003. Vol. 43, N 8. P. 1161-1170. [3] Sobolev S. Applications of Functional Analysis to Mathematical Physics. Providence RI: Amer. Math. Soc., 1963. 4

[4] A. Balakrishnan. Applied Functional Analysis. New York: Springer-Verlag, 1976. [5] N. Aronszajn, Theory of reproducing kernels // Tranzactions of the AMS. 1950. Vol. 68. P. 337 404. [6] Kohanovsky I.I. Normal Splines in Computing Tomography // Avtometriya. 1995 N 2. P. 84-89. [7] Slobodeckyi L.N. The S.L.Sobolev spaces of fractional order and their applications to boundary-value problems for a differential equation in partial derivatives // Dokladi Akademii Nauk SSSR. 1958 Vol. 118. P. 243-246. [8] Gorbunov V.K. Mathematical model of a consumer demand: the theory and applied potential. Moscow: Economy, 2004 in print). [9] Gorbunov V.K., Makedonsky K.S. The construction of differentiable utility functions which are rationalized a trade statistics // Problemi Ekonomiki, Finansov i Upravleniya: Sbornik nauchnih trudov vuzov Rossii. Iss. 12. Ivanovo: Ivanovskii Gos. Him.-Tehnol. Univ., 2003 P. 278-285. [10] Afriat S.N. The construction of utility functions from expenditure data // International Economic Review. 1967 Vol. 8, N 1. P. 67-77. [11] Varian H. The nonparametric approach to demand analysis // Econometrica. 1982 Vol. 50, N 4. P. 945-973. 5