Irina Vaviļčenkova, Svetlana Asmuss ELEVENTH INTERNATIONAL CONFERENCE ON FUZZY SET THEORY AND APPLICATIONS Liptovský Ján, Slovak Republic, January 30 -

Slides:



Advertisements
Similar presentations
Splines I – Curves and Properties
Advertisements

Shortest Vector In A Lattice is NP-Hard to approximate
Lecture Notes #11 Curves and Surfaces II
Higher-order Linked Interpolation in Thick Plate Finite Elements
Lecture 10 Curves and Surfaces I
By S Ziaei-Rad Mechanical Engineering Department, IUT.
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
CS 445/645 Fall 2001 Hermite and Bézier Splines. Specifying Curves Control Points –A set of points that influence the curve’s shape Knots –Control points.
Data mining and statistical learning - lecture 6
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
Basis Expansion and Regularization Presenter: Hongliang Fei Brian Quanz Brian Quanz Date: July 03, 2008.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
08/30/00 Dinesh Manocha, COMP258 Hermite Curves A mathematical representation as a link between the algebraic & geometric form Defined by specifying the.
Finite element method – basis functions 1 Finite Elements: Basis functions 1-D elements  coordinate transformation  1-D elements  linear basis functions.
EARS1160 – Numerical Methods notes by G. Houseman
Chapter 3, Interpolation and Extrapolation. Interpolation & Extrapolation (x i,y i ) Find an analytic function f(x) that passes through given N points.
Lecture 29 of 42 Bezier Curves and Splines Wednesday, 02 April 2008
Numerical Analysis –Interpolation
Splines II – Interpolating Curves
Distance Between a Catmull- Clark Subdivision Surface and Its Limit Mesh Zhangjin Huang, Guoping Wang Peking University, China.
ECIV 720 A Advanced Structural Mechanics and Analysis
KFUPM SE301: Numerical Methods Topic 5: Interpolation Lectures 20-22:
MANE 4240 & CIVL 4240 Introduction to Finite Elements Numerical Integration in 1D Prof. Suvranu De.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
CS Subdivision I: The Univariate Setting Peter Schröder.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Spline curves 1/23 Curves and Surfaces.
MAT 4725 Numerical Analysis Section 8.2 Orthogonal Polynomials and Least Squares Approximations (Part II)
This Week Week Topic Week 1 Week 2 Week 3 Week 4 Week 5
V. Space Curves Types of curves Explicit Implicit Parametric.
Digital Image Processing CCS331 Image Interpolation 1.
Regression analysis Control of built engineering objects, comparing to the plan Surveying observations – position of points Linear regression Regression.
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Consider the following: Now, use the reciprocal function and tangent line to get an approximation. Lecture 31 – Approximating Functions
Vector Computer Graphic. Vector entities Line Circle, Ellipse, arc,… Curves: Spline, Bezier’s curve, … … Areas Solids Models.
University of Memphis Mathematical Sciences Numerical Analysis “Algebra” (from the Arabic al-jabr, (the mending of) “broken bones”) literally refers to.
Splines Vida Movahedi January 2007.
Chapter 4 Interpolation and Approximation. 4.1 Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
Polynomial Preserving Gradient Recovery in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202
Chapter 2 System of Linear Equations Sensitivity and Conditioning (2.3) Solving Linear Systems (2.4) January 19, 2010.
Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1­­, v 2, v 3,..., v n › and w = ‹w 1­­, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.
Computers in Civil Engineering 53:081 Spring 2003 Lecture #15 Spline Interpolation.
KFUPM SE301: Numerical Methods Topic 5: Interpolation Lectures 20-22:
MECH4450 Introduction to Finite Element Methods Chapter 9 Advanced Topics II - Nonlinear Problems Error and Convergence.
Computer Programming (TKK-2144) 13/14 Semester 1 Instructor: Rama Oktavian Office Hr.: M.13-15, W Th , F
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
L5 – Curves in GIS NGEN06 & TEK230: Algorithms in Geographical Information Systems by: Sadegh Jamali (source: Lecture notes in GIS, Lars Harrie) 1 L5-
Splines I – Curves and Properties based on: Michael Gleicher Curves, chapter 15 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart.
Computational Intelligence: Methods and Applications Lecture 29 Approximation theory, RBF and SFN networks Włodzisław Duch Dept. of Informatics, UMK Google:
1. Systems of Linear Equations and Matrices (8 Lectures) 1.1 Introduction to Systems of Linear Equations 1.2 Gaussian Elimination 1.3 Matrices and Matrix.
MA2213 Lecture 2 Interpolation.
Specialist Mathematics Polynomials Week 3. Graphs of Cubic Polynomials.
MECH593 Introduction to Finite Element Methods
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
SIAM Conference on Geometric Desing & Computing Approximation of spatial data with shape constraints Maria Lucia Sampoli University of Siena, Italy.
Neural Network Approximation of High- dimensional Functions Peter Andras School of Computing and Mathematics Keele University
Introduction to Parametric Curve and Surface Modeling.
MAT 4725 Numerical Analysis Section 8.2 Orthogonal Polynomials and Least Squares Approximations (Part II)
1 Approximating functions, polynomial interpolation (Lagrange and Newton’s divided differences) formulas, error approximations.
Estimating standard error using bootstrap
Numerical Analysis Lecture 42.
Non-linear relationships
Interpolation Estimation of intermediate values between precise data points. The most common method is: Although there is one and only one nth-order.
Lecture 25 – Power Series Def: The power series centered at x = a:
Spline Interpolation Class XVII.
MATH 174: Numerical Analysis I
Splines There are cases where polynomial interpolation is bad
Theory of Approximation: Interpolation
Presentation transcript:

