The least squares minimal residual (LSMR) method of Fong and Saunders (2011) is an algorithm for solving linear systems Ax = b and least-squares problems min∥Ax - b∥2 that is analytically equivalent to the MINRES method applied to a normal equation ATAx = AT b so that the quantities ∥ATrk∥2 are minimised (where rk = b - Axk is the residual for current iterate xk). This method is based on the Golub-Kahan bidiagonalisation 1 process, which generates orthonormal Krylov basis vectors. Here, the Golub-Kahan bidiagonalisation 2 process is implemented in the LSMR algorithm. This substitution makes the algorithm simpler than the standard algorithm. Also, numerical results show the new form to be competitive.
Fong和Saunders(2011)的最小二乘最小残差(LSMR)方法是一种求解线性系统Ax = b和最小二乘问题min∥Ax - b∥2的算法，其解析等效于应用于正常方程ATAx = AT b的MINRES方法，从而使数量∥ATrk∥2最小化(其中rk = b - Axk是当前迭代xk的残差)。该方法基于Golub-Kahan双对角化1过程，该过程生成标准正交的Krylov基向量。这里，在LSMR算法中实现了Golub-Kahan双对角化2过程。这种替换使算法比标准算法更简单。数值结果表明，新形式具有一定的竞争力。
{"title":"A new form of LSMR for solving linear systems and least-squares problems","authors":"Maryam Mojarrab, Afsaneh Hasanpour, Somayyeh Ghadamyari","doi":"10.1504/ijcsm.2023.134561","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.134561","url":null,"abstract":"The least squares minimal residual (LSMR) method of Fong and Saunders (2011) is an algorithm for solving linear systems Ax = b and least-squares problems min∥Ax - b∥2 that is analytically equivalent to the MINRES method applied to a normal equation ATAx = AT b so that the quantities ∥ATrk∥2 are minimised (where rk = b - Axk is the residual for current iterate xk). This method is based on the Golub-Kahan bidiagonalisation 1 process, which generates orthonormal Krylov basis vectors. Here, the Golub-Kahan bidiagonalisation 2 process is implemented in the LSMR algorithm. This substitution makes the algorithm simpler than the standard algorithm. Also, numerical results show the new form to be competitive.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135262350","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.133641
Kai Guo, Zhi Bai, Zhilin Ma
In this study, the motion model and impedance control model of the 9-DOF manipulator are established, and the impedance parameters in the model are optimised using particle swarm optimisation (PSO) algorithm. The experimental data shows that in the linear motion experiment, the maximum relative oscillation error of each scheme based on fuzzy adaptive proportional, integral and differential (PID) algorithm, offline parameter adjustment method and PSO algorithm on the vertical axis is 3.44%, 6.74% and 5.82% respectively, and the process control time from the contact between the robot and the environment to the contact force stability is 2.57 s, 3.82 s and 2.04 s respectively. The experimental results show that the PSO optimised impedance parameters can significantly improve the compliance control effect of the manipulator.
{"title":"Application of particle swarm optimisation algorithm in manipulator compliance control","authors":"Kai Guo, Zhi Bai, Zhilin Ma","doi":"10.1504/ijcsm.2023.133641","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.133641","url":null,"abstract":"In this study, the motion model and impedance control model of the 9-DOF manipulator are established, and the impedance parameters in the model are optimised using particle swarm optimisation (PSO) algorithm. The experimental data shows that in the linear motion experiment, the maximum relative oscillation error of each scheme based on fuzzy adaptive proportional, integral and differential (PID) algorithm, offline parameter adjustment method and PSO algorithm on the vertical axis is 3.44%, 6.74% and 5.82% respectively, and the process control time from the contact between the robot and the environment to the contact force stability is 2.57 s, 3.82 s and 2.04 s respectively. The experimental results show that the PSO optimised impedance parameters can significantly improve the compliance control effect of the manipulator.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135799461","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 : 2023-01-01DOI: 10.1504/ijcsm.2023.133640
Weidong Tang, Shengnan Li, Huaxu Li
For decades, formal methods have greatly contributed to the modelling and validation of concurrent systems. Event structure is a powerful and efficient formal method. However, the traditional event structure has some limitations, so it cannot describe the exchange process of data flow, but the exchange process of data flow is exactly one of the most important behaviour characteristics of concurrent systems. This paper formally defines a new event structure model based on data flow by means of symbolic computation and uses it for modelling the handling of objects by robots independently and cooperatively.
{"title":"Algebraic modelling of concurrent systems and its practical application","authors":"Weidong Tang, Shengnan Li, Huaxu Li","doi":"10.1504/ijcsm.2023.133640","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.133640","url":null,"abstract":"For decades, formal methods have greatly contributed to the modelling and validation of concurrent systems. Event structure is a powerful and efficient formal method. However, the traditional event structure has some limitations, so it cannot describe the exchange process of data flow, but the exchange process of data flow is exactly one of the most important behaviour characteristics of concurrent systems. This paper formally defines a new event structure model based on data flow by means of symbolic computation and uses it for modelling the handling of objects by robots independently and cooperatively.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135799471","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}
{"title":"A novel distance measure for intuitionistic fuzzy sets and its application in pattern classification, medical diagnosis, and career determination","authors":"Juthika Mahanta, Subhankar Jana, Anjali Patel, Joydeep Patowary","doi":"10.1504/ijcsm.2023.10059831","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10059831","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136372388","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.1504/ijcsm.2022.10046285
Saad Fawzi Al Azzawi, Ahmed S. Al Obeidi
{"title":"A novel six-dimensional hyperchaotic system with self-excited attractors and its chaos synchronisation","authors":"Saad Fawzi Al Azzawi, Ahmed S. Al Obeidi","doi":"10.1504/ijcsm.2022.10046285","DOIUrl":"https://doi.org/10.1504/ijcsm.2022.10046285","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727563","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.1504/IJCSM.2022.10051688
A. Bennani, D. Benterki
{"title":"Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation","authors":"A. Bennani, D. Benterki","doi":"10.1504/IJCSM.2022.10051688","DOIUrl":"https://doi.org/10.1504/IJCSM.2022.10051688","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"16 1","pages":"35-45"},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727616","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.1504/ijcsm.2022.10057619
Shengnan Li, Weidong Tang, Huaxun Li
{"title":"Algebraic modeling of concurrent systems and its practical application","authors":"Shengnan Li, Weidong Tang, Huaxun Li","doi":"10.1504/ijcsm.2022.10057619","DOIUrl":"https://doi.org/10.1504/ijcsm.2022.10057619","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727633","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.1504/IJCSM.2022.122146
Ahmed S. Al-Obeidi, S. Al-Azzawi
{"title":"A novel six-dimensional hyperchaotic system with self-excited attractors and its chaos synchronisation","authors":"Ahmed S. Al-Obeidi, S. Al-Azzawi","doi":"10.1504/IJCSM.2022.122146","DOIUrl":"https://doi.org/10.1504/IJCSM.2022.122146","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"15 1","pages":"72-84"},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727684","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 : 2021-01-01DOI: 10.1504/ijcsm.2021.10042387
Sara Al jdaeh, Sari Awwad, Sahar Idwan, A. Otoom, M. Hammad
{"title":"Predicting the amount of files required to fix a bug","authors":"Sara Al jdaeh, Sari Awwad, Sahar Idwan, A. Otoom, M. Hammad","doi":"10.1504/ijcsm.2021.10042387","DOIUrl":"https://doi.org/10.1504/ijcsm.2021.10042387","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727551","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 : 2020-12-10DOI: 10.1504/ijcsm.2020.10034029
Yang Liu, Wei Wei, Heyang Xu
It has been a consensus that deploying geographically dispersed stream-based online services into distributed cloud platforms has gained exceptional advantages. Globally visiting services make user requests characterised with dramatic fluctuation, which introduces stochastic demands for various resources. In order to maximise satisfied user requests and guarantee quality-of-service under given expense budget, efficient resource deployment becomes the key to this problem. We propose a stochastic demand oriented resource deployment method with more profits and less time complexity. Experiments using simulated and realistic data indicate that proposed method can outperform existing algorithms by increasing the weighted summation of satisfied demands up to 37%, fit for all scenarios with heterogeneous distributed cloud resources.
{"title":"An efficient resource deployment method for steam- based stochastic demands in distributed cloud platforms","authors":"Yang Liu, Wei Wei, Heyang Xu","doi":"10.1504/ijcsm.2020.10034029","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10034029","url":null,"abstract":"It has been a consensus that deploying geographically dispersed stream-based online services into distributed cloud platforms has gained exceptional advantages. Globally visiting services make user requests characterised with dramatic fluctuation, which introduces stochastic demands for various resources. In order to maximise satisfied user requests and guarantee quality-of-service under given expense budget, efficient resource deployment becomes the key to this problem. We propose a stochastic demand oriented resource deployment method with more profits and less time complexity. Experiments using simulated and realistic data indicate that proposed method can outperform existing algorithms by increasing the weighted summation of satisfied demands up to 37%, fit for all scenarios with heterogeneous distributed cloud resources.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"12 1","pages":"205-215"},"PeriodicalIF":0.8,"publicationDate":"2020-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46638700","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
扫码关注我们
求助内容：
应助结果提醒方式：