Detecting Separability of Nonlinear Mappings Using Computational Graphs
Summary :
Separability is a valuable property of nonlinear mappings. By exploiting this property, computational complexity of many numerical algorithms can be substantially reduced. In this letter, a new algorithm is presented that detects the separability of nonlinear mappings using the concept of "computational graph". A hybrid algorithm using both the top-down search and the bottom-up search is proposed. It is shown that this hybrid algorithm is advantageous in detecting the separability of nonlinear simultaneous functions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.12 pp.1820-1825
- Publication Date
- 1992/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Analog Circuits and Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiyotaka YAMAMURA, Masahiro KIYOI, "Detecting Separability of Nonlinear Mappings Using Computational Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 12, pp. 1820-1825, December 1992, doi: .
Abstract: Separability is a valuable property of nonlinear mappings. By exploiting this property, computational complexity of many numerical algorithms can be substantially reduced. In this letter, a new algorithm is presented that detects the separability of nonlinear mappings using the concept of "computational graph". A hybrid algorithm using both the top-down search and the bottom-up search is proposed. It is shown that this hybrid algorithm is advantageous in detecting the separability of nonlinear simultaneous functions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_12_1820/_p
Copy
@ARTICLE{e75-a_12_1820,
author={Kiyotaka YAMAMURA, Masahiro KIYOI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Detecting Separability of Nonlinear Mappings Using Computational Graphs},
year={1992},
volume={E75-A},
number={12},
pages={1820-1825},
abstract={Separability is a valuable property of nonlinear mappings. By exploiting this property, computational complexity of many numerical algorithms can be substantially reduced. In this letter, a new algorithm is presented that detects the separability of nonlinear mappings using the concept of "computational graph". A hybrid algorithm using both the top-down search and the bottom-up search is proposed. It is shown that this hybrid algorithm is advantageous in detecting the separability of nonlinear simultaneous functions.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Detecting Separability of Nonlinear Mappings Using Computational Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1820
EP - 1825
AU - Kiyotaka YAMAMURA
AU - Masahiro KIYOI
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1992
AB - Separability is a valuable property of nonlinear mappings. By exploiting this property, computational complexity of many numerical algorithms can be substantially reduced. In this letter, a new algorithm is presented that detects the separability of nonlinear mappings using the concept of "computational graph". A hybrid algorithm using both the top-down search and the bottom-up search is proposed. It is shown that this hybrid algorithm is advantageous in detecting the separability of nonlinear simultaneous functions.
ER -
English