Irina Vaviļčenkova, Svetlana Asmuss ELEVENTH INTERNATIONAL CONFERENCE ON FUZZY SET THEORY AND APPLICATIONS Liptovský Ján, Slovak Republic, January 30 - February 3, 2012 Department of Mathematics, University of Latvia

This talk is devoted to F-transform (fuzzy transform). The core idea of fuzzy transform is inwrought with an interval fuzzy partitioning into fuzzy subsets, determined by their membership functions. In this work we consider polynomial splines of degree m and defect 1 with respect to the mesh of an interval with some additional nodes. The idea of the direct F-transform is transformation from a function space to a finite dimensional vector space. The inverse F-transform is transformation back to the function space.

Fuzzy partitions

The fuzzy transform was proposed by I. Perfilieva in 2003 and studied in several papers [1] I. Perfilieva, Fuzzy transforms: Theory and applications, Fuzzy Sets and Systems, 157 (2006) 993–1023. [2] I. Perfilieva, Fuzzy transforms, in: J.F. Peters, et al. (Eds.), Transactions on Rough Sets II, Lecture Notes in Computer Science, vol. 3135, 2004, pp. 63–81. [3] L. Stefanini, F- transform with parametric generalized fuzzy partitions, Fuzzy Sets and Systems 180 (2011) 98–120. [4] I. Perfilieva, V. Kreinovich, Fuzzy transforms of higher order approximate derivatives: A theorem, Fuzzy Sets and Systems 180 (2011) 55–68. [5] G. Patanè, Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations, Fuzzy Sets and Systems 180 (2011) 41–54.

Classical fuzzy partition

An uniform fuzzy partition of the interval [0, 9] by fuzzy sets with triangular shaped membership funcions n=7

Polynomial splines

Quadratic spline construction

Cubic spline construction

An uniform fuzzy partition of the interval [0, 9] by fuzzy sets with cubic spline membership funcions n=7

Generally basic functions are specified by the mesh but when we construct those functions with the help of polynomial splines we use additional nodes. On additional nodes where k directly depends on the degree of a spline used for constructing basic functions and the number of nodes in the original mesh

Additional nodes for splines with degree 1,2,3...m (uniform partition)

We consider additional nodes as parameters of fuzzy partition: the shape of basic functions depends of the choise of additional nodes

Direct F – transform

Inverse F-transform The error of the inverse F-transform

Inverse F-transforms of the test function f(x)=sin(x π/9 )

Inverse F-transform errors in intervals for the test function f(x)=sin(xπ/9) in case of different basic functions, 3/2 step.

Inverse F-transform and inverse H-transform of the test function f(x)=sin(1 /x ) in case of linear spline basic functions, n=10 un n=20

Inverse F-transform and inverse H-transform of the test function f(x)=sin(1 /x ) in case of quadratic spline basic functions, n=10 un n=20

Inverse F-transform and inverse H-transform of the test function f(x)=sin(1 /x ) in case of cubic spline basic functions, n=10 un n=20

Generalized fuzzy partition

An uniform fuzzy partition and a fuzzy m-partition of the interval [0, 9] based on cubic spline membership funcions, n=7, m=3

Numerical example

Numerical example: approximation of derivatives

Approximation of derrivatives

F-transform and least-squares approximation

Direct transform

Direct transform matrix analysis Matrix M 1 for linear spline basic functions The evaluation of inverse matrix norm is true

Matrix M 2 for quadratic spline basic functions The evaluation of inverse matrix norm is true

Matrix M 3 for cubic spline basic functions The evaluation of inverse matrix norm is true

Direct transform error bounds

Inverse transform The error of the inverse transform

Inverse transforms of the test function f(x)=sin(x π/9 ) in case of quadratic spline basic functions, n=7

Inverse transforms approximation errors of the test function f(x)=sin(x π/9 ) in case of quadratic spline basic functions, for n=10, n=20, n=40.

Inverse transforms of the test function f(x)=sin(x π/9 ) in case of cubic spline basic functions, n=7

Inverse transforms approximation errors of the test function f(x)=sin(x π/9 ) in case of cubic spline basic functions, for n=10, n=20, n=40.