: This study aims at constructing new and effective fully explicit numerical schemes for solving the heat conduction equation. We use fractional time steps for the odd cells in the well-known odd–even hopscotch structure and fill it with several different formulas to obtain a large number of algorithm combinations. We generate random parameters in a highly inhomogeneous spatial distribution to set up discretized systems with various stiffness ratios, and systematically test these new methods by solving these systems. The best combinations are verified by comparing them to analytical solutions. We also show analytically that their rate of convergence is two and that they are unconditionally stable.
{"title":"New Explicit Asymmetric Hopscotch Methods for the Heat Conduction Equation","authors":"M. Saleh, E. Kovács","doi":"10.3390/ioca2021-10902","DOIUrl":"https://doi.org/10.3390/ioca2021-10902","url":null,"abstract":": This study aims at constructing new and effective fully explicit numerical schemes for solving the heat conduction equation. We use fractional time steps for the odd cells in the well-known odd–even hopscotch structure and fill it with several different formulas to obtain a large number of algorithm combinations. We generate random parameters in a highly inhomogeneous spatial distribution to set up discretized systems with various stiffness ratios, and systematically test these new methods by solving these systems. The best combinations are verified by comparing them to analytical solutions. We also show analytically that their rate of convergence is two and that they are unconditionally stable.","PeriodicalId":440696,"journal":{"name":"The 1st International Electronic Conference on Algorithms","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133154561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
: During the transmission of commodities from one place to another, there may be loss due to death, leakage, damage, or evaporation. To address this problem, each arc of the network contains a gain factor. The network is a lossy network with a gain factor of at most one on each arc. The generalized multi-commodity flow problem deals with routing several distinct goods from specific supply points to the corresponding demand points on an underlying network with minimum loss. The sum of all commodities on each arc does not exceed its capacity. Motivated by the uneven road condition of transportation network topology, we incorporate a contraflow approach with orientation-dependent transit times on arcs and introduce the generalized multi-commodity contraflow problem on a lossy network with orientation-dependent transit times. In general, the generalized dynamic multi-commodity contraflow problem is NP-hard. For a lossy network with a symmetric transit time on anti-parallel arcs, the problem is solved in pseudo-polynomial time. We extend the analytical solution with a symmetric transit time on anti-parallel arcs to asymmetric transit times and present algorithms that solve it within the same time-complexity.
{"title":"Multi-Commodity Contraflow Problem on Lossy Network with Asymmetric Transit times","authors":"S. Gupta, Urmila Pyakurel, T. N. Dhamala","doi":"10.3390/ioca2021-10878","DOIUrl":"https://doi.org/10.3390/ioca2021-10878","url":null,"abstract":": During the transmission of commodities from one place to another, there may be loss due to death, leakage, damage, or evaporation. To address this problem, each arc of the network contains a gain factor. The network is a lossy network with a gain factor of at most one on each arc. The generalized multi-commodity flow problem deals with routing several distinct goods from specific supply points to the corresponding demand points on an underlying network with minimum loss. The sum of all commodities on each arc does not exceed its capacity. Motivated by the uneven road condition of transportation network topology, we incorporate a contraflow approach with orientation-dependent transit times on arcs and introduce the generalized multi-commodity contraflow problem on a lossy network with orientation-dependent transit times. In general, the generalized dynamic multi-commodity contraflow problem is NP-hard. For a lossy network with a symmetric transit time on anti-parallel arcs, the problem is solved in pseudo-polynomial time. We extend the analytical solution with a symmetric transit time on anti-parallel arcs to asymmetric transit times and present algorithms that solve it within the same time-complexity.","PeriodicalId":440696,"journal":{"name":"The 1st International Electronic Conference on Algorithms","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131400461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：