Non-Generic Case of Leap-Frog for Optimal Knots Selection in Fitting Reduced Data

Research output: Chapter in Book/Conference paperConference paperpeer-review

2 Citations (Scopus)

Abstract

The problem of fitting multidimensional reduced data is analyzed here. The missing interpolation knots T are substituted by T^ which minimize a non-linear multivariate function J0. One of numerical schemes designed to compute such optimal knots relies on iterative scheme called Leap-Frog Algorithm. The latter is based on merging the respective generic and non-generic univariate overlapping optimizations of J0(k,i). The discussion to follow establishes the sufficient conditions enforcing unimodality of the non-generic case of J0(k,i) (for special data set-up and its perturbation). Illustrative example supplements the analysis in question. This work complements already existing analysis on generic case of Leap-Frog Algorithm.

Original languageEnglish
Title of host publicationComputational Science - ICCS 2022, 22nd International Conference, Proceedings
EditorsDerek Groen, Clélia de Mulatier, Valeria V. Krzhizhanovskaya, Peter M.A. Sloot, Maciej Paszynski, Jack J. Dongarra
PublisherSpringer Science + Business Media
Pages341-354
Number of pages14
ISBN (Print)9783031087561
DOIs
Publication statusPublished - 2022
Event22nd Annual International Conference on Computational Science, ICCS 2022 - London, United Kingdom
Duration: 21 Jun 202223 Jun 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13352 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd Annual International Conference on Computational Science, ICCS 2022
Abbreviated title ICCS 2022
Country/TerritoryUnited Kingdom
CityLondon
Period21/06/2223/06/22

Fingerprint

Dive into the research topics of 'Non-Generic Case of Leap-Frog for Optimal Knots Selection in Fitting Reduced Data'. Together they form a unique fingerprint.

Cite this