Pub Date : 2025-02-19DOI: 10.21136/AM.2025.0197-24
Fan Chen, Ming Cui, Chenguang Zhou
We propose a symmetric interior penalty discontinuous Galerkin (DG) method for nonlinear fully coupled quasi-static thermo-poroelasticity problems. Firstly, a fully implicit nonlinear discrete scheme is constructed by adopting the DG method for the spatial approximation and the backward Euler method for the temporal discretization. Subsequently, the existence and uniqueness of the solution of the numerical scheme is proved, and then we derive the a priori error estimate for the three variables, i.e., the displacement, the pressure and the temperature. Lastly, we carry out numerical experiments to confirm the theoretical findings of our suggested approach.
{"title":"Symmetric interior penalty discontinuous Galerkin method for nonlinear fully coupled quasi-static thermo-poroelasticity problems","authors":"Fan Chen, Ming Cui, Chenguang Zhou","doi":"10.21136/AM.2025.0197-24","DOIUrl":"10.21136/AM.2025.0197-24","url":null,"abstract":"<div><p>We propose a symmetric interior penalty discontinuous Galerkin (DG) method for nonlinear fully coupled quasi-static thermo-poroelasticity problems. Firstly, a fully implicit nonlinear discrete scheme is constructed by adopting the DG method for the spatial approximation and the backward Euler method for the temporal discretization. Subsequently, the existence and uniqueness of the solution of the numerical scheme is proved, and then we derive the a priori error estimate for the three variables, i.e., the displacement, the pressure and the temperature. Lastly, we carry out numerical experiments to confirm the theoretical findings of our suggested approach.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"97 - 123"},"PeriodicalIF":0.6,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-18DOI: 10.21136/AM.2025.0237-24
Wei Ma, Yuqing Zhu, Yawei Dang
We study the convergence of two-step Ulm-Chebyshev-like method for solving the inverse singular value problems. We focus on the case when the given singular values are positive and multiple. This work extends the result of W. Ma (2022). We show that the new method is cubically convergent. Moreover, numerical experiments are given in the last section, which show that the proposed method is practical and efficient.
{"title":"Two-step Ulm-Chebyshev-like method for inverse singular value problems with multiple singular values","authors":"Wei Ma, Yuqing Zhu, Yawei Dang","doi":"10.21136/AM.2025.0237-24","DOIUrl":"10.21136/AM.2025.0237-24","url":null,"abstract":"<div><p>We study the convergence of two-step Ulm-Chebyshev-like method for solving the inverse singular value problems. We focus on the case when the given singular values are positive and multiple. This work extends the result of W. Ma (2022). We show that the new method is cubically convergent. Moreover, numerical experiments are given in the last section, which show that the proposed method is practical and efficient.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"65 - 95"},"PeriodicalIF":0.6,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-03DOI: 10.21136/AM.2025.0206-24
Jiří Šremr
We discuss Lyapunov stability/instability of both lower and upper equilibria of free damped pendulum with periodically oscillating suspension point. We recall the results of Bogolyubov and Kapitza, provide new effective criteria of stability/instability of the equilibria of pendulum equation, and give the exact and complete proofs. The criteria obtained are formulated in terms of positivity/negativity of Green’s functions of the periodic boundary value problems for linearized equations. Furthermore, we show that if both lower and upper equilibria are stable, then the pendulum considered may possess a periodic motion that corresponds to the “quasistatic solution” of Bogolyubov as well as to the “quasistatic balance” of Kapitza.
{"title":"On Lyapunov stability/instability of equilibria of free damped pendulum with periodically oscillating suspension point","authors":"Jiří Šremr","doi":"10.21136/AM.2025.0206-24","DOIUrl":"10.21136/AM.2025.0206-24","url":null,"abstract":"<div><p>We discuss Lyapunov stability/instability of both lower and upper equilibria of free damped pendulum with periodically oscillating suspension point. We recall the results of Bogolyubov and Kapitza, provide new effective criteria of stability/instability of the equilibria of pendulum equation, and give the exact and complete proofs. The criteria obtained are formulated in terms of positivity/negativity of Green’s functions of the periodic boundary value problems for linearized equations. Furthermore, we show that if both lower and upper equilibria are stable, then the pendulum considered may possess a periodic motion that corresponds to the “quasistatic solution” of Bogolyubov as well as to the “quasistatic balance” of Kapitza.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"11 - 45"},"PeriodicalIF":0.6,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-26DOI: 10.21136/AM.2025.0114-24
Pavla Hrušková, Zdeněk Dostál, Oldřich Vlach, Petr Vodstrčil
FETI (finite element tearing and interconnecting) based domain decomposition methods are well-established massively parallel methods for solving huge linear systems arising from discretizing partial differential equations. The first steps of FETI decompose the domain into nonoverlapping subdomains, discretize the subdomains using matching grids, and interconnect the adjacent variables by multipoint constraints. However, the multipoint constraints enforcing identification of the corners’ variables do not have a unique representation and their proper choice and modification can improve the performance of FETI. Here, we briefly review the main options, including orthogonal, fully redundant, or localized constraints, and use the basic linear algebra and spectral graph theory to examine the quantitative effect of their choice on the effective control of the feasibility error and rate of convergence of FETI.
{"title":"On multipoint constraints in FETI methods","authors":"Pavla Hrušková, Zdeněk Dostál, Oldřich Vlach, Petr Vodstrčil","doi":"10.21136/AM.2025.0114-24","DOIUrl":"10.21136/AM.2025.0114-24","url":null,"abstract":"<div><p>FETI (finite element tearing and interconnecting) based domain decomposition methods are well-established massively parallel methods for solving huge linear systems arising from discretizing partial differential equations. The first steps of FETI decompose the domain into nonoverlapping subdomains, discretize the subdomains using matching grids, and interconnect the adjacent variables by multipoint constraints. However, the multipoint constraints enforcing identification of the corners’ variables do not have a unique representation and their proper choice and modification can improve the performance of FETI. Here, we briefly review the main options, including orthogonal, fully redundant, or localized constraints, and use the basic linear algebra and spectral graph theory to examine the quantitative effect of their choice on the effective control of the feasibility error and rate of convergence of FETI.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"47 - 64"},"PeriodicalIF":0.6,"publicationDate":"2025-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.21136/AM.2025.0114-24.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-26DOI: 10.21136/AM.2024.0068-24
Haifeng Li, Leiyan Guo
We investigate the recovery of k-sparse signals using the ℓ1-ℓ2 minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume k-sparse signals x with the prior support T which is composed of g true indices and b wrong indices, i.e., ∣T∣ = g+b ⩽ k. First, we derive a new condition based on RIP of order 2α (α = k − g) to guarantee signal recovery via ℓ1-ℓ2 minimization with partial support information. Second, we also derive the high order RIP with tα for some t ⩾ 3 to guarantee signal recovery via ℓ1-ℓ2 minimization with partial support information.
{"title":"Theoretical analysis for ℓ1-ℓ2 minimization with partial support information","authors":"Haifeng Li, Leiyan Guo","doi":"10.21136/AM.2024.0068-24","DOIUrl":"10.21136/AM.2024.0068-24","url":null,"abstract":"<div><p>We investigate the recovery of <i>k</i>-sparse signals using the <i>ℓ</i><sub>1</sub>-<i>ℓ</i><sub>2</sub> minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume <i>k</i>-sparse signals <b>x</b> with the prior support <i>T</i> which is composed of <i>g</i> true indices and <i>b</i> wrong indices, i.e., ∣<i>T</i>∣ = <i>g+b</i> ⩽ <i>k</i>. First, we derive a new condition based on RIP of order 2<i>α</i> (<i>α = k − g</i>) to guarantee signal recovery via <i>ℓ</i><sub>1</sub>-<i>ℓ</i><sub>2</sub> minimization with partial support information. Second, we also derive the high order RIP with <i>tα</i> for some <i>t</i> ⩾ 3 to guarantee signal recovery via <i>ℓ</i><sub>1</sub>-<i>ℓ</i><sub>2</sub> minimization with partial support information.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"125 - 148"},"PeriodicalIF":0.6,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-17DOI: 10.21136/AM.2024.0163-24
Sergey Korotov, Jon Eivind Vatne
We propose some approaches for the generation of conforming simplicial partitions with various regularity properties for polytopic domains that are products or a union of products, thus generalizing our earlier results. The techniques presented can be used for finite element simulations of higher-dimensional problems.
{"title":"Conforming simplicial partitions of product-decomposed polytopes","authors":"Sergey Korotov, Jon Eivind Vatne","doi":"10.21136/AM.2024.0163-24","DOIUrl":"10.21136/AM.2024.0163-24","url":null,"abstract":"<div><p>We propose some approaches for the generation of conforming simplicial partitions with various regularity properties for polytopic domains that are products or a union of products, thus generalizing our earlier results. The techniques presented can be used for finite element simulations of higher-dimensional problems.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"70 1","pages":"1 - 10"},"PeriodicalIF":0.6,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-15DOI: 10.21136/AM.2024.0204-23
Yongjin Kim, Yunchol Jong, Yong Kim
Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. Based on the self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno (SSML-BFGS) method, new conjugate gradient algorithms CG-DESCENT and CGOPT have been proposed by W. Hager, H. Zhang (2005) and Y. Dai, C. Kou (2013), respectively. It is noted that the two conjugate gradient methods perform more efficiently than the SSML-BFGS method. Therefore, C. Kou, Y. Dai (2015) proposed some suitable modifications of the SSML-BFGS method such that the sufficient descent condition holds. For the sake of improvement of modified SSML-BFGS method, in this paper, we present an efficient SSML-BFGS-type three-term conjugate gradient method for solving unconstrained minimization using Ford-Moghrabi secant equation instead of the usual secant equations. The method is shown to be globally convergent under certain assumptions. Numerical results compared with methods using the usual secant equations are reported.
共轭梯度法由于不需要存储矩阵而被广泛应用于求解大规模无约束优化问题。W. Hager, H. Zhang(2005)和Y. Dai, C. Kou(2013)分别在自标度无记忆Broyden-Fletcher-Goldfarb-Shanno (SSML-BFGS)方法的基础上提出了新的共轭梯度算法CG-DESCENT和CGOPT。结果表明,这两种共轭梯度方法比SSML-BFGS方法更有效。因此,C. Kou, Y. Dai(2015)对SSML-BFGS方法提出了一些适当的修改,使其满足充分下降条件。为了改进改进的SSML-BFGS方法,本文提出了一种有效的SSML-BFGS型三项共轭梯度法,用Ford-Moghrabi割线方程代替通常的割线方程求解无约束极小化问题。在一定的假设条件下,证明了该方法是全局收敛的。并将数值结果与常用的正割方程方法进行了比较。
{"title":"A self-scaling memoryless BFGS based conjugate gradient method using multi-step secant condition for unconstrained minimization","authors":"Yongjin Kim, Yunchol Jong, Yong Kim","doi":"10.21136/AM.2024.0204-23","DOIUrl":"10.21136/AM.2024.0204-23","url":null,"abstract":"<div><p>Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. Based on the self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno (SSML-BFGS) method, new conjugate gradient algorithms CG-DESCENT and CGOPT have been proposed by W. Hager, H. Zhang (2005) and Y. Dai, C. Kou (2013), respectively. It is noted that the two conjugate gradient methods perform more efficiently than the SSML-BFGS method. Therefore, C. Kou, Y. Dai (2015) proposed some suitable modifications of the SSML-BFGS method such that the sufficient descent condition holds. For the sake of improvement of modified SSML-BFGS method, in this paper, we present an efficient SSML-BFGS-type three-term conjugate gradient method for solving unconstrained minimization using Ford-Moghrabi secant equation instead of the usual secant equations. The method is shown to be globally convergent under certain assumptions. Numerical results compared with methods using the usual secant equations are reported.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"69 6","pages":"847 - 866"},"PeriodicalIF":0.6,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142845068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce a new scaling parameter for the Dai-Kou family of conjugate gradient algorithms (2013), which is one of the most numerically efficient methods for unconstrained optimization. The suggested parameter is based on eigenvalue analysis of the search direction matrix and minimizing the measure function defined by Dennis and Wolkowicz (1993). The corresponding search direction of conjugate gradient method has the sufficient descent property and the extended conjugacy condition. The global convergence of the proposed algorithm is given for both uniformly convex and general nonlinear objective functions. Also, numerical experiments on a set of test functions of the CUTER collections and the practical problem of the manipulator of robot movement control show that the proposed method is effective.
{"title":"Adjustment of the scaling parameter of Dai-Kou type conjugate gradient methods with application to motion control","authors":"Mahbube Akbari, Saeed Nezhadhosein, Aghile Heydari","doi":"10.21136/AM.2024.0006-24","DOIUrl":"10.21136/AM.2024.0006-24","url":null,"abstract":"<div><p>We introduce a new scaling parameter for the Dai-Kou family of conjugate gradient algorithms (2013), which is one of the most numerically efficient methods for unconstrained optimization. The suggested parameter is based on eigenvalue analysis of the search direction matrix and minimizing the measure function defined by Dennis and Wolkowicz (1993). The corresponding search direction of conjugate gradient method has the sufficient descent property and the extended conjugacy condition. The global convergence of the proposed algorithm is given for both uniformly convex and general nonlinear objective functions. Also, numerical experiments on a set of test functions of the CUTER collections and the practical problem of the manipulator of robot movement control show that the proposed method is effective.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"69 6","pages":"829 - 845"},"PeriodicalIF":0.6,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142845014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-12DOI: 10.21136/AM.2024.0131-24
Andreas Almqvist, Evgeniya Burtseva, Kumbakonam R. Rajagopal, Peter Wall
We consider pressure-driven flow between adjacent surfaces, where the fluid is assumed to have constant density. The main novelty lies in using implicit algebraic constitutive relations to describe the fluid’s response to external stimuli, enabling the modeling of fluids whose responses cannot be accurately captured by conventional methods. When the implicit algebraic constitutive relations cannot be solved for the Cauchy stress in terms of the symmetric part of the velocity gradient, the traditional approach of inserting the expression for the Cauchy stress into the equation for the balance of linear momentum to derive the governing equation for the velocity becomes inapplicable. Instead, a non-standard system of first-order equations governs the flow. This system is highly complex, making it important to develop simplified models. Our primary contribution is the development of a framework for achieving this. Additionally, we apply our findings to a fluid that exhibits an S-shaped curve in the shear stress versus shear rate plot, as observed in some colloidal solutions.
{"title":"On modeling flow between adjacent surfaces where the fluid is governed by implicit algebraic constitutive relations","authors":"Andreas Almqvist, Evgeniya Burtseva, Kumbakonam R. Rajagopal, Peter Wall","doi":"10.21136/AM.2024.0131-24","DOIUrl":"10.21136/AM.2024.0131-24","url":null,"abstract":"<div><p>We consider pressure-driven flow between adjacent surfaces, where the fluid is assumed to have constant density. The main novelty lies in using implicit algebraic constitutive relations to describe the fluid’s response to external stimuli, enabling the modeling of fluids whose responses cannot be accurately captured by conventional methods. When the implicit algebraic constitutive relations cannot be solved for the Cauchy stress in terms of the symmetric part of the velocity gradient, the traditional approach of inserting the expression for the Cauchy stress into the equation for the balance of linear momentum to derive the governing equation for the velocity becomes inapplicable. Instead, a non-standard system of first-order equations governs the flow. This system is highly complex, making it important to develop simplified models. Our primary contribution is the development of a framework for achieving this. Additionally, we apply our findings to a fluid that exhibits an S-shaped curve in the shear stress versus shear rate plot, as observed in some colloidal solutions.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"69 6","pages":"725 - 746"},"PeriodicalIF":0.6,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.21136/AM.2024.0131-24.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142845012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-21DOI: 10.21136/AM.2024.0103-24
Hiroki Ishizaka
We present a precise anisotropic interpolation error estimate for the Morley finite element method (FEM) and apply it to fourth-order elliptic equations. We do not impose the shape-regularity mesh condition in the analysis. Anisotropic meshes can be used for this purpose. The main contributions of this study include providing a new proof of the term consistency. This enables us to obtain an anisotropic consistency error estimate. The core idea of the proof involves using the relationship between the Raviart-Thomas and Morley finite-element spaces. Our results indicate optimal convergence rates and imply that the modified Morley FEM may be effective for errors.
{"title":"Morley finite element analysis for fourth-order elliptic equations under a semi-regular mesh condition","authors":"Hiroki Ishizaka","doi":"10.21136/AM.2024.0103-24","DOIUrl":"10.21136/AM.2024.0103-24","url":null,"abstract":"<div><p>We present a precise anisotropic interpolation error estimate for the Morley finite element method (FEM) and apply it to fourth-order elliptic equations. We do not impose the shape-regularity mesh condition in the analysis. Anisotropic meshes can be used for this purpose. The main contributions of this study include providing a new proof of the term consistency. This enables us to obtain an anisotropic consistency error estimate. The core idea of the proof involves using the relationship between the Raviart-Thomas and Morley finite-element spaces. Our results indicate optimal convergence rates and imply that the modified Morley FEM may be effective for errors.</p></div>","PeriodicalId":55505,"journal":{"name":"Applications of Mathematics","volume":"69 6","pages":"769 - 805"},"PeriodicalIF":0.6,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142844857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}