Pub Date : 2022-06-01DOI: 10.1016/j.jcmds.2022.100038
Kwesi Acheampong , Hongbo Guan , Huiqing Zhu
In this paper, we consider the localized method of approximate particular solutions (LMAPS) for solving a two-dimensional distributive optimal control problem governed by elliptic partial differential equations. Both radial basis functions and polynomial basis functions (RBFs) are used in the LMAPS discretization, while the leave-one-out cross-validation is adopted for the selection of the shape parameter appeared in RBFs. Numerical experiments are presented to demonstrate the accuracy and efficiency of the proposed method.
{"title":"The localized method of approximate particular solutions for solving an optimal control problem","authors":"Kwesi Acheampong , Hongbo Guan , Huiqing Zhu","doi":"10.1016/j.jcmds.2022.100038","DOIUrl":"10.1016/j.jcmds.2022.100038","url":null,"abstract":"<div><p>In this paper, we consider the localized method of approximate particular solutions (LMAPS) for solving a two-dimensional distributive optimal control problem governed by elliptic partial differential equations. Both radial basis functions and polynomial basis functions (RBFs) are used in the LMAPS discretization, while the leave-one-out cross-validation is adopted for the selection of the shape parameter appeared in RBFs. Numerical experiments are presented to demonstrate the accuracy and efficiency of the proposed method.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"3 ","pages":"Article 100038"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000098/pdfft?md5=7a88a8c30fe0636f48d4081f589fccf5&pid=1-s2.0-S2772415822000098-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84146507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-01DOI: 10.1016/j.jcmds.2022.100028
Kaixuan Shao, Gang Mei, Yinghan Wu
Ozone is an active gas in the atmosphere. Its content is quite low, but it plays an important role in protecting the health of human beings and other living things on earth. Ozone circulates in the atmosphere, and its total distribution and variation trend are related to geographical position. In this paper, we collected global Ozone tendency data and investigated the changes in global distribution of Ozone in 2018 using -means clustering algorithm. We observed that (1) the global Ozone tendency can be broadly divided into four regions; (2) the data with a large variation range of total Ozone tendency is mainly concentrated near the sea–land boundary, and their distribution is similar to the coastline contour to some extent; (3) after clustering, the concentration area of the data with great changes in the total Ozone tendency is roughly x-shaped distribution, and the acute angle between the data and the latitude line is between and . Our findings can contribute to a clearer understanding and analysis of the tendency of global Ozone change and help mitigate the Ozone hole problem in different regions.
{"title":"Investigating changes in global distribution of Ozone in 2018 using k-means clustering algorithm","authors":"Kaixuan Shao, Gang Mei, Yinghan Wu","doi":"10.1016/j.jcmds.2022.100028","DOIUrl":"10.1016/j.jcmds.2022.100028","url":null,"abstract":"<div><p>Ozone is an active gas in the atmosphere. Its content is quite low, but it plays an important role in protecting the health of human beings and other living things on earth. Ozone circulates in the atmosphere, and its total distribution and variation trend are related to geographical position. In this paper, we collected global Ozone tendency data and investigated the changes in global distribution of Ozone in 2018 using <span><math><mi>k</mi></math></span>-means clustering algorithm. We observed that (1) the global Ozone tendency can be broadly divided into four regions; (2) the data with a large variation range of total Ozone tendency is mainly concentrated near the sea–land boundary, and their distribution is similar to the coastline contour to some extent; (3) after clustering, the concentration area of the data with great changes in the total Ozone tendency is roughly x-shaped distribution, and the acute angle between the data and the latitude line is between <span><math><mrow><mn>25</mn><mo>°</mo></mrow></math></span> and <span><math><mrow><mn>45</mn><mo>°</mo></mrow></math></span>. Our findings can contribute to a clearer understanding and analysis of the tendency of global Ozone change and help mitigate the Ozone hole problem in different regions.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"3 ","pages":"Article 100028"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000049/pdfft?md5=78352574a10b9397c871aa984652f8a1&pid=1-s2.0-S2772415822000049-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89475073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-01DOI: 10.1016/j.jcmds.2022.100044
Philipp Väth, Maximilian Münch, Christoph Raab, Frank-Michael Schleif
{"title":"PROVAL: A framework for comparison of protein sequence embeddings","authors":"Philipp Väth, Maximilian Münch, Christoph Raab, Frank-Michael Schleif","doi":"10.1016/j.jcmds.2022.100044","DOIUrl":"https://doi.org/10.1016/j.jcmds.2022.100044","url":null,"abstract":"","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85526386","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}
Pub Date : 2022-05-01DOI: 10.1016/j.jcmds.2022.100042
P. Andreini, S. Bonechi, M. Bianchini, Filippo Geraci
{"title":"MicroRNA signature for interpretable breast cancer classification with subtype clue","authors":"P. Andreini, S. Bonechi, M. Bianchini, Filippo Geraci","doi":"10.1016/j.jcmds.2022.100042","DOIUrl":"https://doi.org/10.1016/j.jcmds.2022.100042","url":null,"abstract":"","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85068042","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}
Pub Date : 2022-04-01DOI: 10.1016/j.jcmds.2022.100034
Nitesh M. Sureja, Bharat V. Chawda, A. Vasant
{"title":"An improved K-medoids clustering approach based on the crow search algorithm","authors":"Nitesh M. Sureja, Bharat V. Chawda, A. Vasant","doi":"10.1016/j.jcmds.2022.100034","DOIUrl":"https://doi.org/10.1016/j.jcmds.2022.100034","url":null,"abstract":"","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88457917","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}
Pub Date : 2022-01-01DOI: 10.1016/j.jcmds.2021.100021
Adam Siegel
A novel algorithm to compute the convex hull of any given hyperdimensional data set is presented. This algorithm has lower memory requirements than state of the art software, and runtimes which are typically much faster than conventional programs and algorithms which do the same. A discussion is presented which examines the large importance that convex hull computations serve in creating general surrogate models from data sets, and their importance to machine learning algorithms. In addition to the deep reaching applications in many fields, this algorithm can be used to help solve design problems, specifically those in preliminary design when surrogate models are used to perform rapid design trades. The algorithm is presented, in addition to algorithms which compute volumes and facilitate understanding of hyperdimensional spaces which cannot be easily visualized. This paper concludes with the presentation of a representative design problem containing similar dimensionality and numbers of points as a standard engineering preliminary design problem. The minimum number of points needed for the interpolation of a general surrogate model during design and analysis is then discussed, including the proposal of a new metric.
{"title":"A parallel algorithm for understanding design spaces and performing convex hull computations","authors":"Adam Siegel","doi":"10.1016/j.jcmds.2021.100021","DOIUrl":"10.1016/j.jcmds.2021.100021","url":null,"abstract":"<div><p>A novel algorithm to compute the convex hull of any given hyperdimensional data set is presented. This algorithm has lower memory requirements than state of the art software, and runtimes which are typically much faster than conventional programs and algorithms which do the same. A discussion is presented which examines the large importance that convex hull computations serve in creating general surrogate models from data sets, and their importance to machine learning algorithms. In addition to the deep reaching applications in many fields, this algorithm can be used to help solve design problems, specifically those in preliminary design when surrogate models are used to perform rapid design trades. The algorithm is presented, in addition to algorithms which compute volumes and facilitate understanding of hyperdimensional spaces which cannot be easily visualized. This paper concludes with the presentation of a representative design problem containing similar dimensionality and numbers of points as a standard engineering preliminary design problem. The minimum number of points needed for the interpolation of a general surrogate model during design and analysis is then discussed, including the proposal of a new metric.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"2 ","pages":"Article 100021"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415821000110/pdfft?md5=dbb4410045084152f030c63f6ecfbbd5&pid=1-s2.0-S2772415821000110-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82239247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.jcmds.2022.100025
M. Devakar , K. Ramesh , K. Vajravelu
The recent investigations ensure that, the effect of an endoscope on the peristaltic flow is very important for medical diagnosis and it has many clinical applications such as gastric juice motion in the small intestine when an endoscope is inserted through it. In the current article, the influence of magnetohydrodynamic (MHD) on the peristaltic propulsion of non-Newtonian fluid (considered as couple stress fluid) in a tube consisting of endoscope has been considered. The couple stress fluid occupies the space between two co-axial inclined tubes. The inner tube is uniformly circular and rigid while the outer tube considered as sinusoidal wave. The fluid motion is discussed in a wave frame which is moving with the constant velocity. The governing equations of two-dimensional flow have been abridged under the lubrication approach. Analytical solutions have been obtained for the velocity and pressure gradient with the help of modified Bessel functions. Numerical integration is used to evaluate the pressure difference and friction forces. The effect of emerging flow parameters on the velocity, frictional forces, pressure difference, pressure gradient and trapping phenomenon have been discussed. It is noted that, the magnetic force resists the flow and pumping rate in the peristaltic flow enhances from the horizontal to vertical tube. The present study has a wide range of applications in bio-medical engineering like the transport phenomenon in peristaltic micro pumps.
{"title":"Magnetohydrodynamic effects on the peristaltic flow of couple stress fluid in an inclined tube with endoscope","authors":"M. Devakar , K. Ramesh , K. Vajravelu","doi":"10.1016/j.jcmds.2022.100025","DOIUrl":"10.1016/j.jcmds.2022.100025","url":null,"abstract":"<div><p>The recent investigations ensure that, the effect of an endoscope on the peristaltic flow is very important for medical diagnosis and it has many clinical applications such as gastric juice motion in the small intestine when an endoscope is inserted through it. In the current article, the influence of magnetohydrodynamic (MHD) on the peristaltic propulsion of non-Newtonian fluid (considered as couple stress fluid) in a tube consisting of endoscope has been considered. The couple stress fluid occupies the space between two co-axial inclined tubes. The inner tube is uniformly circular and rigid while the outer tube considered as sinusoidal wave. The fluid motion is discussed in a wave frame which is moving with the constant velocity. The governing equations of two-dimensional flow have been abridged under the lubrication approach. Analytical solutions have been obtained for the velocity and pressure gradient with the help of modified Bessel functions. Numerical integration is used to evaluate the pressure difference and friction forces. The effect of emerging flow parameters on the velocity, frictional forces, pressure difference, pressure gradient and trapping phenomenon have been discussed. It is noted that, the magnetic force resists the flow and pumping rate in the peristaltic flow enhances from the horizontal to vertical tube. The present study has a wide range of applications in bio-medical engineering like the transport phenomenon in peristaltic micro pumps.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"2 ","pages":"Article 100025"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000025/pdfft?md5=5e8e7394d66cb627266784919f83cdc1&pid=1-s2.0-S2772415822000025-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73214965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.jcmds.2021.100018
Winfried Auzinger , Juliette Dubois , Karsten Held , Harald Hofstätter , Tobias Jawecki , Anna Kauch , Othmar Koch , Karolina Kropielnicka , Pranav Singh , Clemens Watzenböck
Strongly interacting electrons in solids are generically described by Hubbard-type models, and the impact of solar light can be modeled by an additional time-dependence. This yields a finite dimensional system of ordinary differential equations (ODE)s of Schrödinger type, which can be solved numerically by exponential time integrators of Magnus type. The efficiency may be enhanced by combining these with operator splittings. We will discuss several different approaches of employing exponential-based methods in conjunction with an adaptive Lanczos method for the evaluation of matrix exponentials and compare their accuracy and efficiency. For each integrator, we use defect-based local error estimators to enable adaptive time-stepping. This serves to reliably control the approximation error and reduce the computational effort.
{"title":"Efficient Magnus-type integrators for solar energy conversion in Hubbard models","authors":"Winfried Auzinger , Juliette Dubois , Karsten Held , Harald Hofstätter , Tobias Jawecki , Anna Kauch , Othmar Koch , Karolina Kropielnicka , Pranav Singh , Clemens Watzenböck","doi":"10.1016/j.jcmds.2021.100018","DOIUrl":"10.1016/j.jcmds.2021.100018","url":null,"abstract":"<div><p>Strongly interacting electrons in solids are generically described by Hubbard-type models, and the impact of solar light can be modeled by an additional time-dependence. This yields a finite dimensional system of ordinary differential equations (ODE)s of Schrödinger type, which can be solved numerically by exponential time integrators of Magnus type. The efficiency may be enhanced by combining these with operator splittings. We will discuss several different approaches of employing exponential-based methods in conjunction with an adaptive Lanczos method for the evaluation of matrix exponentials and compare their accuracy and efficiency. For each integrator, we use defect-based local error estimators to enable adaptive time-stepping. This serves to reliably control the approximation error and reduce the computational effort.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"2 ","pages":"Article 100018"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415821000092/pdfft?md5=590584d4f65c840eab1611635313b807&pid=1-s2.0-S2772415821000092-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80412302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.jcmds.2022.100023
Jerome Pousin
Recently some neural networks have been proposed for computing approximate solutions to partial differential equations. For second order elliptic or parabolic PDEs, this is possible by using penalized Least squares formulations of PDEs. In this article, for some second order elliptic PDEs we propose a theoretical setting, and we investigate the abstract convergence results between the solution and the computed one with neural networks. These results are obtained by minimizing appropriate loss functions made of a least squares formulation of the PDE augmented with a penalization term for accounting the Dirichlet boundary conditions. More precisely, it is shown that the error has two components, one due to the neural network and one due to the way the boundary conditions are imposed (via a penalization technic). The interplay between the two errors shows that the accuracy of the neural network has to be chosen accordingly with the accuracy of the boundary conditions.
{"title":"Least squares formulations for some elliptic second order problems, feedforward neural network solutions and convergence results","authors":"Jerome Pousin","doi":"10.1016/j.jcmds.2022.100023","DOIUrl":"10.1016/j.jcmds.2022.100023","url":null,"abstract":"<div><p>Recently some neural networks have been proposed for computing approximate solutions to partial differential equations. For second order elliptic or parabolic PDEs, this is possible by using penalized Least squares formulations of PDEs. In this article, for some second order elliptic PDEs we propose a theoretical setting, and we investigate the abstract convergence results between the solution and the computed one with neural networks. These results are obtained by minimizing appropriate loss functions made of a least squares formulation of the PDE augmented with a penalization term for accounting the Dirichlet boundary conditions. More precisely, it is shown that the error has two components, one due to the neural network and one due to the way the boundary conditions are imposed (via a penalization technic). The interplay between the two errors shows that the accuracy of the neural network has to be chosen accordingly with the accuracy of the boundary conditions.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"2 ","pages":"Article 100023"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000013/pdfft?md5=1f9531f8460690468524068d54e3add7&pid=1-s2.0-S2772415822000013-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81555453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1016/j.jcmds.2021.100010
E. Vicente, A. Mateos, E. Mateos
{"title":"Contagion-induced risk: An application to the global export network","authors":"E. Vicente, A. Mateos, E. Mateos","doi":"10.1016/j.jcmds.2021.100010","DOIUrl":"https://doi.org/10.1016/j.jcmds.2021.100010","url":null,"abstract":"","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76131897","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}