Presentation 1993/6/19
An Algorithm for Representation of Nonseparable Function in Separable
Kiyotaka Yamamura, Taiko Murayama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents an algorithm that transforms nonseparable functions of several variables into separable forms by introducing auxiliary variables.A mapping f:R^n→ R^m is called separable if it can be written in the form f(x)= f^1(X_1)+ f^2(X_2)+ ・・・ + f^n(X_ n).Recently,many algorithms have been proposed that improves the computational efficiency substantially by exploiting the separability.The algorithm proposed in this paper extends the application field of these algorithms.It also gives a constructive method to the Hilbert′s 13th problem in the practical level.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) separability / nonliear function / computational graph / Hilbert′s 13th problem
Paper # CAS93-51,NLP93-39
Date of Issue

Conference Information
Committee CAS
Conference Date 1993/6/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Algorithm for Representation of Nonseparable Function in Separable
Sub Title (in English)
Keyword(1) separability
Keyword(2) nonliear function
Keyword(3) computational graph
Keyword(4) Hilbert′s 13th problem
1st Author's Name Kiyotaka Yamamura
1st Author's Affiliation Department of Computer Science,Faculty of Engineering,Gunma University()
2nd Author's Name Taiko Murayama
2nd Author's Affiliation Department of Computer Science,Faculty of Engineering,Gunma University
Date 1993/6/19
Paper # CAS93-51,NLP93-39
Volume (vol) vol.93
Number (no) 102
Page pp.pp.-
#Pages 8
Date of Issue